Integer, Intent (In)	::	m, n, nb, lda, ldt
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,), t(ldt,)
Complex (Kind=nag_wp), Intent (Out)	::	work(nb*n)

C Header Interface

#include <nag.h>

void	f08apf_ (const Integer m, const Integer n, const Integer nb, Complex a[], const Integer lda, Complex t[], const Integer ldt, Complex work[], Integer info)

The routine may be called by the names f08apf, nagf_lapackeig_zgeqrt or its LAPACK name zgeqrt.

3 Description

f08apf forms the

Q R

factorization of an arbitrary rectangular complex

m \times n

matrix. No pivoting is performed.

It differs from f08asf in that it: requires an explicit block size; stores reflector factors that are upper triangular matrices of the chosen block size (rather than scalars); and recursively computes the

Q R

factorization based on the algorithm of Elmroth and Gustavson (2000).

m \geq n

, the factorization is given by:

A = Q (\begin{array}{r} R \\ 0 \end{array}),

where

R

is an

n \times n

upper triangular matrix (with real diagonal elements) and

Q

is an

m \times m

unitary matrix. It is sometimes more convenient to write the factorization as

A = (\begin{array}{r} Q_{1} & Q_{2} \end{array}) (\begin{array}{r} R \\ 0 \end{array}),

which reduces to

A = Q_{1} R,

where

Q_{1}

consists of the first

n

columns of

Q

, and

Q_{2}

the remaining

m - n

columns.

m < n

R

is upper trapezoidal, and the factorization can be written

A = Q (\begin{array}{r} R_{1} & R_{2} \end{array}),

where

R_{1}

is upper triangular and

R_{2}

is rectangular.

The matrix

Q

is not formed explicitly but is represented as a product of

\min (m, n)

elementary reflectors (see the F08 Chapter Introduction for details). Routines are provided to work with

Q

in this representation (see Section 9).

Note also that for any

k < n

, the information returned represents a

Q R

factorization of the first

k

columns of the original matrix

A

4 References

Elmroth E and Gustavson F (2000) Applying Recursion to Serial and Parallel

Q R

Factorization Leads to Better Performance IBM Journal of Research and Development. (Volume 44) 4 605–624

Golub G H and Van Loan C F (2012) Matrix Computations (4th Edition) Johns Hopkins University Press, Baltimore

5 Arguments

1: $m$ – Integer Input: On entry: $m$ , the number of rows of the matrix $A$ .

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

Constraint: $n \geq 0$ .
3: $nb$ – Integer Input: On entry: the explicitly chosen block size to be used in computing the $Q R$ factorization. See Section 9 for details.

Constraint: if $\min (m, n) > 0$ , $1 \leq nb \leq \min (m, n)$ .
4: $a (lda, *)$ – Complex (Kind=nag_wp) array Input/Output: Note: the second dimension of the array a must be at least $\max (1, n)$ .

On entry: the $m \times n$ matrix $A$ .

On exit: if $m \geq n$ , the elements below the diagonal are overwritten by details of the unitary matrix $Q$ and the upper triangle is overwritten by the corresponding elements of the $n \times n$ upper triangular matrix $R$ .
If $m < n$ , the strictly lower triangular part is overwritten by details of the unitary matrix $Q$ and the remaining elements are overwritten by the corresponding elements of the $m \times n$ upper trapezoidal matrix $R$ .

The diagonal elements of $R$ are real.
5: $lda$ – Integer Input: On entry: the first dimension of the array a as declared in the (sub)program from which f08apf is called.

Constraint: $lda \geq \max (1, m)$ .
6: $t (ldt, *)$ – Complex (Kind=nag_wp) array Output: Note: the second dimension of the array t must be at least $\max (1, \min (m, n))$ .

On exit: further details of the unitary matrix $Q$ . The number of blocks is $b = ⌈ \frac{k}{nb} ⌉$ , where $k = \min (m, n)$ and each block is of order nb except for the last block, which is of order $k - (b - 1) \times nb$ . For each of the blocks, an upper triangular block reflector factor is computed: $T_{1}, T_{2}, \dots, T_{b}$ . These are stored in the $nb \times n$ matrix $T$ as $T = [T_{1} | T_{2} | \dots | T_{b}]$ .
7: $ldt$ – Integer Input: On entry: the first dimension of the array t as declared in the (sub)program from which f08apf is called.

Constraint: $ldt \geq nb$ .
8: $work (nb \times n)$ – Complex (Kind=nag_wp) array Workspace
9: $info$ – Integer Output: 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 factorization is the exact factorization of a nearby matrix

(A + E)

, where

{‖ E ‖}_{2} = O (ε) {‖ A ‖}_{2},

and

ε

is the machine precision.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

f08apf 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 total number of real floating-point operations is approximately

\frac{8}{3} n^{2} (3 m - n)

m \geq n

\frac{8}{3} m^{2} (3 n - m)

m < n

To apply

Q

to an arbitrary

m \times p

complex rectangular matrix

C

, f08apf may be followed by a call to f08aqf . For example,

Call zgemqrt('Left','Conjugate Transpose',m,p,min(m,n),nb,a,lda, &
              t,ldt,c,ldc,work,info)

forms the matrix product

C = Q^{H} C

To form the unitary matrix

Q

explicitly, simply initialize the

m \times m

matrix

C

to the identity matrix and form

C = Q C

using f08aqf as above.

The block size, nb, used by f08apf is supplied explicitly through the interface. For moderate and large sizes of matrix, the block size can have a marked effect on the efficiency of the algorithm with the optimal value being dependent on problem size and platform. A value of

nb = 64 ≪ \min (m, n)

is likely to achieve good efficiency and it is unlikely that an optimal value would exceed

340

To compute a

Q R

factorization with column pivoting, use f08bpf or f08btf.

The real analogue of this routine is f08abf.

10 Example

This example solves the linear least squares problems

minimize {‖ A x_{i} - b_{i} ‖}_{2}, i = 1, 2

where

b_{1}

and

b_{2}

are the columns of the matrix

B

A = (\begin{array}{r} 0.96 - 0.81 i & - 0.03 + 0.96 i & - 0.91 + 2.06 i & - 0.05 + 0.41 i \\ - 0.98 + 1.98 i & - 1.20 + 0.19 i & - 0.66 + 0.42 i & - 0.81 + 0.56 i \\ 0.62 - 0.46 i & 1.01 + 0.02 i & 0.63 - 0.17 i & - 1.11 + 0.60 i \\ - 0.37 + 0.38 i & 0.19 - 0.54 i & - 0.98 - 0.36 i & 0.22 - 0.20 i \\ 0.83 + 0.51 i & 0.20 + 0.01 i & - 0.17 - 0.46 i & 1.47 + 1.59 i \\ 1.08 - 0.28 i & 0.20 - 0.12 i & - 0.07 + 1.23 i & 0.26 + 0.26 i \end{array})

and

B = (\begin{array}{r} - 2.09 + 1.93 i & 3.26 - 2.70 i \\ 3.34 - 3.53 i & - 6.22 + 1.16 i \\ - 4.94 - 2.04 i & 7.94 - 3.13 i \\ 0.17 + 4.23 i & 1.04 - 4.26 i \\ - 5.19 + 3.63 i & - 2.31 - 2.12 i \\ 0.98 + 2.53 i & - 1.39 - 4.05 i \end{array}) .

f08ap: FL CL CPP AD PY MB

NAG FL Interfacef08apf (zgeqrt)

▸▿ 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

NAG FL Interface
f08apf (zgeqrt)