F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual

# NAG Library Routine DocumentF08ZFF (DGGRQF)

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

## 1  Purpose

F08ZFF (DGGRQF) computes a generalized $RQ$ factorization of a real matrix pair $\left(A,B\right)$, where $A$ is an $m$ by $n$ matrix and $B$ is a $p$ by $n$ matrix.

## 2  Specification

 SUBROUTINE F08ZFF ( M, P, N, A, LDA, TAUA, B, LDB, TAUB, WORK, LWORK, INFO)
 INTEGER M, P, N, LDA, LDB, LWORK, INFO REAL (KIND=nag_wp) A(LDA,*), TAUA(min(M,N)), B(LDB,*), TAUB(min(P,N)), WORK(max(1,LWORK))
The routine may be called by its LAPACK name dggrqf.

## 3  Description

F08ZFF (DGGRQF) forms the generalized $RQ$ factorization of an $m$ by $n$ matrix $A$ and a $p$ by $n$ matrix $B$
 $A = RQ , B= ZTQ ,$
where $Q$ is an $n$ by $n$ orthogonal matrix, $Z$ is a $p$ by $p$ orthogonal matrix and $R$ and $T$ are of the form
 $R = n-mmm(0R12) ; if ​ m≤n , nm-n(R11) n R21 ; if ​ m>n ,$
with ${R}_{12}$ or ${R}_{21}$ upper triangular,
 $T = nn(T11) p-n 0 ; if ​ p≥n , pn-pp(T11T12) ; if ​ p
with ${T}_{11}$ upper triangular.
In particular, if $B$ is square and nonsingular, the generalized $RQ$ factorization of $A$ and $B$ implicitly gives the $RQ$ factorization of $A{B}^{-1}$ as
 $AB-1= R T-1 ZT .$

## 4  References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug
Anderson E, Bai Z and Dongarra J (1992) Generalized QR factorization and its applications Linear Algebra Appl. (Volume 162–164) 243–271
Hammarling S (1987) The numerical solution of the general Gauss-Markov linear model Mathematics in Signal Processing (eds T S Durrani, J B Abbiss, J E Hudson, R N Madan, J G McWhirter and T A Moore) 441–456 Oxford University Press
Paige C C (1990) Some aspects of generalized $QR$ factorizations . In Reliable Numerical Computation (eds M G Cox and S Hammarling) 73–91 Oxford University Press

## 5  Parameters

