modm API documentation
|
Class for decomposing matrices. More...
#include <modm/math/lu_decomposition.hpp>
Static Public Member Functions | |
template<typename T , uint8_t N> | |
static bool | decompose (const Matrix< T, N, N > &matrix, Matrix< T, N, N > *l, Matrix< T, N, N > *u) |
template<typename T , uint8_t N> | |
static bool | decompose (const Matrix< T, N, N > &matrix, Matrix< T, N, N > *l, Matrix< T, N, N > *u, Matrix< T, N, N > *p) |
template<typename T , uint8_t N> | |
static bool | decompose (const Matrix< T, N, N > &matrix, Matrix< T, N, N > *l, Matrix< T, N, N > *u, Vector< int8_t, N > *p) |
template<typename T , uint8_t N, uint8_t BXWIDTH> | |
static bool | solve (const Matrix< T, N, N > &l, const Matrix< T, N, N > &u, Matrix< T, N, BXWIDTH > *xb) |
template<typename T , uint8_t N, uint8_t BXWIDTH> | |
static bool | solve (const Matrix< T, N, N > &A, Matrix< T, N, BXWIDTH > *xb) |
Class for decomposing matrices.
Factorise a matrix A into an L(ower) and U(pper) matrix such that A = L*U or P*A = L*U where P is a pivot matrix (changes the row order).
Adapted from the implementation of Gaspard Petit (gaspardpetit@gmail.com).