Seldon::SparseSeldonSolver< T, Allocator > Class Template Reference

Default solver in Seldon. More...

#include <SparseSolver.hxx>

List of all members.

Public Member Functions

void Clear ()
void HideMessages ()
void ShowMessages ()
double GetPivotThreshold () const
void SetPivotThreshold (const double &)
template<class T0 , class Storage0 , class Allocator0 >
void FactorizeMatrix (const IVect &perm, Matrix< T0, General, Storage0, Allocator0 > &mat, bool keep_matrix=false)
template<class T0 , class Storage0 , class Allocator0 >
void FactorizeMatrix (const IVect &perm, Matrix< T0, Symmetric, Storage0, Allocator0 > &mat, bool keep_matrix=false)
template<class Vector1 >
void Solve (Vector1 &z)
template<class TransStatus , class Vector1 >
void Solve (const TransStatus &TransA, Vector1 &z)

Protected Attributes

int print_level
 Verbosity level.
double permtol
 Threshold for pivoting.
Matrix< T, Symmetric,
ArrayRowSymSparse, Allocator > 
mat_sym
 Symmetric matrix.
Matrix< T, General,
ArrayRowSparse, Allocator > 
mat_unsym
 Unsymmetric matrix.
IVect permutation_row
 Permutation arrays.
IVect permutation_col
Vector< T, VectFull, Allocator > xtmp
 Temporary vector.
bool symmetric_matrix
 Is the factorization contained in "mat_sym"?

Detailed Description

template<class T, class Allocator = SELDON_DEFAULT_ALLOCATOR<T>>
class Seldon::SparseSeldonSolver< T, Allocator >

Default solver in Seldon.

Definition at line 33 of file SparseSolver.hxx.


The documentation for this class was generated from the following files: