Integer, Intent (In)	::	n, m, p, lda, ldb, lwork
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,), b(ldb,)
Complex (Kind=nag_wp), Intent (Out)	::	taua(min(n,m)), taub(min(n,p)), work(max(1,lwork))

C Header Interface

#include nagmk26.h

void	f08zsf_ ( const Integer n, const Integer m, const Integer p, Complex a[], const Integer lda, Complex taua[], Complex b[], const Integer ldb, Complex taub[], Complex work[], const Integer lwork, Integer *info)

The routine may be called by its LAPACK name zggqrf.

3

Description

f08zsf (zggqrf) forms the generalized

Q R

factorization of an

n

m

matrix

A

and an

n

p

matrix

B

A = Q R, B = Q T Z,

where

Q

is an

n

n

unitary matrix,

Z

is a

p

p

unitary matrix and

R

and

T

are of the form

R = \{\begin{matrix} \begin{array}{rc} m \\ m & R_{11} \\ n - m & 0 \\ ( & ) \end{array},   if ​ n \geq m; \\ \begin{array}{rc} n & m - n \\ n & R_{11} & R_{12} \\ ( & ) \end{array},   if ​ n < m, \end{matrix}

with

R_{11}

upper triangular,

T = \{\begin{matrix} \begin{array}{rc} p - n & n \\ n & 0 & T_{12} \\ ( & ) \end{array},   if ​ n \leq p, \\ \begin{array}{rc} p \\ n - p & T_{11} \\ p & T_{21} \\ ( & ) \end{array},   if ​ n > p, \end{matrix}

with

T_{12}

T_{21}

upper triangular.

In particular, if

B

is square and nonsingular, the generalized

Q R

factorization of

A

and

B

implicitly gives the

Q R

factorization of

B^{- 1} A

B^{- 1} A = Z^{H} (T^{- 1} R) .

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

Q R

factorizations . In Reliable Numerical Computation (eds M G Cox and S Hammarling) 73–91 Oxford University Press

5

Arguments

1: $n$ – IntegerInput: On entry: $n$ , the number of rows of the matrices $A$ and $B$ .

Constraint: $n \geq 0$ .
2: $m$ – IntegerInput: On entry: $m$ , the number of columns of the matrix $A$ .

Constraint: $m \geq 0$ .
3: $p$ – IntegerInput: On entry: $p$ , the number of columns of the matrix $B$ .

Constraint: $p \geq 0$ .
4: $a (lda *)$ – Complex (Kind=nag_wp) arrayInput/Output: Note: the second dimension of the array a must be at least $\max (1, m)$ .

On entry: the $n$ by $m$ matrix $A$ .

On exit: the elements on and above the diagonal of the array contain the $\min (n, m)$ by $m$ upper trapezoidal matrix $R$ ( $R$ is upper triangular if $n \geq m$ ); the elements below the diagonal, with the array taua, represent the unitary matrix $Q$ as a product of $\min (n, m)$ 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 f08zsf (zggqrf) is called.

Constraint: $lda \geq \max (1, n)$ .
6: $taua (\min (n, m))$ – Complex (Kind=nag_wp) arrayOutput: On exit: the scalar factors of the elementary reflectors which represent the unitary matrix $Q$ .
7: $b (ldb *)$ – Complex (Kind=nag_wp) arrayInput/Output: Note: the second dimension of the array b must be at least $\max (1, p)$ .

On entry: the $n$ by $p$ matrix $B$ .

On exit: if $n \leq p$ , the upper triangle of the subarray $b (1 : n, p - n + 1 : p)$ contains the $n$ by $n$ upper triangular matrix $T_{12}$ .
If $n > p$ , the elements on and above the $(n - p)$ th subdiagonal contain the $n$ by $p$ upper trapezoidal matrix $T$ ; the remaining elements, with the array taub, represent the unitary 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 f08zsf (zggqrf) is called.

Constraint: $ldb \geq \max (1, n)$ .
9: $taub (\min (n, p))$ – Complex (Kind=nag_wp) arrayOutput: On exit: the scalar factors of the elementary reflectors which represent the unitary matrix $Z$ .
10: $work (\max (1, lwork))$ – Complex (Kind=nag_wp) arrayWorkspace: On exit: if $info = 0$ , the real part of $work (1)$ 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 f08zsf (zggqrf) is called.
If $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, $lwork \geq \max (n, m, p) \times \max (nb1, nb2, nb3)$ , where $nb1$ is the optimal block size for the $Q R$ factorization of an $n$ by $m$ matrix, $nb2$ is the optimal block size for the $R Q$ factorization of an $n$ by $p$ matrix, and $nb3$ is the optimal block size for a call of f08auf (zunmqr).

Constraint: $lwork \geq \max (1, n, m, p)$ or $lwork = - 1$ .
12: $info$ – IntegerOutput: On exit: $info = 0$ unless the routine detects an error (see Section 6).

6

Error Indicators and Warnings

$info < 0$: If $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

Q R

factorization is the exact factorization for nearby matrices

(A + E)

and

(B + F)

, where

{‖E‖}_{2} = O ε {‖A‖}_{2} and {‖F‖}_{2} = O ε {‖B‖}_{2},

and

ε

is the machine precision.

8

Parallelism and Performance

f08zsf (zggqrf) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

f08zsf (zggqrf) makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

The unitary matrices

Q

and

Z

may be formed explicitly by calls to f08atf (zungqr) and f08cwf (zungrq) respectively. f08auf (zunmqr) may be used to multiply

Q

by another matrix and f08cxf (zunmrq) may be used to multiply

Z

by another matrix.

The real analogue of this routine is f08zef (dggqrf).

10

Example

This example solves the general Gauss–Markov linear model problem

\min_{x} {‖y‖}_{2} subject to d = A x + B y

where

A = (\begin{array}{r} 0.96 - 0.81 i & - 0.03 + 0.96 i & - 0.91 + 2.06 i \\ - 0.98 + 1.98 i & - 1.20 + 0.19 i & - 0.66 + 0.42 i \\ 0.62 - 0.46 i & 1.01 + 0.02 i & 0.63 - 0.17 i \\ 1.08 - 0.28 i & 0.20 - 0.12 i & - 0.07 + 1.23 i \end{array}),

B = (\begin{array}{r} 0.5 - 1.0 i & 0 & 0 & 0 \\ 0 & 1.0 - 2.0 i & 0 & 0 \\ 0 & 0 & 2.0 - 3.0 i & 0 \\ 0 & 0 & 0 & 5.0 - 4.0 i \end{array})

and

d = (\begin{array}{r} 6.00 - 0.40 i \\ - 5.27 + 0.90 i \\ 2.72 - 2.13 i \\ - 1.30 - 2.80 i \end{array}) .

The solution is obtained by first computing a generalized

Q R

factorization of the matrix pair

(A, B)

. The example illustrates the general solution process, although the above data corresponds to a simple weighted least squares problem.

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.

NAG Library Routine Document

f08zsf (zggqrf)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification