f08awf generates all or part of the complex unitary matrix
$Q$ from an
$LQ$ factorization computed by
f08avf.
f08awf is intended to be used after a call to
f08avf, which performs an
$LQ$ factorization of a complex matrix
$A$. The unitary matrix
$Q$ is represented as a product of elementary reflectors.
Usually
$Q$ is determined from the
$LQ$ factorization of a
$p$ by
$n$ matrix
$A$ with
$p\le n$. The whole of
$Q$ may be computed by
:
Call zunglq(n,n,p,a,lda,tau,work,lwork,info)
(note that the array
a must have at least
$n$ rows)
or its leading
$p$ rows by
:
Call zunglq(p,n,p,a,lda,tau,work,lwork,info)
The rows of
$Q$ returned by the last call form an orthonormal basis for the space spanned by the rows of
$A$; thus
f08avf followed by
f08awf can be used to orthogonalize the rows of
$A$.
The information returned by the
$LQ$ factorization routines also yields the
$LQ$ factorization of the leading
$k$ rows of
$A$, where
$k<p$. The unitary matrix arising from this factorization can be computed by
:
Call zunglq(n,n,k,a,lda,tau,work,lwork,info)
or its leading
$k$ rows by
:
Call zunglq(k,n,k,a,lda,tau,work,lwork,info)

1:
$\mathbf{m}$ – Integer
Input

On entry: $m$, the number of rows of the matrix $Q$.
Constraint:
${\mathbf{m}}\ge 0$.

2:
$\mathbf{n}$ – Integer
Input

On entry: $n$, the number of columns of the matrix $Q$.
Constraint:
${\mathbf{n}}\ge {\mathbf{m}}$.

3:
$\mathbf{k}$ – Integer
Input

On entry: $k$, the number of elementary reflectors whose product defines the matrix $Q$.
Constraint:
${\mathbf{m}}\ge {\mathbf{k}}\ge 0$.

4:
$\mathbf{a}\left({\mathbf{lda}},*\right)$ – Complex (Kind=nag_wp) array
Input/Output

Note: the second dimension of the array
a
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
On entry: details of the vectors which define the elementary reflectors, as returned by
f08avf.
On exit: the $m$ by $n$ matrix $Q$.

5:
$\mathbf{lda}$ – Integer
Input

On entry: the first dimension of the array
a as declared in the (sub)program from which
f08awf is called.
Constraint:
${\mathbf{lda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{m}}\right)$.

6:
$\mathbf{tau}\left(*\right)$ – Complex (Kind=nag_wp) array
Input

Note: the dimension of the array
tau
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{k}}\right)$.
On entry: further details of the elementary reflectors, as returned by
f08avf.

7:
$\mathbf{work}\left(\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{lwork}}\right)\right)$ – Complex (Kind=nag_wp) array
Workspace

On exit: if
${\mathbf{info}}={\mathbf{0}}$, the real part of
${\mathbf{work}}\left(1\right)$ contains the minimum value of
lwork required for optimal performance.

8:
$\mathbf{lwork}$ – Integer
Input

On entry: the dimension of the array
work as declared in the (sub)program from which
f08awf is called.
If
${\mathbf{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, ${\mathbf{lwork}}\ge {\mathbf{m}}\times \mathit{nb}$, where $\mathit{nb}$ is the optimal block size.
Constraint:
${\mathbf{lwork}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{m}}\right)$ or ${\mathbf{lwork}}=1$.

9:
$\mathbf{info}$ – Integer
Output

On exit:
${\mathbf{info}}=0$ unless the routine detects an error (see
Section 6).
The computed matrix
$Q$ differs from an exactly unitary matrix by a matrix
$E$ such that
where
$\epsilon $ is the
machine precision.
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 implementationspecific information.
The real analogue of this routine is
f08ajf.
This example forms the leading
$4$ rows of the unitary matrix
$Q$ from the
$LQ$ factorization of the matrix
$A$, where
The rows of
$Q$ form an orthonormal basis for the space spanned by the rows of
$A$.