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

C Header Interface

#include nagmk26.h

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

The routine may be called by its LAPACK name dtzrzf.

3

Description

The

m

n

(

m \leq n

) real upper trapezoidal matrix

A

given by

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

where

R_{1}

is an

m

m

upper triangular matrix and

R_{2}

is an

m

(n - m)

matrix, is factorized as

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

where

R

is also an

m

m

upper triangular matrix and

Z

is an

n

n

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

5

Arguments

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

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

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

On entry: the leading $m$ by $n$ upper trapezoidal part of the array a must contain the matrix to be factorized.

On exit: the leading $m$ by $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 orthogonal matrix $Z$ as a product of $m$ elementary reflectors (see Section 3.3.6 in the F08 Chapter Introduction).
4: $lda$ – IntegerInput: On entry: the first dimension of the array a as declared in the (sub)program from which f08bhf (dtzrzf) is called.

Constraint: $lda \geq \max (1, m)$ .
5: $tau (*)$ – Real (Kind=nag_wp) arrayOutput: 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))$ – Real (Kind=nag_wp) arrayWorkspace: On exit: if $info = 0$ , $work (1)$ contains the minimum value of lwork required for optimal performance.
7: $lwork$ – IntegerInput: On entry: the dimension of the array work as declared in the (sub)program from which f08bhf (dtzrzf) 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$ – 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 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

f08bhf (dtzrzf) 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

4 m^{2} (n - m)

The complex analogue of this routine is f08bvf (ztzrzf).

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.09 & 0.14 & - 0.46 & 0.68 & 1.29 \\ - 1.56 & 0.20 & 0.29 & 1.09 & 0.51 \\ - 1.48 & - 0.43 & 0.89 & - 0.71 & - 0.96 \\ - 1.09 & 0.84 & 0.77 & 2.11 & - 1.27 \\ 0.08 & 0.55 & - 1.13 & 0.14 & 1.74 \\ - 1.59 & - 0.72 & 1.06 & 1.24 & 0.34 \end{array}) and B = (\begin{array}{r} 7.4 & 2.7 \\ 4.2 & - 3.0 \\ - 8.3 & - 9.6 \\ 1.8 & 1.1 \\ 8.6 & 4.0 \\ 2.1 & - 5.7 \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

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.

NAG Library Routine Document

f08bhf (dtzrzf)

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

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