naginterfaces.library.matop.real_​gen_​rq

naginterfaces.library.matop.real_gen_rq(m, a)

real_gen_rq finds the $RQ$ factorization of the real $m\times n$ ($m\le n$) matrix $A$, so that $A$ is reduced to upper triangular form by means of orthogonal transformations from the right.

For full information please refer to the NAG Library document for f01qj

https://support.nag.com/numeric/nl/nagdoc_30.2/flhtml/f01/f01qjf.html

Parameters

mint

$m$, the number of rows of the matrix $A$.

When $m=0$ then an immediate return is effected.

afloat, array-like, shape $(m,n)$

The leading $m\times n$ part of the array $a$ must contain the matrix to be factorized.

Returns

afloat, ndarray, shape $(m,n)$

The $m\times m$ upper triangular part of $a$ will contain the upper triangular matrix $R$, and the $m\times m$ strictly lower triangular part of $a$ and the $m\times (n-m)$ rectangular part of $a$ to the right of the upper triangular part will contain details of the factorization as described in Notes.

zetafloat, ndarray, shape $\left(m\right)$

$zeta[k-1]$ contains the scalar ${\zeta }_k$ for the $(m-k+1)$th transformation. If $P_k=I$ then $zeta[k-1]=0.0$, otherwise $zeta[k-1]$ contains ${\zeta }_k$ as described in Notes and ${\zeta }_k$ is always in the range $(1.0,\sqrt{2.0})$.

Raises

NagValueError

(errno $-1$)

On entry, $n=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $n\ge m$.

(errno $-1$)

On entry, $m=⟨value⟩$.

Constraint: $m\ge 0$.

Notes

No equivalent traditional C interface for this routine exists in the NAG Library.

The $m\times n$ matrix $A$ is factorized as

$$\begin{array}{c}\begin{array}{cc}A=\left(\begin{array}{cc}R& 0\end{array}\right)P^T& \text{when}m<n\text{,}\\ & \\ A=R{P}^T& \text{when}m=n\text{,}\end{array}\end{array}$$

where $P$ is an $n\times n$ orthogonal matrix and $R$ is an $m\times m$ upper triangular matrix.

$P$ is given as a sequence of Householder transformation matrices

$$P=P_m\dots P_2{P}_1\text{,}$$

the ($m-k+1$)th transformation matrix, $P_k$, being used to introduce zeros into the $k$th row of $A$. $P_k$ has the form

$$P_k=I-u_k{u}_k^T\text{,}$$

where

$$\begin{array}{c}{u}_k=\left(\begin{array}{c}{w}_k\\ {\zeta }_k\\ 0\\ z_k\end{array}\right)\text{,}\end{array}$$

${\zeta }_k$ is a scalar, $w_k$ is an $(k-1)$ element vector and $z_k$ is an $(n-m)$ element vector. $u_k$ is chosen to annihilate the elements in the $k$th row of $A$.

The vector $u_k$ is returned in the $k$th element of $zeta$ and in the $k$th row of $a$, such that ${\zeta }_k$ is in $zeta[k-1]$, the elements of $w_k$ are in $a[k-1,0],\dots ,a[k-1,k-2]$ and the elements of $z_k$ are in $a[k-1,m],\dots ,a[k-1,n-1]$. The elements of $R$ are returned in the upper triangular part of $a$.

References

Golub, G H and Van Loan, C F, 1996, Matrix Computations, (3rd Edition), Johns Hopkins University Press, Baltimore

Wilkinson, J H, 1965, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford