SRC/dlalsd.f(3)
π SRC/dlalsd.f(3) π
okay so bestie, welcome to the SRC/dlalsd.f page from the Library Functions Manual β this is the DLALSD moment and it's lowkey iconic π
β¨
π NAME π
SRC/dlalsd.f
β¨ SYNOPSIS β¨
π§ Functions/Subroutines π§
subroutine dlalsd (uplo, smlsiz, n, nrhs, d, e, b, ldb, rcond, rank,
work, iwork, info)
DLALSD uses the singular value decomposition of A to solve the least squares problem. π«Ά
π¦ Function/Subroutine Documentation π¦
okay so here's the full signature, bestie β copy it exactly, no cap:
subroutine dlalsd (character uplo, integer smlsiz, integer n, integer nrhs,
double precision, dimension( * ) d, double precision, dimension( * ) e,
double precision, dimension( ldb, * ) b, integer ldb, double precision
rcond, integer rank, double precision, dimension( * ) work, integer,
dimension( * ) iwork, integer info)
DLALSD uses the singular value decomposition of A to solve the least squares problem. π¦
π« Purpose π«
okay so DLALSD uses the singular value decomposition of A to solve the least squares problem of finding X to minimize the Euclidean norm of each column of A*X-B, where A is N-by-N upper bidiagonal, and X and B are N-by-NRHS. The solution X overwrites B. π
The singular values of A smaller than RCOND times the largest singular value are treated as zero in solving the least squares problem; in this case a minimum norm solution is returned. The actual singular values are returned in D in ascending order. πΈ
π Parameters π
UPLOβUPLOisCHARACTER*1π= 'U':DandEdefine an upper bidiagonal matrix.= 'L':DandEdefine a lower bidiagonal matrix.
SMLSIZβSMLSIZisINTEGER. The maximum size of the subproblems at the bottom of the computation tree. πNβNisINTEGER. The dimension of the bidiagonal matrix.N >= 0. β¨NRHSβNRHSisINTEGER. The number of columns ofB.NRHSmust be at least1. πDβDisDOUBLE PRECISIONarray, dimension(N). On entryDcontains the main diagonal of the bidiagonal matrix. On exit, ifINFO = 0,Dcontains its singular values. πEβEisDOUBLE PRECISIONarray, dimension(N-1). Contains the super-diagonal entries of the bidiagonal matrix. On exit,Ehas been destroyed. πBβBisDOUBLE PRECISIONarray, dimension(LDB,NRHS). On input,Bcontains the right hand sides of the least squares problem. On output,Bcontains the solutionX. π«ΆLDBβLDBisINTEGER. The leading dimension ofBin the calling subprogram.LDBmust be at leastmax(1,N). βRCONDβRCONDisDOUBLE PRECISION. The singular values ofAless than or equal toRCONDtimes the largest singular value are treated as zero in solving the least squares problem. IfRCONDis negative, machine precision is used instead. For example, ifdiag(S)*X=Bwere the least squares problem, wherediag(S)is a diagonal matrix of singular values, the solution would beX(i) = B(i) / S(i)ifS(i)is greater thanRCOND*max(S), andX(i) = 0ifS(i)is less than or equal toRCOND*max(S). π₯RANKβRANKisINTEGER. The number of singular values ofAgreater thanRCONDtimes the largest singular value. πWORKβWORKisDOUBLE PRECISIONarray, dimension at least(9*N + 2*N*SMLSIZ + 8*N*NLVL + N*NRHS + (SMLSIZ+1)**2), whereNLVL = max(0, INT(log_2 (N/(SMLSIZ+1))) + 1). π§IWORKβIWORKisINTEGERarray, dimension at least(3*N*NLVL + 11*N). π¦INFOβINFOisINTEGERπ= 0: successful exit.< 0: ifINFO = -i, thei-th argument had an illegal value.> 0: The algorithm failed to compute a singular value while working on the submatrix lying in rows and columnsINFO/(N+1)throughMOD(INFO,N+1).
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Contributors π
- Ming Gu and Ren-Cang Li, Computer Science Division, University of California at Berkeley, USA
- Osni Marques, LBNL/NERSC, USA
Definition at line 171 of file dlalsd.f. π
π Author π
Generated automatically by Doxygen for LAPACK from the source code. β¨
and that's the whole page, bestie π«Ά β source/version is LAPACK Version 3.12.0, page is SRC/dlalsd.f(3), and the footer doesn't give a date, so don't come for me ππ
π
π¦ 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