SGELSS(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

πŸ’… SGELSS(3) β€” Library Functions Manual edition πŸ’…

okay so this is SGELSS(3), from the Library Functions Manual. It’s a LAPACK baddie here to solve your least-squares moment. periodt ✨

πŸ“› NAME πŸ“›

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/sgelss.f

That path is the whole NAME vibe, bestie β€” yes, it’s literally the source file for SGELSS.

✨ SYNOPSIS ✨

Functions/Subroutines

  • subroutine SGELSS (m, n, nrhs, a, lda, b, ldb, s, rcond, rank, work, lwork, info) β€” SGELSS solves overdetermined or underdetermined systems for GE matrices

🫢 Function/Subroutine Documentation 🫢

Here’s the full signature, character-for-character, because we do not play about code:

subroutine SGELSS (integer m, integer n, integer nrhs, real, dimension( lda, * ) a, integer lda, real, dimension( ldb, * ) b, integer ldb, real, dimension( * ) s, real rcond, integer rank, real, dimension( * ) work, integer lwork, integer info)

SGELSS solves overdetermined or underdetermined systems for GE matrices

Purpose

okay so the mission is: SGELSS computes the minimum norm solution to a real linear least squares problem:

Minimize 2-norm(| b - A*x |).

It does that using the singular value decomposition (SVD) of A. A is an M-by-N matrix which may be rank-deficient. iykyk 😌

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. slay.

The effective rank of A is determined by treating as zero those singular values which are less than RCOND times the largest singular value. vibe check complete.

Parameters

  • M β€” M is INTEGER. The number of rows of the matrix A. M >= 0.
  • N β€” N is INTEGER. The number of columns of the matrix A. N >= 0.
  • NRHS β€” NRHS is INTEGER. The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
  • A β€” A is REAL array, dimension (LDA,N). On entry, the M-by-N matrix A. On exit, the first min(m,n) rows of A are overwritten with its right singular vectors, stored rowwise.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,M).
  • B β€” B is REAL array, dimension (LDB,NRHS). On entry, the M-by-NRHS right hand side matrix B. On exit, B is overwritten by the N-by-NRHS solution matrix X. If m >= n and RANK = n, the residual sum-of-squares for the solution in the i-th column is given by the sum of squares of elements n+1:m in that column.
  • LDB β€” LDB is INTEGER. The leading dimension of the array B. LDB >= max(1,max(M,N)).
  • S β€” S is REAL array, dimension (min(M,N)). The singular values of A in decreasing order. The condition number of A in the 2-norm = S(1)/S(min(m,n)).
  • RCOND β€” RCOND is REAL. RCOND is used to determine the effective rank of A. Singular values S(i) <= RCOND*S(1) are treated as zero. If RCOND < 0, machine precision is used instead.
  • RANK β€” RANK is INTEGER. The effective rank of A, i.e., the number of singular values which are greater than RCOND*S(1).
  • WORK β€” WORK is REAL array, dimension (MAX(1,LWORK)). On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
  • LWORK β€” LWORK is INTEGER. The dimension of the array WORK. LWORK >= 1, and also: LWORK >= 3*min(M,N) + max( 2*min(M,N), max(M,N), NRHS ). 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.

  • INFO β€” INFO is INTEGER.
    • = 0: successful exit
    • < 0: if INFO = -i, the i-th argument had an illegal value.
    • > 0: the algorithm for computing the SVD failed to converge; if INFO = 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 170 of file sgelss.f.

πŸ“œ Author πŸ“œ

Generated automatically by Doxygen for LAPACK from the source code.


okay that’s the whole page, bestie! final sign-off: LAPACK Version 3.12.0, footer path /home/abui...RC/sgelss.f(3), Library Functions Manual energy β€” no date printed in the footer, so I’m not inventing one. mwah πŸ’–πŸ’…

πŸ“¦ where this page comes from