DLALSD(3)
π
DLALSD β dlalsd.f(3) β Library Functions Manual π
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dlalsd.f
Okay bestie, this is the dlalsd.f(3) page, and yes the path is doing the absolute most. π
πΈ 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 π₯
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 the purpose is: 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. Choose your fighter:= 'U'meansDandEdefine an upper bidiagonal matrix;= 'L'meansDandEdefine a lower bidiagonal matrix. πSMLSIZβSMLSIZisINTEGER. It's the maximum size of the subproblems at the bottom of the computation tree. π§NβNisINTEGER. The dimension of the bidiagonal matrix.N >= 0. Periodt.NRHSβNRHSisINTEGER. The number of columns ofB.NRHSmust be at least1. No empty vibes here.DβDisDOUBLE PRECISION array, dimension (N). On entryDcontains the main diagonal of the bidiagonal matrix. On exit, ifINFO = 0,Dcontains its singular values. βEβEisDOUBLE PRECISION array, dimension (N-1). Contains the super-diagonal entries of the bidiagonal matrix. On exit,Ehas been destroyed. π Gone. Reduced to atoms.BβBisDOUBLE PRECISION array, 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 of A less 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 of A greater thanRCONDtimes the largest singular value. πWORKβWORKisDOUBLE PRECISION array, 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βIWORKisINTEGER array, dimension at least(3*N*NLVL + 11*N). πINFOβINFOisINTEGER. Exit status tea:= 0: successful exit.< 0: ifINFO = -i, the i-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.
Signing off from the footer like the main character: LAPACK β Version 3.12.0 β /home/abui...RC/dlalsd.f(3). Stay slaying, bestie. πβ¨
π¦ 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