F08CWF (ZUNGRQ) (PDF version)
F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual

NAG Library Routine Document


Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

F08CWF (ZUNGRQ) generates all or part of the complex n by n unitary matrix Q from an RQ factorization computed by F08CVF (ZGERQF).

2  Specification

COMPLEX (KIND=nag_wp)  A(LDA,*), TAU(*), WORK(max(1,LWORK))
The routine may be called by its LAPACK name zungrq.

3  Description

F08CWF (ZUNGRQ) is intended to be used following a call to F08CVF (ZGERQF), which performs an RQ factorization of a complex matrix A and represents the unitary matrix Q as a product of k elementary reflectors of order n.
This routine may be used to generate Q explicitly as a square matrix, or to form only its trailing rows.
Usually Q is determined from the RQ factorization of a p by n matrix A with pn. The whole of Q may be computed by:
(note that the array A must have at least n rows), or its trailing p rows as:
The rows of Q returned by the last call form an orthonormal basis for the space spanned by the rows of A; thus F08CVF (ZGERQF) followed by F08CWF (ZUNGRQ) can be used to orthogonalise the rows of A.
The information returned by F08CVF (ZGERQF) also yields the RQ factorization of the trailing k rows of A, where k<p. The unitary matrix arising from this factorization can be computed by:
or its leading k columns by:

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 Q.
Constraint: M0.
2:     N – INTEGERInput
On entry: n, the number of columns of the matrix Q.
Constraint: NM.
3:     K – INTEGERInput
On entry: k, the number of elementary reflectors whose product defines the matrix Q.
Constraint: MK0.
4:     A(LDA,*) – COMPLEX (KIND=nag_wp) arrayInput/Output
Note: the second dimension of the array A must be at least max1,N.
On entry: details of the vectors which define the elementary reflectors, as returned by F08CVF (ZGERQF).
On exit: the m by n matrix Q.
5:     LDA – INTEGERInput
On entry: the first dimension of the array A as declared in the (sub)program from which F08CWF (ZUNGRQ) is called.
Constraint: LDAmax1,M.
6:     TAU(*) – COMPLEX (KIND=nag_wp) arrayInput
Note: the dimension of the array TAU must be at least max1,K.
On entry: TAUi must contain the scalar factor of the elementary reflector Hi, as returned by F08CVF (ZGERQF).
7:     WORK(max1,LWORK) – COMPLEX (KIND=nag_wp) arrayWorkspace
8:     LWORK – INTEGERInput
On entry: the dimension of the array WORK as declared in the (sub)program from which F08CWF (ZUNGRQ) 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, LWORKN×nb, where nb is the optimal block size.
Constraint: LWORKmax1,M or LWORK=-1.
9:     INFO – INTEGEROutput

6  Error Indicators and Warnings

Errors or warnings detected by the routine:
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 matrix Q differs from an exactly unitary matrix by a matrix E such that
E2 = Oε
and ε is the machine precision.

8  Further Comments

The total number of floating point operations is approximately 16mnk-8m+nk2+163k3; when m=k this becomes 83m23n-m.
The real analogue of this routine is F08CJF (DORGRQ).

9  Example

This example generates the first four rows of the matrix Q of the RQ factorization of A as returned by F08CVF (ZGERQF), where
A = 0.96-0.81i -0.98+1.98i 0.62-0.46i -0.37+0.38i 0.83+0.51i 1.08-0.28i -0.03+0.96i -1.20+0.19i 1.01+0.02i 0.19-0.54i 0.20+0.01i 0.20-0.12i -0.91+2.06i -0.66+0.42i 0.63-0.17i -0.98-0.36i -0.17-0.46i -0.07+1.23i -0.05+0.41i -0.81+0.56i -1.11+0.60i 0.22-0.20i 1.47+1.59i 0.26+0.26i .
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.

9.1  Program Text

Program Text (f08cwfe.f90)

9.2  Program Data

Program Data (f08cwfe.d)

9.3  Program Results

Program Results (f08cwfe.r)

F08CWF (ZUNGRQ) (PDF version)
F08 Chapter Contents
F08 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2011