NAG Library Routine Document
F08AVF (ZGELQF)
1 Purpose
F08AVF (ZGELQF) computes the factorization of a complex by matrix.
2 Specification
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 zgelqf.
3 Description
F08AVF (ZGELQF) forms the factorization of an arbitrary rectangular complex by matrix. No pivoting is performed.
If
, the factorization is given by:
where
is an
by
lower triangular matrix (with real diagonal elements) and
is an
by
unitary matrix. It is sometimes more convenient to write the factorization as
which reduces to
where
consists of the first
rows of
, and
the remaining
rows.
If
,
is trapezoidal, and the factorization can be written
where
is lower triangular and
is rectangular.
The
factorization of
is essentially the same as the
factorization of
, since
The matrix
is not formed explicitly but is represented as a product of
elementary reflectors (see the
F08 Chapter Introduction for details). Routines are provided to work with
in this representation (see
Section 8).
Note also that for any
, the information returned in the first
rows of the array
A represents an
factorization of the first
rows of the original matrix
.
4 References
None.
5 Parameters
- 1: M – INTEGERInput
On entry: , the number of rows of the matrix .
Constraint:
.
- 2: N – INTEGERInput
On entry: , the number of columns of the matrix .
Constraint:
.
- 3: A(LDA,) – COMPLEX (KIND=nag_wp) arrayInput/Output
-
Note: the second dimension of the array
A
must be at least
.
On entry: the by matrix .
On exit: if
, the elements above the diagonal are overwritten by details of the unitary matrix
and the lower triangle is overwritten by the corresponding elements of the
by
lower triangular matrix
.
If , the strictly upper triangular part is overwritten by details of the unitary matrix and the remaining elements are overwritten by the corresponding elements of the by lower trapezoidal matrix .
The diagonal elements of are real.
- 4: LDA – INTEGERInput
On entry: the first dimension of the array
A as declared in the (sub)program from which F08AVF (ZGELQF) is called.
Constraint:
.
- 5: TAU() – COMPLEX (KIND=nag_wp) arrayOutput
-
Note: the dimension of the array
TAU
must be at least
.
On exit: further details of the unitary matrix .
- 6: WORK() – COMPLEX (KIND=nag_wp) arrayWorkspace
On exit: if
, the real part of
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 F08AVF (ZGELQF) is called.
If
, 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, , where is the optimal block size.
Constraint:
or .
- 8: INFO – INTEGEROutput
On exit:
unless the routine detects an error (see
Section 6).
6 Error Indicators and Warnings
Errors or warnings detected by the routine:
If , argument 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
, where
and
is the
machine precision.
The total number of real floating point operations is approximately if or if .
To form the unitary matrix
F08AVF (ZGELQF) may be followed by a call to
F08AWF (ZUNGLQ):
CALL ZUNGLQ(N,N,MIN(M,N),A,LDA,TAU,WORK,LWORK,INFO)
but note that the first dimension of the array
A, specified by the parameter
LDA, must be at least
N, which may be larger than was required by F08AVF (ZGELQF).
When
, it is often only the first
rows of
that are required, and they may be formed by the call:
CALL ZUNGLQ(M,N,M,A,LDA,TAU,WORK,LWORK,INFO)
To apply
to an arbitrary complex rectangular matrix
, F08AVF (ZGELQF) may be followed by a call to
F08AXF (ZUNMLQ). For example,
CALL ZUNMLQ('Left','Conjugate Transpose',M,P,MIN(M,N),A,LDA,TAU, &
C,LDC,WORK,LWORK,INFO)
forms the matrix product , where is by .
The real analogue of this routine is
F08AHF (DGELQF).
9 Example
This example finds the minimum norm solutions of the under-determined systems of linear equations
where
and
are the columns of the matrix
,
and
9.1 Program Text
Program Text (f08avfe.f90)
9.2 Program Data
Program Data (f08avfe.d)
9.3 Program Results
Program Results (f08avfe.r)