1:     M – INTEGERInput
On entry: $m$, the number of rows of the matrix $A$.
Constraint: ${\mathbf{M}}\ge 0$.
2:     P – INTEGERInput
On entry: $p$, the number of rows of the matrix $B$.
Constraint: ${\mathbf{P}}\ge 0$.
3:     N – INTEGERInput
On entry: $n$, the number of columns of the matrices $A$ and $B$.
Constraint: ${\mathbf{N}}\ge 0$.
4:     A(LDA,$*$) – REAL (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array A must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the $m$ by $n$ matrix $A$.
On exit: if $m\le n$, the upper triangle of the subarray ${\mathbf{A}}\left(1:m,n-m+1:n\right)$ contains the $m$ by $m$ upper triangular matrix ${R}_{12}$.
If $m\ge n$, the elements on and above the $\left(m-n\right)$th subdiagonal contain the $m$ by $n$ upper trapezoidal matrix $R$; the remaining elements, with the array TAUA, represent the orthogonal matrix $Q$ as a product of $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(m,n\right)$ elementary reflectors (see Section 3.3.6 in the F08 Chapter Introduction).
5:     LDA – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F08ZFF (DGGRQF) is called.
Constraint: ${\mathbf{LDA}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{M}}\right)$.
6:     TAUA($\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{M}},{\mathbf{N}}\right)$) – REAL (KIND=nag_wp) arrayOutput
On exit: the scalar factors of the elementary reflectors which represent the orthogonal matrix $Q$.
7:     B(LDB,$*$) – REAL (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array B must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}}\right)$.
On entry: the $p$ by $n$ matrix $B$.
On exit: the elements on and above the diagonal of the array contain the $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(p,n\right)$ by $n$ upper trapezoidal matrix $T$ ($T$ is upper triangular if $p\ge n$); the elements below the diagonal, with the array TAUB, represent the orthogonal matrix $Z$ as a product of elementary reflectors (see Section 3.3.6 in the F08 Chapter Introduction).
8:     LDB – INTEGERInput
On entry: the first dimension of the array B as declared in the (sub)program from which F08ZFF (DGGRQF) is called.
Constraint: ${\mathbf{LDB}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{P}}\right)$.
9:     TAUB($\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{P}},{\mathbf{N}}\right)$) – REAL (KIND=nag_wp) arrayOutput
On exit: the scalar factors of the elementary reflectors which represent the orthogonal matrix $Z$.
10:   WORK($\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{LWORK}}\right)$) – REAL (KIND=nag_wp) arrayWorkspace
On exit: if ${\mathbf{INFO}}={\mathbf{0}}$, ${\mathbf{WORK}}\left(1\right)$ contains the minimum value of LWORK required for optimal performance.
11:   LWORK – INTEGERInput
On entry: the dimension of the array WORK as declared in the (sub)program from which F08ZFF (DGGRQF) is called.
If ${\mathbf{LWORK}}=-1$, a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued.
Suggested value: for optimal performance, ${\mathbf{LWORK}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{N}},{\mathbf{M}},{\mathbf{P}}\right)×\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(\mathit{nb1},\mathit{nb2},\mathit{nb3}\right)$, where $\mathit{nb1}$ is the optimal block size for the $RQ$ factorization of an $m$ by $n$ matrix by F08CHF (DGERQF), $\mathit{nb2}$ is the optimal block size for the $QR$ factorization of a $p$ by $n$ matrix by F08AEF (DGEQRF), and $\mathit{nb3}$ is the optimal block size for a call of F08CKF (DORMRQ).
Constraint: ${\mathbf{LWORK}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{N}},{\mathbf{M}},{\mathbf{P}}\right)$ or ${\mathbf{LWORK}}=-1$.
12:   INFO – INTEGEROutput
On exit: ${\mathbf{INFO}}=0$ unless the routine detects an error (see Section 6).

## 6  Error Indicators and Warnings

Errors or warnings detected by the routine:
${\mathbf{INFO}}<0$
If ${\mathbf{INFO}}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.

## 7  Accuracy

The computed generalized $RQ$ factorization is the exact factorization for nearby matrices $\left(A+E\right)$ and $\left(B+F\right)$, where
 $E2 = O⁡ε A2 and F2= O⁡ε B2 ,$
and $\epsilon$ is the machine precision.

## 8  Further Comments

The orthogonal matrices $Q$ and $Z$ may be formed explicitly by calls to F08CJF (DORGRQ) and F08AFF (DORGQR) respectively. F08CKF (DORMRQ) may be used to multiply $Q$ by another matrix and F08AGF (DORMQR) may be used to multiply $Z$ by another matrix.
The complex analogue of this routine is F08ZTF (ZGGRQF).

## 9  Example

This example solves the linear equality constrained least squares problem
 $minx c-Ax2 subject to Bx= d$
where
 $A = -0.57 -1.28 -0.39 0.25 -1.93 1.08 -0.31 -2.14 2.30 0.24 0.40 -0.35 -1.93 0.64 -0.66 0.08 0.15 0.30 0.15 -2.13 -0.02 1.03 -1.43 0.50 , B= 1 0 -1 0 0 1 0 -1 ,$
 $c = -1.50 -2.14 1.23 -0.54 -1.68 0.82 and d= 0 0 .$
The constraints $Bx=d$ correspond to ${x}_{1}={x}_{3}$ and ${x}_{2}={x}_{4}$.
The solution is obtained by first computing a generalized $RQ$ factorization of the matrix pair $\left(B,A\right)$. The example illustrates the general solution process.
Note that the block size (NB) of $64$ assumed in this example is not realistic for such a small problem, but should be suitable for large problems.

### 9.1  Program Text

Program Text (f08zffe.f90)

### 9.2  Program Data

Program Data (f08zffe.d)

### 9.3  Program Results

Program Results (f08zffe.r)