SRC/cgesvj.f(3)

📦
version 3.12.1 · 7 versions
, in arch rolling

💅 SRC/cgesvj.f(3) · Library Functions Manual 💅

okay so this is the manual page for SRC/cgesvj.f, bestie — the CGESVJ routine. it’s giving “complex SVD, but make it Fortran,” and honestly? iconic. no cap.

💖 NAME 💖

SRC/cgesvj.f — the library function page for cgesvj / CGESVJ.

✨ SYNOPSIS ✨

🌸 Functions/Subroutines 🌸

subroutine cgesvj (joba, jobu, jobv, m, n, a, lda, sva, mv, v, ldv,
    cwork, lwork, rwork, lrwork, info)
     CGESVJ

🫶 Function/Subroutine Documentation 🫶

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

🎀 Purpose 🎀

okay so 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. periodt. 💫

🧚 Parameters 🧚

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 a general M-by-N matrix, M >= N.

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 the 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 a 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.

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.

M

M is INTEGER. the number of rows of the input matrix A. 1/SLAMCH('E') > M >= 0.

N

N is INTEGER. the number of columns of the input matrix A. M >= N >= 0.

A

A is a COMPLEX array, dimension (LDA,N).

on entry, the M-by-N matrix A.

on exit:

if JOBU = 'U' .OR. JOBU = 'C':

  • if INFO = 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 = 'C'), see the description of JOBU.
  • if INFO > 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 = 'N':

  • if INFO = 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 > 0: the procedure CGESVJ did not converge in the given number of iterations (sweeps).

LDA

LDA is INTEGER. the leading dimension of the array A. LDA >= max(1,M).

SVA

SVA is a REAL array, dimension (N).

on exit:

if INFO = 0: depending on the value SCALE = RWORK(1), we have:

  • if SCALE = 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 > 0: the procedure CGESVJ did not converge in the given number of iterations (sweeps) and SCALE*SVA(1:N) may not be accurate.

MV

MV is INTEGER. if JOBV = 'A', then the product of Jacobi rotations in CGESVJ is applied to the first MV rows of V. see the description of JOBV.

V

V is a 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.

LDV

LDV is INTEGER. the leading dimension of the array V, LDV >= 1. if JOBV = 'V', then LDV >= max(1,N). if JOBV = 'A', then LDV >= max(1,MV) .

CWORK

CWORK is a COMPLEX array, dimension (max(1,LWORK)). used as workspace.

LWORK

LWORK is INTEGER. length of CWORK. LWORK >= 1, if MIN(M,N) = 0, and LWORK >= M+N, otherwise.

if on entry LWORK = -1, then a workspace query is assumed and no computation is done; CWORK(1) is set to the minial (and optimal) length of CWORK — yes, the source spells it “minial,” and we respect the iconique typo 💀.

RWORK

RWORK is a REAL array, dimension (max(6,LRWORK)).

on entry:

if JOBU = 'C': RWORK(1) = CTOL, where CTOL defines the threshold for convergence. the process stops if all columns of A are mutually orthogonal up to CTOL*EPS, EPS=SLAMCH('E'). it is required that CTOL >= ONE, i.e. it is not allowed to force the routine to obtain orthogonality below EPSILON.

on exit:

  • RWORK(1) = SCALE is the scaling factor such that SCALE*SVA(1:N) are the computed singular values of A. (see description of SVA().)
  • RWORK(2) = NINT(RWORK(2)) is the number of the computed nonzero singular values.
  • RWORK(3) = NINT(RWORK(3)) is the number of the computed singular values that are larger than the underflow threshold.
  • RWORK(4) = NINT(RWORK(4)) is the number of sweeps of Jacobi rotations needed for numerical convergence.
  • RWORK(5) = max_{i.NE.j} |COS(A(:,i),A(:,j))| in the last sweep. this is useful information in cases when CGESVJ did not converge, as it can be used to estimate whether the output is still useful and for post festum analysis.
  • RWORK(6) = the largest absolute value over all sines of the Jacobi rotation angles in the last sweep. it can be useful for a post festum analysis.

LRWORK

okay so, LRWORK is an INTEGER — it’s literally the length of RWORK, bestie. It needs LRWORK >= 1 if MIN(M,N) = 0, and LRWORK >= MAX(6,N) otherwise. And if you pass LRWORK = -1 on entry, that’s a workspace query: no computation is done, and RWORK(1) gets set to the minial (and optimal) length of RWORK — yes, “minial,” that’s the word in the source, we love consistency 💀.

INFO is an INTEGER and it’s giving exit-status realness:

  • = 0: successful exit.
  • < 0: if INFO = -i, then the i-th argument had an illegal value.
  • > 0: CGESVJ did not converge in the maximal allowed (NSWEEP=30) number of sweeps. The output may still be useful — see the description of RWORK.

👑 Author 👑

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

✨ Further Details: ✨

The orthogonal N-by-N matrix V is obtained as a product of Jacobi plane rotations. In the case of underflow of the tangent of the Jacobi angle, a modified Jacobi transformation of Drmac [3] is used. Pivot strategy uses column interchanges of de Rijk [1]. The relative accuracy of the computed singular values and the accuracy of the computed singular vectors (in angle metric) is as guaranteed by the theory of Demmel and Veselic [2].

The condition number that determines the accuracy in the full rank case is essentially min_{D=diag} kappa(A*D), where kappa(.) is the spectral condition number. The best performance of this Jacobi SVD procedure is achieved if used in an accelerated version of Drmac and Veselic [4,5], and it is the kernel routine in the SIGMA library [6]. Some tuning parameters (marked with [TP]) are available for the implementer.

The computational range for the nonzero singular values is the machine number interval ( UNDERFLOW , OVERFLOW ). In extreme cases, even denormalized singular values can be computed with the corresponding gradual loss of accurate digits.

🌟 Contributor: 🌟

============

Zlatko Drmac (Zagreb, Croatia)

📚 References: 📚

  • [1] P. P. M. De Rijk: A one-sided Jacobi algorithm for computing the singular value decomposition on a vector computer. SIAM J. Sci. Stat. Comp., Vol. 10 (1998), pp. 359-371.
  • [2] J. Demmel and K. Veselic: Jacobi method is more accurate than QR.
  • [3] Z. Drmac: Implementation of Jacobi rotations for accurate singular value computation in floating point arithmetic. SIAM J. Sci. Comp., Vol. 18 (1997), pp. 1200-1222.
  • [4] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm I. SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1322-1342. LAPACK Working note 169.
  • [5] Z. Drmac and K. Veselic: New fast and accurate Jacobi SVD algorithm II. SIAM J. Matrix Anal. Appl. Vol. 35, No. 2 (2008), pp. 1343-1362. LAPACK Working note 170.
  • [6] Z. Drmac: SIGMA - mathematical software library for accurate SVD, PSV, QSVD, (H,K)-SVD computations. Department of Mathematics, University of Zagreb, 2008, 2015.

🐛 Bugs, examples and comments: 🐛

===========================

Please report all bugs and send interesting test examples and comments to drmac@math.hr. Thank you.

📍 Definition at line 353 of file cgesvj.f.

🧾 Author

Generated automatically by Doxygen for LAPACK from the source code.

💖 and that’s the whole footer vibe: LAPACK Version 3.12.0, source SRC/cgesvj.f(3) — that’s the page, bestie. mwah 💋

📦 where this page comes from