/usr/lib/slepcdir/3.6.1/x86_64-linux-gnu-complex/include/slepc/private/pepimpl.h is in libslepc-complex-3.6.1-dev 3.6.1.dfsg1-2build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 | /*
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
SLEPc - Scalable Library for Eigenvalue Problem Computations
Copyright (c) 2002-2015, Universitat Politecnica de Valencia, Spain
This file is part of SLEPc.
SLEPc is free software: you can redistribute it and/or modify it under the
terms of version 3 of the GNU Lesser General Public License as published by
the Free Software Foundation.
SLEPc is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for
more details.
You should have received a copy of the GNU Lesser General Public License
along with SLEPc. If not, see <http://www.gnu.org/licenses/>.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
*/
#if !defined(_PEPIMPL)
#define _PEPIMPL
#include <slepcpep.h>
#include <slepc/private/slepcimpl.h>
PETSC_EXTERN PetscBool PEPRegisterAllCalled;
PETSC_EXTERN PetscErrorCode PEPRegisterAll(void);
PETSC_EXTERN PetscLogEvent PEP_SetUp,PEP_Solve,PEP_Refine;
typedef struct _PEPOps *PEPOps;
struct _PEPOps {
PetscErrorCode (*solve)(PEP);
PetscErrorCode (*setup)(PEP);
PetscErrorCode (*setfromoptions)(PetscOptions*,PEP);
PetscErrorCode (*publishoptions)(PEP);
PetscErrorCode (*destroy)(PEP);
PetscErrorCode (*reset)(PEP);
PetscErrorCode (*view)(PEP,PetscViewer);
PetscErrorCode (*backtransform)(PEP);
PetscErrorCode (*computevectors)(PEP);
PetscErrorCode (*extractvectors)(PEP);
};
/*
Maximum number of monitors you can run with a single PEP
*/
#define MAXPEPMONITORS 5
typedef enum { PEP_STATE_INITIAL,
PEP_STATE_SETUP,
PEP_STATE_SOLVED,
PEP_STATE_EIGENVECTORS } PEPStateType;
/*
Defines the PEP data structure.
*/
struct _p_PEP {
PETSCHEADER(struct _PEPOps);
/*------------------------- User parameters ---------------------------*/
PetscInt max_it; /* maximum number of iterations */
PetscInt nev; /* number of eigenvalues to compute */
PetscInt ncv; /* number of basis vectors */
PetscInt mpd; /* maximum dimension of projected problem */
PetscInt nini; /* number of initial vectors (negative means not copied yet) */
PetscScalar target; /* target value */
PetscReal tol; /* tolerance */
PEPConv conv; /* convergence test */
PEPWhich which; /* which part of the spectrum to be sought */
PEPBasis basis; /* polynomial basis used to represent the problem */
PEPProblemType problem_type; /* which kind of problem to be solved */
PEPScale scale; /* scaling strategy to be used */
PetscReal sfactor,dsfactor; /* scaling factors */
PetscInt sits; /* number of iterations of the scaling method */
PetscReal slambda; /* norm eigenvalue approximation for scaling */
PEPRefine refine; /* type of refinement to be applied after solve */
PetscInt npart; /* number of partitions of the communicator */
PetscReal rtol; /* tolerance for refinement */
PetscInt rits; /* number of iterations of the refinement method */
PetscBool schur; /* use Schur complement in refinement method */
PEPExtract extract; /* type of extraction used */
PetscBool trackall; /* whether all the residuals must be computed */
/*-------------- User-provided functions and contexts -----------------*/
PetscErrorCode (*converged)(PEP,PetscScalar,PetscScalar,PetscReal,PetscReal*,void*);
PetscErrorCode (*convergeddestroy)(void*);
void *convergedctx;
PetscErrorCode (*monitor[MAXPEPMONITORS])(PEP,PetscInt,PetscInt,PetscScalar*,PetscScalar*,PetscReal*,PetscInt,void*);
PetscErrorCode (*monitordestroy[MAXPEPMONITORS])(void**);
void *monitorcontext[MAXPEPMONITORS];
PetscInt numbermonitors;
/*----------------- Child objects and working data -------------------*/
ST st; /* spectral transformation object */
DS ds; /* direct solver object */
BV V; /* set of basis vectors and computed eigenvectors */
RG rg; /* optional region for filtering */
PetscRandom rand; /* random number generator */
SlepcSC sc; /* sorting criterion data */
Mat *A; /* coefficient matrices of the polynomial */
PetscInt nmat; /* number of matrices */
Vec Dl,Dr; /* diagonal matrices for balancing */
Vec *IS; /* references to user-provided initial space */
PetscScalar *eigr,*eigi; /* real and imaginary parts of eigenvalues */
PetscReal *errest; /* error estimates */
PetscInt *perm; /* permutation for eigenvalue ordering */
PetscReal *pbc; /* coefficients defining the polynomial basis */
PetscScalar *solvematcoeffs; /* coefficients to compute the matrix to be inverted */
PetscInt nwork; /* number of work vectors */
Vec *work; /* work vectors */
KSP refineksp; /* ksp used in refinement */
PetscSubcomm refinesubc; /* context for sub-communicators */
void *data; /* placeholder for solver-specific stuff */
/* ----------------------- Status variables --------------------------*/
PEPStateType state; /* initial -> setup -> solved -> eigenvectors */
PetscInt nconv; /* number of converged eigenvalues */
PetscInt its; /* number of iterations so far computed */
PetscInt n,nloc; /* problem dimensions (global, local) */
PetscReal *nrma; /* computed matrix norms */
PetscReal nrml[2]; /* computed matrix norms for the linearization */
PetscBool sfactor_set; /* flag to indicate the user gave sfactor */
PetscBool lineariz; /* current solver is based on linearization */
PEPConvergedReason reason;
};
/*
Macros to test valid PEP arguments
*/
#if !defined(PETSC_USE_DEBUG)
#define PEPCheckSolved(h,arg) do {} while (0)
#else
#define PEPCheckSolved(h,arg) \
do { \
if (h->state<PEP_STATE_SOLVED) SETERRQ1(PetscObjectComm((PetscObject)h),PETSC_ERR_ARG_WRONGSTATE,"Must call PEPSolve() first: Parameter #%d",arg); \
} while (0)
#endif
PETSC_INTERN PetscErrorCode PEPSetDimensions_Default(PEP,PetscInt,PetscInt*,PetscInt*);
PETSC_INTERN PetscErrorCode PEPExtractVectors(PEP);
PETSC_INTERN PetscErrorCode PEPBackTransform_Default(PEP);
PETSC_INTERN PetscErrorCode PEPComputeVectors(PEP);
PETSC_INTERN PetscErrorCode PEPComputeVectors_Default(PEP);
PETSC_INTERN PetscErrorCode PEPComputeVectors_Indefinite(PEP);
PETSC_INTERN PetscErrorCode PEPComputeResidualNorm_Private(PEP,PetscScalar,PetscScalar,Vec,Vec,Vec*,PetscReal*);
PETSC_INTERN PetscErrorCode PEPKrylovConvergence(PEP,PetscBool,PetscInt,PetscInt,PetscReal,PetscInt*);
PETSC_INTERN PetscErrorCode PEPComputeScaleFactor(PEP);
PETSC_INTERN PetscErrorCode PEPBuildDiagonalScaling(PEP);
PETSC_INTERN PetscErrorCode PEPBasisCoefficients(PEP,PetscReal*);
PETSC_INTERN PetscErrorCode PEPEvaluateBasis(PEP,PetscScalar,PetscScalar,PetscScalar*,PetscScalar*);
PETSC_INTERN PetscErrorCode PEPNewtonRefinement_TOAR(PEP,PetscScalar,PetscInt*,PetscReal*,PetscInt,PetscScalar*,PetscInt,PetscInt*);
PETSC_INTERN PetscErrorCode PEPNewtonRefinementSimple(PEP,PetscInt*,PetscReal*,PetscInt);
PETSC_INTERN PetscErrorCode PEPComputeLinearNorms(PEP);
#endif
|