Go to the documentation of this file.
18 #ifndef __RIPLEY_RIPLEY_H__
19 #define __RIPLEY_RIPLEY_H__
26 #include <ripley/system_dep.h>
28 #include <escript/EsysMPI.h>
30 #include <boost/shared_ptr.hpp>
47 typedef std::map<std::string,int>
TagMap;
index_t * mask_C
Definition: Preconditioner.h:124
dim_t n_block
Definition: Preconditioner.h:114
dim_t n
Definition: Preconditioner.h:113
@ ReducedElements
Definition: Ripley.h:55
dim_t n_C
Definition: Preconditioner.h:116
Definition: ripley/src/AbstractAssembler.h:26
double real_t
type of all real-valued scalars in escript
Definition: DataTypes.h:52
boost::shared_ptr< SparseMatrix< T > > SparseMatrix_ptr
Definition: SparseMatrix.h:37
double * b_F
Definition: Preconditioner.h:126
@ Points
Definition: Ripley.h:58
std::map< std::string, int > TagMap
Definition: Ripley.h:47
@ Nodes
Definition: Ripley.h:52
@ ReducedDegreesOfFreedom
Definition: Ripley.h:51
double * b_C
Definition: Preconditioner.h:128
@ Elements
Definition: Ripley.h:54
index_t cumsum(dim_t N, index_t *array)
calculates the cumulative sum in array and returns the total sum
Definition: PasoUtil.cpp:86
@ DegreesOfFreedom
Definition: Ripley.h:50
SparseMatrix_ptr< double > A_FC
Definition: Preconditioner.h:119
std::pair< index_t, index_t > IndexPair
Definition: Ripley.h:43
@ ReducedNodes
Definition: Ripley.h:53
void Solver_RILU_free(Solver_RILU *in)
Definition: RILU.cpp:35
dim_t n_F
Definition: Preconditioner.h:115
std::vector< int > RankVector
Definition: Ripley.h:46
void BlockOps_solveAll(dim_t n_block, dim_t n, double *D, index_t *pivot, double *x)
Definition: BlockOps.h:219
void copy(dim_t N, double *out, const double *in)
out = in
Definition: PasoUtil.h:88
int comparIndex(const void *index1, const void *index2)
this int-comparison function is used by qsort/bsearch in various places
Definition: PasoUtil.cpp:25
index_t dim_t
Definition: DataTypes.h:66
Solver_RILU * RILU_of_Schur
Definition: Preconditioner.h:129
RILU preconditioner.
Definition: Preconditioner.h:112
index_t * rows_in_C
Definition: Preconditioner.h:122
void Solver_updateIncompleteSchurComplement(SparseMatrix_ptr< double > A_CC, SparseMatrix_ptr< double > A_CF, double *invA_FF, index_t *A_FF_pivot, SparseMatrix_ptr< double > A_FC)
Definition: SchurComplement.cpp:28
std::vector< real_t > DoubleVector
Definition: Ripley.h:45
index_t * mask_F
Definition: Preconditioner.h:123
@ FaceElements
Definition: Ripley.h:56
void Solver_solveRILU(Solver_RILU *rilu, double *x, double *b)
Definition: RILU.cpp:289
double * inv_A_FF
Definition: Preconditioner.h:117
PasoException exception class.
Definition: PasoException.h:34
double gettime()
returns the current ticks for timing
Definition: EsysMPI.h:192
int index_t
type for array/matrix indices used both globally and on each rank
Definition: DataTypes.h:61
SparseMatrix_ptr< double > A_CF
Definition: Preconditioner.h:120
std::vector< index_t > IndexVector
Definition: Ripley.h:44
double * x_C
Definition: Preconditioner.h:127
void SparseMatrix_MatrixVector_CSR_OFFSET0(const double alpha, const_SparseMatrix_ptr< double > A, const double *in, const double beta, double *out)
Definition: SparseMatrix_MatrixVector.cpp:191
double * x_F
Definition: Preconditioner.h:125
index_t * A_FF_pivot
Definition: Preconditioner.h:118
@ ReducedFaceElements
Definition: Ripley.h:57
Definition: BiCGStab.cpp:25
std::complex< real_t > cplx_t
complex data type
Definition: DataTypes.h:55
index_t * rows_in_F
Definition: Preconditioner.h:121
Solver_RILU * Solver_getRILU(SparseMatrix_ptr< double > A, bool verbose)
Definition: RILU.cpp:71