SRC/cgesvd.f(3)
π
SRC/cgesvd.f(3) β Library Functions Manual β¨
okay bestie, welcome to the SRC/cgesvd.f(3) page from the Library Functions Manual. this is the CGESVD page, and it's giving major linear-algebra main character energy. π«Ά
β¨ NAME β¨
SRC/cgesvd.f β the CGESVD routine page, living in the Library Functions Manual. π
πΈ SYNOPSIS πΈ
Functions/Subroutines
subroutine cgesvd (jobu, jobvt, m, n, a, lda, s, u, ldu, vt, ldvt, work,
lwork, rwork, info)
CGESVD computes the singular value decomposition (SVD) for GE matrices. slay. π
π¦ Function/Subroutine Documentation π¦
subroutine cgesvd (character jobu, character jobvt, integer m, integer n,
complex, dimension( lda, * ) a, integer lda, real, dimension( * ) s,
complex, dimension( ldu, * ) u, integer ldu, complex, dimension( ldvt, *
) vt, integer ldvt, complex, dimension( * ) work, integer lwork, real,
dimension( * ) rwork, integer info)
CGESVD computes the singular value decomposition (SVD) for GE matrices. iconic behavior, no cap. π
Purpose
CGESVD computes the singular value decomposition (SVD) of a complex M-by-N matrix A, optionally computing the left and/or right singular vectors. The SVD is written
A = U * SIGMA * conjugate-transpose(V)
where SIGMA is an M-by-N matrix which is zero except for its min(m,n) diagonal elements, U is an M-by-M unitary matrix, and V is an N-by-N unitary matrix. The diagonal elements of SIGMA are the singular values of A; they are real and non-negative, and are returned in descending order. The first min(m,n) columns of U and V are the left and right singular vectors of A.
note bestie: the routine returnsV**H, notV. do not forget the H. π
Parameters
JOBUβCHARACTER*1. Specifies options for computing all or part of the matrix U:= 'A': all M columns of U are returned in array U.= 'S': the first min(m,n) columns of U (the left singular vectors) are returned in the array U.= 'O': the first min(m,n) columns of U (the left singular vectors) are overwritten on the array A.= 'N': no columns of U (no left singular vectors) are computed.
JOBVTβCHARACTER*1. Specifies options for computing all or part of the matrixV**H:= 'A': all N rows ofV**Hare returned in the array VT.= 'S': the first min(m,n) rows ofV**H(the right singular vectors) are returned in the array VT.= 'O': the first min(m,n) rows ofV**H(the right singular vectors) are overwritten on the array A.= 'N': no rows ofV**H(no right singular vectors) are computed.
π¨JOBVTandJOBUcannot both be'O'. that combo is a no. π
MβINTEGER. The number of rows of the input matrix A.M >= 0.NβINTEGER. The number of columns of the input matrix A.N >= 0.AβCOMPLEX array, dimension (LDA,N). On entry, the M-by-N matrix A. On exit:- if
JOBU = 'O', A is overwritten with the first min(m,n) columns of U (the left singular vectors, stored columnwise); - if
JOBVT = 'O', A is overwritten with the first min(m,n) rows ofV**H(the right singular vectors, stored rowwise); - if
JOBU .ne. 'O'andJOBVT .ne. 'O', the contents of A are destroyed.
- if
LDAβINTEGER. The leading dimension of the array A.LDA >= max(1,M).SβREAL array, dimension (min(M,N)). The singular values of A, sorted so thatS(i) >= S(i+1).UβCOMPLEX array, dimension (LDU,UCOL)β(LDU,M)ifJOBU = 'A'or(LDU,min(M,N))ifJOBU = 'S'. IfJOBU = 'A', U contains the M-by-M unitary matrix U; ifJOBU = 'S', U contains the first min(m,n) columns of U (the left singular vectors, stored columnwise); ifJOBU = 'N'or'O', U is not referenced.LDUβINTEGER. The leading dimension of the array U.LDU >= 1; ifJOBU = 'S'or'A',LDU >= M.VTβCOMPLEX array, dimension (LDVT,N). IfJOBVT = 'A', VT contains the N-by-N unitary matrixV**H; ifJOBVT = 'S', VT contains the first min(m,n) rows ofV**H(the right singular vectors, stored rowwise); ifJOBVT = 'N'or'O', VT is not referenced.LDVTβINTEGER. The leading dimension of the array VT.LDVT >= 1; ifJOBVT = 'A',LDVT >= N; ifJOBVT = 'S',LDVT >= min(M,N).WORKβCOMPLEX array, dimension (MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβINTEGER. The dimension of the array WORK.LWORK >= MAX(1,2*MIN(M,N)+MAX(M,N)). For good performance, LWORK should generally be larger.
If LWORK = -1, then 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 by XERBLA. iykyk. π₯
RWORKβREAL array, dimension (5*min(M,N)). On exit, ifINFO > 0,RWORK(1:MIN(M,N)-1)contains the unconverged superdiagonal elements of an upper bidiagonal matrix B whose diagonal is in S (not necessarily sorted). B satisfiesA = U * B * VT, so it has the same singular values as A, and singular vectors related by U and VT.INFOβINTEGER:= 0: successful exit.< 0: ifINFO = -i, the i-th argument had an illegal value.> 0: ifCBDSQRdid not converge, INFO specifies how many superdiagonals of an intermediate bidiagonal form B did not converge to zero. See the description of RWORK above for details.
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 212 of file cgesvd.f.
Author
Generated automatically by Doxygen for LAPACK from the source code.
that's the whole page, bestie β go get that SVD. π LAPACK Version 3.12.0 Β· SRC/cgesvd.f(3) π periodt.
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms