QR Decomposition without Pivoting¶
Given the matrix \(X\) of size \(n \times p\), the problem is to compute the QR decomposition \(X = QR\), where
\(Q\) is an orthogonal matrix of size \(n \times n\)
\(R\) is a rectangular upper triangular matrix of size \(n \times p\)
The library requires \(n > p\). In this case:
where the matrix \(Q_1\) has the size \(n \times p\) and \(R_1\) has the size \(p \times p\).
The following computation modes are available: