NAG Library Routine Document
F08KPF (ZGESVD)
1 Purpose
F08KPF (ZGESVD) computes the singular value decomposition (SVD) of a complex by matrix , optionally computing the left and/or right singular vectors.
2 Specification
SUBROUTINE F08KPF ( |
JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, WORK, LWORK, RWORK, INFO) |
INTEGER |
M, N, LDA, LDU, LDVT, LWORK, INFO |
REAL (KIND=nag_wp) |
S(*), RWORK(*) |
COMPLEX (KIND=nag_wp) |
A(LDA,*), U(LDU,*), VT(LDVT,*), WORK(max(1,LWORK)) |
CHARACTER(1) |
JOBU, JOBVT |
|
The routine may be called by its
LAPACK
name zgesvd.
3 Description
The SVD is written as
where
is an
by
matrix which is zero except for its
diagonal elements,
is an
by
unitary matrix, and
is an
by
unitary matrix. The diagonal elements of
are the singular values of
; they are real and non-negative, and are returned in descending order. The first
columns of
and
are the left and right singular vectors of
.
Note that the routine returns , not .
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: JOBU – CHARACTER(1)Input
On entry: specifies options for computing all or part of the matrix
.
- All columns of are returned in array U.
- The first columns of (the left singular vectors) are returned in the array U.
- The first columns of (the left singular vectors) are overwritten on the array A.
- No columns of (no left singular vectors) are computed.
Constraint:
, , or .
- 2: JOBVT – CHARACTER(1)Input
On entry: specifies options for computing all or part of the matrix
.
- All rows of are returned in the array VT.
- The first rows of (the right singular vectors) are returned in the array VT.
- The first rows of (the right singular vectors) are overwritten on the array A.
- No rows of (no right singular vectors) are computed.
Constraints:
- , , or ;
- JOBVT and JOBU cannot both be .
- 3: M – INTEGERInput
On entry: , the number of rows of the matrix .
Constraint:
.
- 4: N – INTEGERInput
On entry: , the number of columns of the matrix .
Constraint:
.
- 5: 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
,
A is overwritten with the first
columns of
(the left singular vectors, stored column-wise).
If
,
A is overwritten with the first
rows of
(the right singular vectors, stored row-wise).
If
and
, the contents of
A are destroyed.
- 6: LDA – INTEGERInput
On entry: the first dimension of the array
A as declared in the (sub)program from which F08KPF (ZGESVD) is called.
Constraint:
.
- 7: S() – REAL (KIND=nag_wp) arrayOutput
-
Note: the dimension of the array
S
must be at least
.
On exit: the singular values of , sorted so that .
- 8: U(LDU,) – COMPLEX (KIND=nag_wp) arrayOutput
-
Note: the second dimension of the array
U
must be at least
if
,
if
, and at least
otherwise.
On exit: if
,
U contains the
by
unitary matrix
.
If
,
U contains the first
columns of
(the left singular vectors, stored column-wise).
If
or
,
U is not referenced.
- 9: LDU – INTEGERInput
On entry: the first dimension of the array
U as declared in the (sub)program from which F08KPF (ZGESVD) is called.
Constraints:
- if or , ;
- otherwise .
- 10: VT(LDVT,) – COMPLEX (KIND=nag_wp) arrayOutput
-
Note: the second dimension of the array
VT
must be at least
if
or
, and at least
otherwise.
On exit: if
,
VT contains the
by
unitary matrix
.
If
,
VT contains the first
rows of
(the right singular vectors, stored row-wise).
If
or
,
VT is not referenced.
- 11: LDVT – INTEGERInput
On entry: the first dimension of the array
VT as declared in the (sub)program from which F08KPF (ZGESVD) is called.
Constraints:
- if , ;
- if , ;
- otherwise .
- 12: WORK() – COMPLEX (KIND=nag_wp) arrayWorkspace
On exit: if
, the real part of
contains the minimum value of
LWORK required for optimal performance.
- 13: LWORK – INTEGERInput
On entry: the dimension of the array
WORK as declared in the (sub)program from which F08KPF (ZGESVD) 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,
LWORK should generally be larger. Consider increasing
LWORK by at least
, where
is the optimal
block size.
Constraint:
.
- 14: RWORK() – REAL (KIND=nag_wp) arrayWorkspace
-
Note: the dimension of the array
RWORK
must be at least
.
On exit: if , contains the unconverged superdiagonal elements of an upper bidiagonal matrix whose diagonal is in (not necessarily sorted). satisfies , so it has the same singular values as , and singular vectors related by and .
- 15: 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.
If F08KPF (ZGESVD) did not converge,
INFO specifies how many superdiagonals of an intermediate bidiagonal form did not converge to zero. See the description of
RWORK
above for details.
7 Accuracy
The computed singular value decomposition is nearly the exact singular value decomposition for a nearby matrix
, where
and
is the
machine precision. In addition, the computed singular vectors are nearly orthogonal to working precision. See Section 4.9 of
Anderson et al. (1999) for further details.
The total number of floating point operations is approximately proportional to when and otherwise.
The singular values are returned in descending order.
The real analogue of this routine is
F08KBF (DGESVD).
9 Example
This example finds the singular values and left and right singular vectors of the
by
matrix
together with approximate error bounds for the computed singular values and vectors.
The example program for
F08KRF (ZGESDD) illustrates finding a singular value decomposition for the case
.
9.1 Program Text
Program Text (f08kpfe.f90)
9.2 Program Data
Program Data (f08kpfe.d)
9.3 Program Results
Program Results (f08kpfe.r)