ZGELSS(3)
π ZGELSS(3) β LAPACK Library Functions Manual π
bestie, welcome to /home/abui...RC/zgelss.f(3) β the LAPACK Library Functions Manual page for ZGELSS, aka the routine that solves overdetermined or underdetermined systems for GE matrices. No cap, this one is a whole vibe. π¦
πΈ NAME πΈ
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zgelss.f
β¨ SYNOPSIS β¨
Functions/Subroutines
subroutine ZGELSS (m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work,
lwork, rwork, info)
ZGELSS solves overdetermined or underdetermined systems for GE matrices.
π¦ Function/Subroutine Documentation π¦
subroutine ZGELSS (integer m, integer n, integer nrhs, complex*16,
dimension( lda, * ) a, integer lda, complex*16, dimension( ldb, * ) b,
integer ldb, double precision, dimension( * ) s, double precision rcond,
integer rank, complex*16, dimension( * ) work, integer lwork, double
precision, dimension( * ) rwork, integer info)
ZGELSS solves overdetermined or underdetermined systems for GE matrices.
π Purpose π
ZGELSS computes the minimum norm solution to a complex linear least squares problem:
Minimize 2-norm(| b - A*x |).
using the singular value decomposition (SVD) of A. A is an M-by-N matrix which may be rank-deficient.
Several right hand side vectors b and solution vectors x can be handled in a single call; they are stored as the columns of the M-by-NRHS right hand side matrix B and the N-by-NRHS solution matrix X.
The effective rank of A is determined by treating as zero those singular values which are less than RCOND times the largest singular value.
π Parameters π
MβM is INTEGER. The number of rows of the matrixA.M >= 0.NβN is INTEGER. The number of columns of the matrixA.N >= 0.NRHSβNRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matricesBandX.NRHS >= 0.AβA is COMPLEX*16 array, dimension (LDA,N). On entry, theM-by-NmatrixA. On exit, the firstmin(m,n)rows ofAare overwritten with its right singular vectors, stored rowwise.LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,M).BβB is COMPLEX*16 array, dimension (LDB,NRHS). On entry, theM-by-NRHSright hand side matrixB. On exit,Bis overwritten by theN-by-NRHSsolution matrixX. Ifm >= nandRANK = n, the residual sum-of-squares for the solution in the i-th column is given by the sum of squares of the modulus of elementsn+1:min that column.LDBβLDB is INTEGER. The leading dimension of the arrayB.LDB >= max(1,M,N).SβS is DOUBLE PRECISION array, dimension (min(M,N)). The singular values ofAin decreasing order. The condition number ofAin the 2-norm =S(1)/S(min(m,n)).RCONDβRCOND is DOUBLE PRECISION.RCONDis used to determine the effective rank ofA. Singular valuesS(i) <= RCOND*S(1)are treated as zero. IfRCOND < 0, machine precision is used instead.RANKβRANK is INTEGER. The effective rank ofA, i.e., the number of singular values which are greater thanRCOND*S(1).WORKβWORK is COMPLEX*16 array, dimension (MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK.LWORKβLWORK is INTEGER. The dimension of the arrayWORK.LWORK >= 1, and also:LWORK >= 2*min(M,N) + max(M,N,NRHS). For good performance,LWORKshould generally be larger. IfLWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of theWORKarray, returns this value as the first entry of theWORKarray, and no error message related toLWORKis issued byXERBLA.RWORKβRWORK is DOUBLE PRECISION array, dimension (5*min(M,N)).INFOβINFO is INTEGER.= 0: successful exit.< 0: ifINFO = -i, the i-th argument had an illegal value.> 0: the algorithm for computing the SVD failed to converge; ifINFO = i, i off-diagonal elements of an intermediate bidiagonal form did not converge to zero.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 176 of file zgelss.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
Thatβs the whole iconic page, bestie. Footer tea: LAPACK, Version 3.12.0, and the path /home/abui...RC/zgelss.f(3) β periodt. π
π¦ 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