Householder QR decomposition of a matrix. More...
#include <HouseholderQR.h>
Public Types | |
enum | { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, Options = MatrixType::Options, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime } |
typedef _MatrixType | MatrixType |
typedef MatrixType::Scalar | Scalar |
typedef MatrixType::RealScalar | RealScalar |
typedef MatrixType::Index | Index |
typedef Matrix< Scalar, RowsAtCompileTime, RowsAtCompileTime,(MatrixType::Flags &RowMajorBit)?RowMajor:ColMajor, MaxRowsAtCompileTime, MaxRowsAtCompileTime > | MatrixQType |
typedef internal::plain_diag_type < MatrixType >::type | HCoeffsType |
typedef internal::plain_row_type < MatrixType >::type | RowVectorType |
typedef HouseholderSequence < MatrixType, HCoeffsType > ::ConjugateReturnType | HouseholderSequenceType |
Public Member Functions | |
HouseholderQR () | |
Default Constructor. | |
HouseholderQR (Index rows, Index cols) | |
Default Constructor with memory preallocation. | |
HouseholderQR (const MatrixType &matrix) | |
template<typename Rhs > | |
const internal::solve_retval < HouseholderQR, Rhs > | solve (const MatrixBase< Rhs > &b) const |
HouseholderSequenceType | householderQ () const |
const MatrixType & | matrixQR () const |
HouseholderQR & | compute (const MatrixType &matrix) |
MatrixType::RealScalar | absDeterminant () const |
MatrixType::RealScalar | logAbsDeterminant () const |
Index | rows () const |
Index | cols () const |
const HCoeffsType & | hCoeffs () const |
Protected Attributes | |
MatrixType | m_qr |
HCoeffsType | m_hCoeffs |
RowVectorType | m_temp |
bool | m_isInitialized |
Householder QR decomposition of a matrix.
MatrixType | the type of the matrix of which we are computing the QR decomposition |
This class performs a QR decomposition of a matrix A into matrices Q and R such that
by using Householder transformations. Here, Q a unitary matrix and R an upper triangular matrix. The result is stored in a compact way compatible with LAPACK.
Note that no pivoting is performed. This is not a rank-revealing decomposition. If you want that feature, use FullPivHouseholderQR or ColPivHouseholderQR instead.
This Householder QR decomposition is faster, but less numerically stable and less feature-full than FullPivHouseholderQR or ColPivHouseholderQR.
typedef internal::plain_diag_type<MatrixType>::type HouseholderQR< _MatrixType >::HCoeffsType |
typedef HouseholderSequence<MatrixType,HCoeffsType>::ConjugateReturnType HouseholderQR< _MatrixType >::HouseholderSequenceType |
typedef MatrixType::Index HouseholderQR< _MatrixType >::Index |
typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, (MatrixType::Flags&RowMajorBit) ? RowMajor : ColMajor, MaxRowsAtCompileTime, MaxRowsAtCompileTime> HouseholderQR< _MatrixType >::MatrixQType |
typedef _MatrixType HouseholderQR< _MatrixType >::MatrixType |
typedef MatrixType::RealScalar HouseholderQR< _MatrixType >::RealScalar |
typedef internal::plain_row_type<MatrixType>::type HouseholderQR< _MatrixType >::RowVectorType |
typedef MatrixType::Scalar HouseholderQR< _MatrixType >::Scalar |
anonymous enum |
HouseholderQR< _MatrixType >::HouseholderQR | ( | ) | [inline] |
Default Constructor.
The default constructor is useful in cases in which the user intends to perform decompositions via HouseholderQR::compute(const MatrixType&).
HouseholderQR< _MatrixType >::HouseholderQR | ( | Index | rows, | |
Index | cols | |||
) | [inline] |
Default Constructor with memory preallocation.
Like the default constructor but with preallocation of the internal data according to the specified problem size.
HouseholderQR< _MatrixType >::HouseholderQR | ( | const MatrixType & | matrix | ) | [inline] |
MatrixType::RealScalar HouseholderQR< _MatrixType >::absDeterminant | ( | ) | const |
Index HouseholderQR< _MatrixType >::cols | ( | void | ) | const [inline] |
HouseholderQR& HouseholderQR< _MatrixType >::compute | ( | const MatrixType & | matrix | ) |
const HCoeffsType& HouseholderQR< _MatrixType >::hCoeffs | ( | ) | const [inline] |
HouseholderSequenceType HouseholderQR< _MatrixType >::householderQ | ( | void | ) | const [inline] |
MatrixType::RealScalar HouseholderQR< _MatrixType >::logAbsDeterminant | ( | ) | const |
const MatrixType& HouseholderQR< _MatrixType >::matrixQR | ( | ) | const [inline] |
Index HouseholderQR< _MatrixType >::rows | ( | void | ) | const [inline] |
const internal::solve_retval<HouseholderQR, Rhs> HouseholderQR< _MatrixType >::solve | ( | const MatrixBase< Rhs > & | b | ) | const [inline] |
This method finds a solution x to the equation Ax=b, where A is the matrix of which *this is the QR decomposition, if any exists.
b | the right-hand-side of the equation to solve. |
Example:
Output:
HCoeffsType HouseholderQR< _MatrixType >::m_hCoeffs [protected] |
bool HouseholderQR< _MatrixType >::m_isInitialized [protected] |
MatrixType HouseholderQR< _MatrixType >::m_qr [protected] |
RowVectorType HouseholderQR< _MatrixType >::m_temp [protected] |