LU decomposition of a matrix with partial pivoting, and related features. More...
#include <ForwardDeclarations.h>
Public Types | |
enum | { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, Options = MatrixType::Options, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime } |
typedef MatrixType::Index | Index |
typedef _MatrixType | MatrixType |
typedef PermutationMatrix< RowsAtCompileTime, MaxRowsAtCompileTime > | PermutationType |
typedef NumTraits< typename MatrixType::Scalar >::Real | RealScalar |
typedef MatrixType::Scalar | Scalar |
typedef internal::traits< MatrixType >::StorageKind | StorageKind |
typedef Transpositions< RowsAtCompileTime, MaxRowsAtCompileTime > | TranspositionType |
Public Member Functions | |
Index | cols () const |
PartialPivLU & | compute (const MatrixType &matrix) |
internal::traits< MatrixType >::Scalar | determinant () const |
const internal::solve_retval< PartialPivLU, typename MatrixType::IdentityReturnType > | inverse () const |
const MatrixType & | matrixLU () const |
PartialPivLU () | |
Default Constructor. More... | |
PartialPivLU (Index size) | |
Default Constructor with memory preallocation. More... | |
PartialPivLU (const MatrixType &matrix) | |
const PermutationType & | permutationP () const |
MatrixType | reconstructedMatrix () const |
Index | rows () const |
template<typename Rhs > | |
const internal::solve_retval< PartialPivLU, Rhs > | solve (const MatrixBase< Rhs > &b) const |
Protected Attributes | |
Index | m_det_p |
bool | m_isInitialized |
MatrixType | m_lu |
PermutationType | m_p |
TranspositionType | m_rowsTranspositions |
LU decomposition of a matrix with partial pivoting, and related features.
MatrixType | the type of the matrix of which we are computing the LU decomposition |
This class represents a LU decomposition of a square invertible matrix, with partial pivoting: the matrix A is decomposed as A = PLU where L is unit-lower-triangular, U is upper-triangular, and P is a permutation matrix.
Typically, partial pivoting LU decomposition is only considered numerically stable for square invertible matrices. Thus LAPACK's dgesv and dgesvx require the matrix to be square and invertible. The present class does the same. It will assert that the matrix is square, but it won't (actually it can't) check that the matrix is invertible: it is your task to check that you only use this decomposition on invertible matrices.
The guaranteed safe alternative, working for all matrices, is the full pivoting LU decomposition, provided by class FullPivLU.
This is not a rank-revealing LU decomposition. Many features are intentionally absent from this class, such as rank computation. If you need these features, use class FullPivLU.
This LU decomposition is suitable to invert invertible matrices. It is what MatrixBase::inverse() uses in the general case. On the other hand, it is not suitable to determine whether a given matrix is invertible.
The data of the LU decomposition can be directly accessed through the methods matrixLU(), permutationP().
Definition at line 217 of file ForwardDeclarations.h.
typedef MatrixType::Index Eigen::PartialPivLU< _MatrixType >::Index |
Definition at line 62 of file PartialPivLU.h.
typedef _MatrixType Eigen::PartialPivLU< _MatrixType >::MatrixType |
Definition at line 51 of file PartialPivLU.h.
typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> Eigen::PartialPivLU< _MatrixType >::PermutationType |
Definition at line 63 of file PartialPivLU.h.
typedef NumTraits<typename MatrixType::Scalar>::Real Eigen::PartialPivLU< _MatrixType >::RealScalar |
Definition at line 60 of file PartialPivLU.h.
typedef MatrixType::Scalar Eigen::PartialPivLU< _MatrixType >::Scalar |
Definition at line 59 of file PartialPivLU.h.
typedef internal::traits<MatrixType>::StorageKind Eigen::PartialPivLU< _MatrixType >::StorageKind |
Definition at line 61 of file PartialPivLU.h.
typedef Transpositions<RowsAtCompileTime, MaxRowsAtCompileTime> Eigen::PartialPivLU< _MatrixType >::TranspositionType |
Definition at line 64 of file PartialPivLU.h.
anonymous enum |
Enumerator | |
---|---|
RowsAtCompileTime | |
ColsAtCompileTime | |
Options | |
MaxRowsAtCompileTime | |
MaxColsAtCompileTime |
Definition at line 52 of file PartialPivLU.h.
Eigen::PartialPivLU< MatrixType >::PartialPivLU | ( | ) |
Default Constructor.
The default constructor is useful in cases in which the user intends to perform decompositions via PartialPivLU::compute(const MatrixType&).
Definition at line 182 of file PartialPivLU.h.
Eigen::PartialPivLU< MatrixType >::PartialPivLU | ( | Index | size | ) |
Default Constructor with memory preallocation.
Like the default constructor but with preallocation of the internal data according to the specified problem size.
Definition at line 192 of file PartialPivLU.h.
Eigen::PartialPivLU< MatrixType >::PartialPivLU | ( | const MatrixType & | matrix | ) |
Constructor.
matrix | the matrix of which to compute the LU decomposition. |
Definition at line 202 of file PartialPivLU.h.
|
inline |
Definition at line 171 of file PartialPivLU.h.
PartialPivLU< MatrixType > & Eigen::PartialPivLU< MatrixType >::compute | ( | const MatrixType & | matrix | ) |
Definition at line 387 of file PartialPivLU.h.
internal::traits< MatrixType >::Scalar Eigen::PartialPivLU< MatrixType >::determinant | ( | ) | const |
Definition at line 410 of file PartialPivLU.h.
|
inline |
Definition at line 146 of file PartialPivLU.h.
|
inline |
Definition at line 100 of file PartialPivLU.h.
|
inline |
Definition at line 108 of file PartialPivLU.h.
MatrixType Eigen::PartialPivLU< MatrixType >::reconstructedMatrix | ( | ) | const |
Definition at line 420 of file PartialPivLU.h.
|
inline |
Definition at line 170 of file PartialPivLU.h.
|
inline |
This method returns the solution x to the equation Ax=b, where A is the matrix of which *this is the LU decomposition.
b | the right-hand-side of the equation to solve. Can be a vector or a matrix, the only requirement in order for the equation to make sense is that b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition. |
Example:
Since this PartialPivLU class assumes anyway that the matrix A is invertible, the solution theoretically exists and is unique regardless of b.
Definition at line 133 of file PartialPivLU.h.
|
protected |
Definition at line 177 of file PartialPivLU.h.
|
protected |
Definition at line 178 of file PartialPivLU.h.
|
protected |
Definition at line 174 of file PartialPivLU.h.
|
protected |
Definition at line 175 of file PartialPivLU.h.
|
protected |
Definition at line 176 of file PartialPivLU.h.