NAG Library Routine Document
F08CHF (DGERQF)
1 Purpose
F08CHF (DGERQF) computes an RQ factorization of a real by matrix .
2 Specification
INTEGER |
M, N, LDA, LWORK, INFO |
REAL (KIND=nag_wp) |
A(LDA,*), TAU(*), WORK(max(1,LWORK)) |
|
The routine may be called by its
LAPACK
name dgerqf.
3 Description
F08CHF (DGERQF) forms the
factorization of an arbitrary rectangular real
by
matrix. If
, the factorization is given by
where
is an
by
lower triangular matrix and
is an
by
orthogonal matrix. If
the factorization is given by
where
is an
by
upper trapezoidal matrix and
is again an
by
orthogonal matrix. In the case where
the factorization can be expressed as
where
consists of the first
rows of
and
the remaining
rows.
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).
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: , the number of rows of the matrix .
Constraint:
.
- 2: N – INTEGERInput
On entry: , the number of columns of the matrix .
Constraint:
.
- 3: A(LDA,) – REAL (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 upper triangle of the subarray
contains the
by
upper triangular matrix
.
If
, the elements on and above the
th subdiagonal contain the
by
upper trapezoidal matrix
; the remaining elements, with the array
TAU, represent the orthogonal matrix
as a product of
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 F08CHF (DGERQF) is called.
Constraint:
.
- 5: TAU() – REAL (KIND=nag_wp) arrayOutput
-
Note: the dimension of the array
TAU
must be at least
.
On exit: the scalar factors of the elementary reflectors.
- 6: WORK() – REAL (KIND=nag_wp) arrayWorkspace
On exit: if
,
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 F08CHF (DGERQF) 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 floating point operations is approximately if , or if .
To form the orthogonal matrix
F08CHF (DGERQF) may be followed by a call to
F08CJF (DORGRQ):
CALL DORGRQ(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 F08CHF (DGERQF). When
, it is often only the first
rows of
that are required and they may be formed by the call:
CALL DORGRQ(M,N,M,A,LDA,TAU,WORK,LWORK,INFO)
To apply
to an arbitrary real rectangular matrix
, F08CHF (DGERQF) may be followed by a call to
F08CKF (DORMRQ). For example:
CALL DORMRQ('Left','Transpose',N,P,MIN(M,N),A,LDA,TAU,C,LDC, &
WORK,LWORK,INFO)
forms
, where
is
by
.
The complex analogue of this routine is
F08CVF (ZGERQF).
9 Example
This example finds the minimum norm solution to the underdetermined equations
where
The solution is obtained by first obtaining an factorization of the matrix .
Note that the block size (NB) of 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 (f08chfe.f90)
9.2 Program Data
Program Data (f08chfe.d)
9.3 Program Results
Program Results (f08chfe.r)