 |
LAPACK
3.8.0
LAPACK: Linear Algebra PACKage
|
|
LAPACK
3.8.0
LAPACK: Linear Algebra PACKage
|
| subroutine cgesvj | ( | character*1 | JOBA, |
| character*1 | JOBU, | ||
| character*1 | JOBV, | ||
| integer | M, | ||
| integer | N, | ||
| complex, dimension( lda, * ) | A, | ||
| integer | LDA, | ||
| real, dimension( n ) | SVA, | ||
| integer | MV, | ||
| complex, dimension( ldv, * ) | V, | ||
| integer | LDV, | ||
| complex, dimension( lwork ) | CWORK, | ||
| integer | LWORK, | ||
| real, dimension( lrwork ) | RWORK, | ||
| integer | LRWORK, | ||
| integer | INFO | ||
| ) |
CGESVJ
Download CGESVJ + dependencies [TGZ] [ZIP] [TXT]
CGESVJ computes the singular value decomposition (SVD) of a complex
M-by-N matrix A, where M >= N. The SVD of A is written as
[++] [xx] [x0] [xx]
A = U * SIGMA * V^*, [++] = [xx] * [ox] * [xx]
[++] [xx]
where SIGMA is an N-by-N diagonal matrix, U is an M-by-N orthonormal
matrix, and V is an N-by-N unitary matrix. The diagonal elements
of SIGMA are the singular values of A. The columns of U and V are the
left and the right singular vectors of A, respectively. | [in] | JOBA | JOBA is CHARACTER*1
Specifies the structure of A.
= 'L': The input matrix A is lower triangular;
= 'U': The input matrix A is upper triangular;
= 'G': The input matrix A is general M-by-N matrix, M >= N. |
| [in] | JOBU | JOBU is CHARACTER*1
Specifies whether to compute the left singular vectors
(columns of U):
= 'U' or 'F': The left singular vectors corresponding to the nonzero
singular values are computed and returned in the leading
columns of A. See more details in the description of A.
The default numerical orthogonality threshold is set to
approximately TOL=CTOL*EPS, CTOL=SQRT(M), EPS=SLAMCH('E').
= 'C': Analogous to JOBU='U', except that user can control the
level of numerical orthogonality of the computed left
singular vectors. TOL can be set to TOL = CTOL*EPS, where
CTOL is given on input in the array WORK.
No CTOL smaller than ONE is allowed. CTOL greater
than 1 / EPS is meaningless. The option 'C'
can be used if M*EPS is satisfactory orthogonality
of the computed left singular vectors, so CTOL=M could
save few sweeps of Jacobi rotations.
See the descriptions of A and WORK(1).
= 'N': The matrix U is not computed. However, see the
description of A. |
| [in] | JOBV | JOBV is CHARACTER*1
Specifies whether to compute the right singular vectors, that
is, the matrix V:
= 'V' or 'J': the matrix V is computed and returned in the array V
= 'A' : the Jacobi rotations are applied to the MV-by-N
array V. In other words, the right singular vector
matrix V is not computed explicitly; instead it is
applied to an MV-by-N matrix initially stored in the
first MV rows of V.
= 'N' : the matrix V is not computed and the array V is not
referenced |
| [in] | M | M is INTEGER
The number of rows of the input matrix A. 1/SLAMCH('E') > M >= 0. |
| [in] | N | N is INTEGER
The number of columns of the input matrix A.
M >= N >= 0. |
| [in,out] | A | A is COMPLEX array, dimension (LDA,N)
On entry, the M-by-N matrix A.
On exit,
If JOBU .EQ. 'U' .OR. JOBU .EQ. 'C':
If INFO .EQ. 0 :
RANKA orthonormal columns of U are returned in the
leading RANKA columns of the array A. Here RANKA <= N
is the number of computed singular values of A that are
above the underflow threshold SLAMCH('S'). The singular
vectors corresponding to underflowed or zero singular
values are not computed. The value of RANKA is returned
in the array RWORK as RANKA=NINT(RWORK(2)). Also see the
descriptions of SVA and RWORK. The computed columns of U
are mutually numerically orthogonal up to approximately
TOL=SQRT(M)*EPS (default); or TOL=CTOL*EPS (JOBU.EQ.'C'),
see the description of JOBU.
If INFO .GT. 0,
the procedure CGESVJ did not converge in the given number
of iterations (sweeps). In that case, the computed
columns of U may not be orthogonal up to TOL. The output
U (stored in A), SIGMA (given by the computed singular
values in SVA(1:N)) and V is still a decomposition of the
input matrix A in the sense that the residual
|| A - SCALE * U * SIGMA * V^* ||_2 / ||A||_2 is small.
If JOBU .EQ. 'N':
If INFO .EQ. 0 :
Note that the left singular vectors are 'for free' in the
one-sided Jacobi SVD algorithm. However, if only the
singular values are needed, the level of numerical
orthogonality of U is not an issue and iterations are
stopped when the columns of the iterated matrix are
numerically orthogonal up to approximately M*EPS. Thus,
on exit, A contains the columns of U scaled with the
corresponding singular values.
If INFO .GT. 0 :
the procedure CGESVJ did not converge in the given number
of iterations (sweeps). |
| [in] | LDA | LDA is INTEGER
The leading dimension of the array A. LDA >= max(1,M). |
| [out] | SVA | SVA is REAL array, dimension (N)
On exit,
If INFO .EQ. 0 :
depending on the value SCALE = RWORK(1), we have:
If SCALE .EQ. ONE:
SVA(1:N) contains the computed singular values of A.
During the computation SVA contains the Euclidean column
norms of the iterated matrices in the array A.
If SCALE .NE. ONE:
The singular values of A are SCALE*SVA(1:N), and this
factored representation is due to the fact that some of the
singular values of A might underflow or overflow.
If INFO .GT. 0 :
the procedure CGESVJ did not converge in the given number of
iterations (sweeps) and SCALE*SVA(1:N) may not be accurate. |
| [in] | MV | MV is INTEGER
If JOBV .EQ. 'A', then the product of Jacobi rotations in CGESVJ
is applied to the first MV rows of V. See the description of JOBV. |
| [in,out] | V | V is COMPLEX array, dimension (LDV,N)
If JOBV = 'V', then V contains on exit the N-by-N matrix of
the right singular vectors;
If JOBV = 'A', then V contains the product of the computed right
singular vector matrix and the initial matrix in
the array V.
If JOBV = 'N', then V is not referenced. |
| [in] | LDV | LDV is INTEGER
The leading dimension of the array V, A', LDV .= 1.
If JOBV = 'V', LDV .GE. N.
If JOBV = 'A', LDV .GE. MV. |
| [in] | EPS | EPS is REAL
EPS = SLAMCH('Epsilon') |