#include <EpetraExt_AmesosBTFGlobal_LinearProblem.h>
|
|
| AmesosBTFGlobal_LinearProblem (double thresh=0.0, const std::string &balanceType="linear", bool upperTri=false, bool verbose=false, bool debug=false) |
| |
|
NewTypeRef | operator() (OriginalTypeRef orig) |
| |
|
bool | fwd () |
| |
|
bool | rvs () |
| |
|
Teuchos::RCP< Epetra_Import > | Importer () |
| |
|
std::vector< int > | RowPerm () |
| |
|
std::vector< int > | ColPerm () |
| |
|
std::vector< int > | BlockPtr () |
| |
|
int | NumBlocks () |
| |
Block Triangular Factorization (Reordering) of an Epetra_CrsMatrix
Uses Tim Davis' BTF algorithm to find a block lower or upper triangular ordering form a Epetra_CrsMatrix.
The documentation for this class was generated from the following files:
- EpetraExt_AmesosBTFGlobal_LinearProblem.h
- EpetraExt_AmesosBTFGlobal_LinearProblem.cpp
1.8.5
