/home/abui...RC/zgels.f(3)
okay bestie, welcome to the Library Functions Manual page for /home/abui...RC/zgels.f(3) π
this is the ZGELS source-file page, and weβre going through it with zero skips, fr fr.
π NAME
The page/file is literally:
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zgels.f
π« SYNOPSIS
π¦ Functions/Subroutines
subroutine ZGELS (trans, m, n, nrhs, a, lda, b, ldb, work, lwork, info)
ZGELS solves overdetermined or underdetermined systems for GE
matrices
ZGELS solves overdetermined or underdetermined systems for GE matrices π
β¨ FUNCTION/SUBROUTINE DOCUMENTATION β¨
subroutine ZGELS (character trans, integer m, integer n, integer nrhs,
complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension(
ldb, * ) b, integer ldb, complex*16, dimension( * ) work, integer lwork,
integer info)
ZGELS solves overdetermined or underdetermined systems for GE matrices π«Ά
π― PURPOSE
ZGELS solves overdetermined or underdetermined complex linear systems involving an M-by-N matrix A, or its conjugate-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 problemminimize || B - A*X ||. - If
TRANS = 'N'andm < n: find the minimum norm solution of an underdetermined systemA * X = B. - If
TRANS = 'C'andm >= n: find the minimum norm solution of an underdetermined systemA**H * X = B. - If
TRANS = 'C'andm < n: find the least squares solution of an overdetermined system, i.e., solve the least squares problemminimize || B - A**H * 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
π« TRANS
TRANS is CHARACTER*1
= 'N': the linear system involvesA;= 'C': the linear system involvesA**H.
π¦ 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 COMPLEX*16 array, dimension (LDA,N)
On entry, the M-by-N matrix A.
- if
M >= N,Ais overwritten by details of its QR factorization as returned byZGEQRF; - if
M < N,Ais overwritten by details of its LQ factorization as returned byZGELQF.
π LDA
LDA is INTEGER
The leading dimension of the array A. LDA >= max(1,M).
π B
B is COMPLEX*16 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 = 'C'.
On exit, if INFO = 0, B is overwritten by the solution vectors, stored columnwise:
- if
TRANS = 'N'andm >= n, rows1tonofBcontain the least squares solution vectors; the residual sum of squares for the solution in each column is given by the sum of squares of the modulus of elementsN+1toMin that column; - if
TRANS = 'N'andm < n, rows1toNofBcontain the minimum norm solution vectors; - if
TRANS = 'C'andm >= n, rows1toMofBcontain the minimum norm solution vectors; - if
TRANS = 'C'andm < n, rows1toMofBcontain the least squares solution vectors; the residual sum of squares for the solution in each column is given by the sum of squares of the modulus of elementsM+1toNin that column.
π¦ LDB
LDB is INTEGER
The leading dimension of the array B. LDB >= MAX(1,M,N).
π₯ WORK
WORK is COMPLEX*16 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, thei-th argument had an illegal value> 0: ifINFO = i, thei-th diagonal element of the triangular factor ofAis zero, so thatAdoes not have full rank; the least squares solution could not be computed.
bestie, that INFO > 0 case is the full-rank vibe check failing π the least squares solution could not be computed.
π AUTHOR
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 180 of file zgels.f.
π§ AUTHOR
Generated automatically by Doxygen for LAPACK from the source code.
thatβs the whole page, bestie π«Ά source/version: LAPACK Version 3.12.0; footer path: /home/abui...RC/zgels.f(3). bye and slay π
π¦ 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