|
| FullPivHouseholderQR () |
| Default Constructor. More...
|
|
| FullPivHouseholderQR (Index rows, Index cols) |
| Default Constructor with memory preallocation. More...
|
|
template<typename InputType > |
| FullPivHouseholderQR (const EigenBase< InputType > &matrix) |
| Constructs a QR factorization from a given matrix. More...
|
|
template<typename InputType > |
| FullPivHouseholderQR (EigenBase< InputType > &matrix) |
| Constructs a QR factorization from a given matrix. More...
|
|
MatrixQReturnType | matrixQ (void) const |
|
const MatrixType & | matrixQR () const |
|
template<typename InputType > |
FullPivHouseholderQR & | compute (const EigenBase< InputType > &matrix) |
|
const PermutationType & | colsPermutation () const |
|
const IntDiagSizeVectorType & | rowsTranspositions () const |
|
MatrixType::RealScalar | absDeterminant () const |
|
MatrixType::RealScalar | logAbsDeterminant () const |
|
Index | rank () const |
|
Index | dimensionOfKernel () const |
|
bool | isInjective () const |
|
bool | isSurjective () const |
|
bool | isInvertible () const |
|
const Inverse< FullPivHouseholderQR > | inverse () const |
|
Index | rows () const |
|
Index | cols () const |
|
const HCoeffsType & | hCoeffs () const |
|
FullPivHouseholderQR & | setThreshold (const RealScalar &threshold) |
| Allows to prescribe a threshold to be used by certain methods, such as rank(), who need to determine when pivots are to be considered nonzero. More...
|
|
FullPivHouseholderQR & | setThreshold (Default_t) |
| Allows to come back to the default behavior, letting Eigen use its default formula for determining the threshold. More...
|
|
RealScalar | threshold () const |
| Returns the threshold that will be used by certain methods such as rank(). More...
|
|
Index | nonzeroPivots () const |
|
RealScalar | maxPivot () const |
|
template<typename RhsType , typename DstType > |
void | _solve_impl (const RhsType &rhs, DstType &dst) const |
|
template<bool Conjugate, typename RhsType , typename DstType > |
void | _solve_impl_transposed (const RhsType &rhs, DstType &dst) const |
|
template<typename InputType > |
FullPivHouseholderQR< MatrixType > & | compute (const EigenBase< InputType > &matrix) |
| Performs the QR factorization of the given matrix matrix. More...
|
|
| SolverBase () |
| Default constructor. More...
|
|
| ~SolverBase () |
|
const Solve< FullPivHouseholderQR< _MatrixType >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
|
ConstTransposeReturnType | transpose () const |
|
AdjointReturnType | adjoint () const |
|
EIGEN_DEVICE_FUNC FullPivHouseholderQR< _MatrixType > & | derived () |
|
EIGEN_DEVICE_FUNC const FullPivHouseholderQR< _MatrixType > & | derived () const |
|
EIGEN_DEVICE_FUNC FullPivHouseholderQR< _MatrixType > & | derived () |
|
EIGEN_DEVICE_FUNC const FullPivHouseholderQR< _MatrixType > & | derived () const |
|
EIGEN_DEVICE_FUNC FullPivHouseholderQR< _MatrixType > & | const_cast_derived () const |
|
EIGEN_DEVICE_FUNC const FullPivHouseholderQR< _MatrixType > & | const_derived () const |
|
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR Index | rows () const EIGEN_NOEXCEPT |
|
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR Index | cols () const EIGEN_NOEXCEPT |
|
EIGEN_DEVICE_FUNC EIGEN_CONSTEXPR Index | size () const EIGEN_NOEXCEPT |
|
EIGEN_DEVICE_FUNC void | evalTo (Dest &dst) const |
|
EIGEN_DEVICE_FUNC void | addTo (Dest &dst) const |
|
EIGEN_DEVICE_FUNC void | subTo (Dest &dst) const |
|
EIGEN_DEVICE_FUNC void | applyThisOnTheRight (Dest &dst) const |
|
EIGEN_DEVICE_FUNC void | applyThisOnTheLeft (Dest &dst) const |
|
template<typename _MatrixType>
class Eigen::FullPivHouseholderQR< _MatrixType >
Householder rank-revealing QR decomposition of a matrix with full pivoting.
- Template Parameters
-
_MatrixType | the type of the matrix of which we are computing the QR decomposition |
This class performs a rank-revealing QR decomposition of a matrix A into matrices P, P', Q and R such that
\[
\mathbf{P} \, \mathbf{A} \, \mathbf{P}' = \mathbf{Q} \, \mathbf{R}
\]
by using Householder transformations. Here, P and P' are permutation matrices, Q a unitary matrix and R an upper triangular matrix.
This decomposition performs a very prudent full pivoting in order to be rank-revealing and achieve optimal numerical stability. The trade-off is that it is slower than HouseholderQR and ColPivHouseholderQR.
This class supports the inplace decomposition mechanism.
- See also
- MatrixBase::fullPivHouseholderQr()
template<typename _MatrixType >
Allows to prescribe a threshold to be used by certain methods, such as rank(), who need to determine when pivots are to be considered nonzero.
This is not used for the QR decomposition itself.
When it needs to get the threshold value, Eigen calls threshold(). By default, this uses a formula to automatically determine a reasonable threshold. Once you have called the present method setThreshold(const RealScalar&), your value is used instead.
- Parameters
-
threshold | The new value to use as the threshold. |
A pivot will be considered nonzero if its absolute value is strictly greater than \( \vert pivot \vert \leqslant threshold \times \vert maxpivot \vert \) where maxpivot is the biggest pivot.
If you want to come back to the default behavior, call setThreshold(Default_t)