Eigen
3.3.5

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 rankrevealing decomposition. If you want that feature, use FullPivHouseholderQR or ColPivHouseholderQR instead.
This Householder QR decomposition is faster, but less numerically stable and less featurefull than FullPivHouseholderQR or ColPivHouseholderQR.
This class supports the inplace decomposition mechanism.
Public Member Functions  
MatrixType::RealScalar  absDeterminant () const 
const HCoeffsType &  hCoeffs () const 
HouseholderSequenceType  householderQ () const 
HouseholderQR ()  
Default Constructor. More...  
HouseholderQR (Index rows, Index cols)  
Default Constructor with memory preallocation. More...  
template<typename InputType >  
HouseholderQR (const EigenBase< InputType > &matrix)  
Constructs a QR factorization from a given matrix. More...  
template<typename InputType >  
HouseholderQR (EigenBase< InputType > &matrix)  
Constructs a QR factorization from a given matrix. More...  
MatrixType::RealScalar  logAbsDeterminant () const 
const MatrixType &  matrixQR () const 
template<typename Rhs >  
const Solve< HouseholderQR, Rhs >  solve (const MatrixBase< Rhs > &b) const 
Protected Member Functions  
void  computeInPlace () 

inline 
Default Constructor.
The default constructor is useful in cases in which the user intends to perform decompositions via HouseholderQR::compute(const MatrixType&).

inline 
Default Constructor with memory preallocation.
Like the default constructor but with preallocation of the internal data according to the specified problem size.

inlineexplicit 
Constructs a QR factorization from a given matrix.
This constructor computes the QR factorization of the matrix matrix by calling the method compute(). It is a short cut for:

inlineexplicit 
Constructs a QR factorization from a given matrix.
This overloaded constructor is provided for inplace decomposition when MatrixType
is a Eigen::Ref.
MatrixType::RealScalar Eigen::HouseholderQR< MatrixType >::absDeterminant  (  )  const 

protected 
Performs the QR factorization of the given matrix matrix. The result of the factorization is stored into *this
, and a reference to *this
is returned.

inline 
Q
.For advanced uses only.

inline 
This method returns an expression of the unitary matrix Q as a sequence of Householder transformations.
The returned expression can directly be used to perform matrix products. It can also be assigned to a dense Matrix object. Here is an example showing how to recover the full or thin matrix Q, as well as how to perform matrix products using operator*:
Example:
Output:
The complete unitary matrix Q is: 0.676 0.0793 0.713 0.0788 0.147 0.221 0.322 0.37 0.366 0.759 0.353 0.345 0.214 0.841 0.0518 0.582 0.462 0.555 0.176 0.329 0.174 0.747 0.00907 0.348 0.539 The thin matrix Q is: 0.676 0.0793 0.713 0.221 0.322 0.37 0.353 0.345 0.214 0.582 0.462 0.555 0.174 0.747 0.00907
MatrixType::RealScalar Eigen::HouseholderQR< MatrixType >::logAbsDeterminant  (  )  const 

inline 

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 righthandside of the equation to solve. 
This method just tries to find as good a solution as possible. If you want to check whether a solution exists or if it is accurate, just call this function to get a result and then compute the error of this result, or use MatrixBase::isApprox() directly, for instance like this:
This method avoids dividing by zero, so that the nonexistence of a solution doesn't by itself mean that you'll get inf
or nan
values.
If there exists more than one solution, this method will arbitrarily choose one.
Example:
Output:
Here is the matrix m: 0.68 0.597 0.33 0.211 0.823 0.536 0.566 0.605 0.444 Here is the matrix y: 0.108 0.27 0.832 0.0452 0.0268 0.271 0.258 0.904 0.435 Here is a solution x to the equation mx=y: 0.609 2.68 1.67 0.231 1.57 0.0713 0.51 3.51 1.05