KrisLibrary
1.0.0
|
Forms the LU decomposition A=PLU. More...
#include <LUDecomposition.h>
Public Types | |
typedef MatrixTemplate< T > | MatrixT |
typedef VectorTemplate< T > | VectorT |
Public Member Functions | |
LUDecomposition (const MatrixT &A) | |
bool | set (const MatrixT &A) |
void | backSub (const VectorT &b, VectorT &x) const |
void | PBackSub (const VectorT &b, VectorT &x) const |
void | LBackSub (const VectorT &b, VectorT &x) const |
void | UBackSub (const VectorT &b, VectorT &x) const |
void | getInverse (MatrixT &Ainv) const |
void | getL (MatrixT &L) const |
void | getU (MatrixT &U) const |
Public Attributes | |
MatrixT | LU |
std::vector< int > | P |
T | zeroTolerance |
Forms the LU decomposition A=PLU.
L is stored in the lower sub-diagonal triangle of LU, and formed to have ones on the diagonal. U is stored in the upper triangle of LU. P^-1 is stored as a permutation vector