Performs QR decomposition. More...
|template<int R, int C, class P , class B >|
|QR_Lapack (const Matrix< R, C, P, B > &m, bool p=0)|
const Matrix< Rows, Cols, |
Precision, ColMajor > &
const Matrix< square_Size, |
ColMajor > &
|const Vector< Cols, int > &||get_P ()|
Performs QR decomposition.
The QR decomposition operates on a matrix A. It can be performed with or without column pivoting. In general:
Where is a permutation matrix constructed to permute the columns of A. In practise, is stored as a vector of integer elements.
With column pivoting, the elements of the leading diagonal of will be sorted from largest in magnitude to smallest in magnitude.
Construct the QR decomposition of a matrix.
This initialises the class, and performs the decomposition immediately.
|m||The matrix to decompose|
|p||Whether or not to perform pivoting|
|const Vector<Cols, int>& get_P||(||)|
Return the permutation vector.
The definition is that column of A is column of .