Integer, Intent (In)	::	m, n, lda, lwork
Integer, Intent (Out)	::	info
Complex (Kind=nag_wp), Intent (Inout)	::	a(lda,), tau()
Complex (Kind=nag_wp), Intent (Out)	::	work(max(1,lwork))

C Header Interface

#include <nag.h>

void	f08bvf_ (const Integer m, const Integer n, Complex a[], const Integer lda, Complex tau[], Complex work[], const Integer lwork, Integer *info)

The routine may be called by the names f08bvf, nagf_lapackeig_ztzrzf or its LAPACK name ztzrzf.

3 Description

The

m \times n

(

m \leq n

) complex upper trapezoidal matrix

A

given by

A = (\begin{matrix} R_{1} & R_{2} \end{matrix}),

where

R_{1}

is an

m \times m

upper triangular matrix and

R_{2}

is an

m \times (n - m)

matrix, is factorized as

A = (\begin{matrix} R & 0 \end{matrix}) Z,

where

R

is also an

m \times m

upper triangular matrix and

Z

is an

n \times n

unitary matrix.

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 https://www.netlib.org/lapack/lug

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 m$ .
3: $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 leading $m \times n$ upper trapezoidal part of the array a must contain the matrix to be factorized.

On exit: the leading $m \times m$ upper triangular part of a contains the upper triangular matrix $R$ , and elements $m + 1$ to n of the first $m$ rows of a, with the array tau, represent the unitary matrix $Z$ as a product of $m$ elementary reflectors (see Section 3.3.6 in the F08 Chapter Introduction).
4: $lda$ – Integer Input: On entry: the first dimension of the array a as declared in the (sub)program from which f08bvf is called.

Constraint: $lda \geq \max (1, m)$ .
5: $tau (*)$ – Complex (Kind=nag_wp) array Output: Note: the dimension of the array tau must be at least $\max (1, m)$ .

On exit: the scalar factors of the elementary reflectors.
6: $work (\max (1, lwork))$ – Complex (Kind=nag_wp) array Workspace: On exit: if $info = 0$ , the real part of $work (1)$ contains the minimum value of lwork required for optimal performance.
7: $lwork$ – Integer Input: On entry: the dimension of the array work as declared in the (sub)program from which f08bvf 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 m \times nb$ , where $nb$ is the optimal block size.

Constraint: $lwork \geq \max (1, m)$ or $lwork = −1$ .
8: $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.

f08bvf 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 floating-point operations is approximately

16 m^{2} (n - m)

The real analogue of this routine is f08bhf.

10 Example

This example solves the linear least squares problems

\min_{x} {‖ b_{j} - A x_{j} ‖}_{2}, j = 1, 2

for the minimum norm solutions

x_{1}

and

x_{2}

, where

b_{j}

is the

j

th column of the matrix

B

A = (\begin{array}{r} 0.47 - 0.34 i & - 0.40 + 0.54 i & 0.60 + 0.01 i & 0.80 - 1.02 i \\ - 0.32 - 0.23 i & - 0.05 + 0.20 i & - 0.26 - 0.44 i & - 0.43 + 0.17 i \\ 0.35 - 0.60 i & - 0.52 - 0.34 i & 0.87 - 0.11 i & - 0.34 - 0.09 i \\ 0.89 + 0.71 i & - 0.45 - 0.45 i & - 0.02 - 0.57 i & 1.14 - 0.78 i \\ - 0.19 + 0.06 i & 0.11 - 0.85 i & 1.44 + 0.80 i & 0.07 + 1.14 i \end{array})

and

B = (\begin{array}{r} - 1.08 - 2.59 i & 2.22 + 2.35 i \\ - 2.61 - 1.49 i & 1.62 - 1.48 i \\ 3.13 - 3.61 i & 1.65 + 3.43 i \\ 7.33 - 8.01 i & - 0.98 + 3.08 i \\ 9.12 + 7.63 i & - 2.84 + 2.78 i \end{array}) .

The solution is obtained by first obtaining a

Q R

factorization with column pivoting of the matrix

A

, and then the

R Z

factorization of the leading

k \times k

part of

R

is computed, where

k

is the estimated rank of

A

. A tolerance of

0.01

is used to estimate the rank of

A

from the upper triangular factor,

R

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.

f08bv: FL CL CPP AD PY MB

NAG FL Interfacef08bvf (ztzrzf)

▸▿ 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
f08bvf (ztzrzf)