Logic for performing LU Decomposition https://en.wikipedia.org/wiki/LU_decomposition.
More...
|
| t_type | det () const |
| | Determinant.
|
| Matrix< t_type, t_m, t_n > | getL () const |
| | Return lower triangular factor.
|
| template<class t_pivot_type = sint04> |
| Vector< t_m, t_pivot_type > | getPivot () const |
| | Return pivot permutation vector.
|
| Matrix< t_type, t_m, t_n > | getU () const |
| | Return upper triangular factor.
|
| bool | isNonsingular () const |
| | Is the matrix nonsingular?
|
| template<uint01 t_nx> |
| Matrix< t_type, t_m, t_nx > | solve (const Matrix< t_type, t_m, t_nx > &B) |
| | Solve A*X = B.
|
template<class t_type,
uint01 t_m,
uint01 t_n>
class LUDecomposition< t_type, t_m, t_n >
Logic for performing LU Decomposition https://en.wikipedia.org/wiki/LU_decomposition.
Definition at line 40 of file LUDecomposition.hpp.
◆ det()
◆ getL()
◆ getPivot()
template<class t_pivot_type = sint04>
◆ getU()
◆ isNonsingular()
Is the matrix nonsingular?
- Returns
- true if U, and hence A, is nonsingular.
Definition at line 119 of file LUDecomposition.hpp.
Referenced by solve().
◆ solve()
The documentation for this class was generated from the following file: