DBDSQR(3)
π DBDSQR(3) β Library Functions Manual π
okay bestie, welcome to the DBDSQR page from the Library Functions Manual. This is LAPACK's real N-by-N bidiagonal SVD girlie, and she has receipts. β¨
π NAME π
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dbdsqr.f
That's the file path, verbatim, no cap. π«Ά
β¨ SYNOPSIS β¨
π« Functions/Subroutines π«
subroutine DBDSQR (uplo, n, ncvt, nru, ncc, d, e, vt, ldvt, u, ldu, c,
ldc, work, info)
DBDSQR
π¦ Function/Subroutine Documentation π¦
subroutine DBDSQR (character uplo, integer n, integer ncvt, integer nru,
integer ncc, double precision, dimension( * ) d, double precision,
dimension( * ) e, double precision, dimension( ldvt, * ) vt, integer
ldvt, double precision, dimension( ldu, * ) u, integer ldu, double
precision, dimension( ldc, * ) c, integer ldc, double precision,
dimension( * ) work, integer info)
DBDSQR
πΈ Purpose πΈ
Okay so DBDSQR computes the singular values and, optionally, the right and/or left singular vectors from the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B using the implicit zero-shift QR algorithm. The SVD of B has the form
B = Q * S * P**T
where S is the diagonal matrix of singular values, Q is an orthogonal matrix of left singular vectors, and P is an orthogonal matrix of right singular vectors. If left singular vectors are requested, this subroutine actually returns U*Q instead of Q, and, if right singular vectors are requested, this subroutine returns P**T*VT instead of P**T, for given real input matrices U and VT. When U and VT are the orthogonal matrices that reduce a general matrix A to bidiagonal form: A = U*B*VT, as computed by DGEBRD, then
A = (U*Q) * S * (P**T*VT)
is the SVD of A. Optionally, the subroutine may also compute Q**T*C for a given real input matrix C.
See by J. Demmel and W. Kahan, LAPACK Working Note #3 (or SIAM J. Sci. Statist. Comput. vol. 11, no. 5, pp. 873-912, Sept 1990) and by B. Parlett and V. Fernando, Technical Report CPAM-554, Mathematics Department, University of California at Berkeley, July 1992 for a detailed description of the algorithm.
π Parameters π
UPLOβUPLO is CHARACTER*1.= 'U':B is upper bidiagonal;= 'L':B is lower bidiagonal. Pick your bidiagonal flavor πNβN is INTEGER. The order of the matrix B.N >= 0.NCVTβNCVT is INTEGER. The number of columns of the matrix VT.NCVT >= 0.NRUβNRU is INTEGER. The number of rows of the matrix U.NRU >= 0.NCCβNCC is INTEGER. The number of columns of the matrix C.NCC >= 0.DβD is DOUBLE PRECISION array, dimension (N). On entry, the n diagonal elements of the bidiagonal matrix B. On exit, ifINFO=0, the singular values of B in decreasing order.EβE is DOUBLE PRECISION array, dimension (N-1). On entry, the N-1 offdiagonal elements of the bidiagonal matrix B. On exit, ifINFO = 0, E is destroyed; ifINFO > 0, D and E will contain the diagonal and superdiagonal elements of a bidiagonal matrix orthogonally equivalent to the one given as input.VTβVT is DOUBLE PRECISION array, dimension (LDVT, NCVT). On entry, an N-by-NCVT matrix VT. On exit, VT is overwritten byP**T * VT. Not referenced ifNCVT = 0.LDVTβLDVT is INTEGER. The leading dimension of the array VT.LDVT >= max(1,N)ifNCVT > 0;LDVT >= 1ifNCVT = 0.UβU is DOUBLE PRECISION array, dimension (LDU, N). On entry, an NRU-by-N matrix U. On exit, U is overwritten byU * Q. Not referenced ifNRU = 0.LDUβLDU is INTEGER. The leading dimension of the array U.LDU >= max(1,NRU).CβC is DOUBLE PRECISION array, dimension (LDC, NCC). On entry, an N-by-NCC matrix C. On exit, C is overwritten byQ**T * C. Not referenced ifNCC = 0.LDCβLDC is INTEGER. The leading dimension of the array C.LDC >= max(1,N)ifNCC > 0;LDC >=1ifNCC = 0.WORKβWORK is DOUBLE PRECISION array, dimension (4*(N-1)).INFOβINFO is INTEGER. Exit-status tea, verbatim:
= 0: successful exit
< 0: If INFO = -i, the i-th argument had an illegal value
> 0:
if NCVT = NRU = NCC = 0,
= 1, a split was marked by a positive value in E
= 2, current block of Z not diagonalized after 30*N
iterations (in inner while loop)
= 3, termination criterion of outer while loop not met
(program created more than N unreduced blocks)
else NCVT = NRU = NCC = 0,
the algorithm did not converge; D and E contain the
elements of a bidiagonal matrix which is orthogonally
similar to the input matrix B; if INFO = i, i
elements of E have not converged to zero.
π§ Internal Parameters π§
TOLMULβDOUBLE PRECISION, default =max(10,min(100,EPS**(-1/8))).TOLMULcontrols the convergence criterion of the QR loop. If it is positive,TOLMUL*EPSis the desired relative precision in the computed singular values. If it is negative,abs(TOLMUL*EPS*sigma_max)is the desired absolute accuracy in the computed singular values (corresponds to relative accuracyabs(TOLMUL*EPS)in the largest singular value.abs(TOLMUL)should be between1and1/EPS, and preferably between10(for fast convergence) and.1/EPS(for there to be some accuracy in the results). Default is to lose at either one eighth or 2 of the available decimal digits in each computed singular value (whichever is smaller).MAXITRβINTEGER, default =6.MAXITRcontrols the maximum number of passes of the algorithm through its inner loop. The algorithms stops (and so fails to converge) if the number of passes through the inner loop exceedsMAXITR*N**2.
π Note π
Bug report from Cezary Dendek. On March 23rd 2017, the INTEGER variable MAXIT = MAXITR*N**2 is removed since it can overflow pretty easily (for N larger or equal than 18,919). We instead use MAXITDIVN = MAXITR*N.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition at line π
Definition at line 239 of file dbdsqr.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
β¨ cute sign-off: LAPACK Version 3.12.0 β generated automatically by Doxygen for LAPACK from the source code, and the page path is /home/abui...RC/dbdsqr.f(3). Bye bestie, slay your bidiagonal SVD! ππ
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms