Namespaces | |
namespace | MPI |
namespace | MatrixIterators |
namespace | SparsityPatternIterators |
Classes | |
class | BlockSparsityPattern |
class | BlockSparseMatrix |
class | BlockVector |
class | PreconditionBase |
class | PreconditionJacobi |
class | PreconditionSSOR |
class | PreconditionSOR |
class | PreconditionIC |
class | PreconditionILU |
class | PreconditionILUT |
class | PreconditionBlockwiseDirect |
class | PreconditionChebyshev |
class | PreconditionAMG |
class | PreconditionBlockBase |
class | PreconditionStokes |
class | SolverBase |
class | SolverCG |
class | SolverCGS |
class | SolverGMRES |
class | SolverBicgstab |
class | SolverTFQMR |
class | SolverDirect |
class | SolverBlockBase |
class | SolverBlockCG |
class | SolverBlockGMRES |
class | SparseMatrix |
class | SparsityPattern |
class | Vector |
class | VectorBase |
Functions | |
Thyra::ConstLinearOperator < double > | inverse_matrix (const SparseMatrix &M, const Epetra_Operator *P, const bool is_symmetric, const unsigned int n_iterations, const double solve_tolerance, const bool output_details) |
This class is has properties of the "dynamic" type of Sparsity patterns (in the sense that it can extend the memory if too little elements were allocated), but otherwise is more like the basic deal.II SparsityPattern (in the sense that the method compress() needs to be called before the pattern can be used).
This class is used in the future step-32 tutorial program.
Thyra::ConstLinearOperator<double> TrilinosWrappers::inverse_matrix | ( | const SparseMatrix & | M, | |
const Epetra_Operator * | P, | |||
const bool | is_symmetric, | |||
const unsigned int | n_iterations, | |||
const double | solve_tolerance, | |||
const bool | output_details | |||
) | [inline] |
Internal function that sets up an inverse matrix.