/home/abui...RC/sgels.f(3)
okay so bestie, this is the SGELS page from /home/abui...RC/sgels.f(3) β yes, itβs in the Library Functions Manual and weβre about to make linear systems make sense. π
β¨
πΈ NAME πΈ
The source file for this whole icon is /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/sgels.f. Thatβs the path, bestie β no cap. π«Ά
β¨ SYNOPSIS β¨
π Functions/Subroutines π
Hereβs the subroutine entrance music, exactly as written:
subroutine SGELS (trans, m, n, nrhs, a, lda, b, ldb, work, lwork, info)
SGELS solves overdetermined or underdetermined systems for GE matrices β thatβs the whole tagline. π
π¦ Function/Subroutine Documentation π¦
Full signature with all the types and dimensions, copy-paste sacred text:
subroutine SGELS (character trans, integer m, integer n, integer nrhs, real, dimension( lda, * ) a, integer lda, real, dimension( ldb, * ) b, integer ldb, real, dimension( * ) work, integer lwork, integer info)
SGELS solves overdetermined or underdetermined systems for GE matrices. π
β¨ Purpose β¨
Lowkey the whole plot:
SGELS solves overdetermined or underdetermined real linear systems involving an M-by-N matrix A, or its transpose, using a QR or LQ factorization of A. It is assumed that A has full rank.
The following options are provided:
- If
TRANS = 'N'andm >= n: find the least squares solution of an overdetermined system, i.e., solve the least squares problem
minimize || B - A*X ||.
- If
TRANS = 'N'andm < n: find the minimum norm solution of an underdetermined systemA * X = B. - If
TRANS = 'T'andm >= n: find the minimum norm solution of an underdetermined systemA**T * X = B. - If
TRANS = 'T'andm < n: find the least squares solution of an overdetermined system, i.e., solve the least squares problem
minimize || B - A**T * X ||.
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.
π Parameters π
Every parameter gets its moment. No skipping. π
TRANS
TRANS is CHARACTER*1
= 'N': the linear system involvesA;= 'T': the linear system involvesA**T.
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,
- if
M >= N,Ais overwritten by details of its QR factorization as returned bySGEQRF; - if
M < N,Ais overwritten by details of its LQ factorization as returned bySGELQF.
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 matrix B of right hand side vectors, stored columnwise; B is M-by-NRHS if TRANS = 'N', or N-by-NRHS if TRANS = 'T'.
On exit, if INFO = 0, B is overwritten by the solution vectors, stored columnwise:
- if
TRANS = 'N'andm >= n, rows 1 to n ofBcontain the least squares solution vectors; the residual sum of squares for the solution in each column is given by the sum of squares of elementsN+1toMin that column; - if
TRANS = 'N'andm < n, rows 1 to N ofBcontain the minimum norm solution vectors; - if
TRANS = 'T'andm >= n, rows 1 to M ofBcontain the minimum norm solution vectors; - if
TRANS = 'T'andm < n, rows 1 to M ofBcontain the least squares solution vectors; the residual sum of squares for the solution in each column is given by the sum of squares of elementsM+1toNin that column.
LDB
LDB is INTEGER
The leading dimension of the array B. LDB >= MAX(1,M,N).
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 >= max( 1, MN + max( MN, NRHS ) ).
For optimal performance,
LWORK >= max( 1, MN + max( MN, NRHS )*NB ).
where MN = min(M,N) and NB is the optimum block size.
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: ifINFO = -i, the i-th argument had an illegal value> 0: ifINFO = i, the i-th diagonal element of the triangular factor ofAis zero, so thatAdoes not have full rank; the least squares solution could not be computed.
π Author π
Take a bow, academic legends:
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Definition at line 181 of file sgels.f. π
Yep, thatβs the exact line. π«Ά
π§ Author π§
Generated automatically by Doxygen for LAPACK from the source code.
okay thatβs the whole page, bestie. Footer vibe check: LAPACK Version 3.12.0 and /home/abui...RC/sgels.f(3). Slay, 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