Result of LU decomposition with partial pivoting. More...
#include <lu.h>
Collaboration diagram for matrix_algorithms::LUResult< T, N >:
Public Member Functions | |
| FusedMatrix< T, N, N > | L () const |
| Extract the lower-triangular factor L with unit diagonal. | |
| FusedMatrix< T, N, N > | U () const |
| Extract the upper-triangular factor U. | |
Public Attributes | |
| FusedMatrix< T, N, N > | LU |
| Compact L+U storage. | |
| FusedVector< my_size_t, N > | perm |
| Row permutation: perm(i) = original row index. | |
| int | sign |
| Permutation sign: +1 (even) or -1 (odd). | |
Detailed Description
template<typename T, my_size_t N>
struct matrix_algorithms::LUResult< T, N >
struct matrix_algorithms::LUResult< T, N >
Result of LU decomposition with partial pivoting.
Stores the compact LU factorization (L below diagonal with implicit unit diagonal, U on and above diagonal), the row permutation vector, and the permutation sign for determinant computation.
- Template Parameters
-
T Scalar type. N Matrix dimension.
Member Function Documentation
◆ L()
template<typename T , my_size_t N>
|
inline |
Extract the lower-triangular factor L with unit diagonal.
- Returns
- N×N matrix with L(i,j) from compact storage below diagonal, ones on diagonal, zeros above.
◆ U()
template<typename T , my_size_t N>
|
inline |
Extract the upper-triangular factor U.
- Returns
- N×N matrix with U(i,j) from compact storage on and above diagonal, zeros below.
Member Data Documentation
◆ LU
template<typename T , my_size_t N>
| FusedMatrix<T, N, N> matrix_algorithms::LUResult< T, N >::LU |
Compact L+U storage.
◆ perm
template<typename T , my_size_t N>
| FusedVector<my_size_t, N> matrix_algorithms::LUResult< T, N >::perm |
Row permutation: perm(i) = original row index.
◆ sign
template<typename T , my_size_t N>
| int matrix_algorithms::LUResult< T, N >::sign |
Permutation sign: +1 (even) or -1 (odd).
The documentation for this struct was generated from the following file:
- core/include/algorithms/decomposition/lu.h
