NAG Library Routine Document

F08CVF (ZGERQF)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

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

F08CVF (ZGERQF) computes an RQ factorization of a complex

m

n

matrix

A

2 Specification

SUBROUTINE F08CVF (

M, N, A, LDA, TAU, WORK, LWORK, INFO)

INTEGER	M, N, LDA, LWORK, INFO
COMPLEX (KIND=nag_wp)	A(LDA,), TAU(), WORK(max(1,LWORK))

The routine may be called by its LAPACK name zgerqf.

3 Description

F08CVF (ZGERQF) forms the

R Q

factorization of an arbitrary rectangular real

m

n

matrix. If

m \leq n

, the factorization is given by

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

where

R

is an

m

m

lower triangular matrix and

Q

is an

n

n

unitary matrix. If

m > n

the factorization is given by

A = R Q,

where

R

is an

m

n

upper trapezoidal matrix and

Q

is again an

n

n

unitary matrix. In the case where

m < n

the factorization can be expressed as

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

where

Q_{1}

consists of the first

(n - m)

rows of

Q

and

Q_{2}

the remaining

m

rows.

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).

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

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

5 Parameters

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 0$ .
3: $A (LDA *)$ – COMPLEX (KIND=nag_wp) arrayInput/Output: Note: the second dimension of the array A must be at least $\max (1, N)$ .

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

On exit: if $m \leq n$ , the upper triangle of the subarray $A (1 : m, n - m + 1 : n)$ contains the $m$ by $m$ upper triangular matrix $R$ .
If $m \geq n$ , the elements on and above the $(m - n)$ th subdiagonal contain the $m$ by $n$ upper trapezoidal matrix $R$ ; the remaining elements, with the array TAU, represent the unitary matrix $Q$ as a product of $\min (m, n)$ 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 F08CVF (ZGERQF) is called.

Constraint: $LDA \geq \max (1, M)$ .
5: $TAU (*)$ – COMPLEX (KIND=nag_wp) arrayOutput: Note: the dimension of the array TAU must be at least $\max (1, \min (M, N))$ .

On exit: the scalar factors of the elementary reflectors.
6: $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.
7: $LWORK$ – INTEGERInput: On entry: the dimension of the array WORK as declared in the (sub)program from which F08CVF (ZGERQF) 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

F08CVF (ZGERQF) is not threaded by NAG in any implementation.

F08CVF (ZGERQF) 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

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

m \leq n

, or

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

m > n

To form the unitary matrix

Q

F08CVF (ZGERQF) may be followed by a call to F08CWF (ZUNGRQ):

CALL ZUNGRQ(N,N,MIN(M,N),A,LDA,TAU,WORK,LWORK,INFO)

but note that the first dimension of the array A must be at least N, which may be larger than was required by F08CVF (ZGERQF). When

m \leq n

, it is often only the first

m

rows of

Q

that are required and they may be formed by the call:

CALL ZUNGRQ(M,N,M,A,LDA,TAU,WORK,LWORK,INFO)

To apply

Q

to an arbitrary real rectangular matrix

C

, F08CVF (ZGERQF) may be followed by a call to F08CXF (ZUNMRQ). For example:

CALL ZUNMRQ('Left','C',N,P,MIN(M,N),A,LDA,TAU,C,LDC, &
              WORK,LWORK,INFO)

forms

C = Q^{H} C

, where

C

n

p

The real analogue of this routine is F08CHF (DGERQF).

10 Example

This example finds the minimum norm solution to the underdetermined equations

A x = b

where

A = (\begin{array}{r} 0.28 - 0.36 i & 0.50 - 0.86 i & - 0.77 - 0.48 i & 1.58 + 0.66 i \\ - 0.50 - 1.10 i & - 1.21 + 0.76 i & - 0.32 - 0.24 i & - 0.27 - 1.15 i \\ 0.36 - 0.51 i & - 0.07 + 1.33 i & - 0.75 + 0.47 i & - 0.08 + 1.01 i \end{array})

and

b = (\begin{array}{r} - 1.35 + 0.19 i \\ 9.41 - 3.56 i \\ - 7.57 + 6.93 i \end{array}) .

The solution is obtained by first obtaining an

R Q

factorization of the matrix

A

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 DocumentF08CVF (ZGERQF)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

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 Library Routine Document

F08CVF (ZGERQF)