SRC/sgbsv.f(3)
π NAME π
okay so this is the page for SRC/sgbsv.f, from the Library Functions Manual β and it's literally iconic, bestie. no cap.
β¨ SYNOPSIS β¨
π«Ά Functions/Subroutines π«Ά
subroutine sgbsv (n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)β SGBSV computes the solution to system of linear equationsA * X = Bfor GB matrices (simple driver). it's giving solver main character energy, fr fr.
π¦ Function/Subroutine Documentation π¦
the whole vibe is this signature, periodt:
subroutine sgbsv (integer n, integer kl, integer ku, integer nrhs, real, dimension( ldab, * ) ab, integer ldab, integer, dimension( * ) ipiv, real, dimension( ldb, * ) b, integer ldb, integer info)
SGBSV computes the solution to system of linear equations A * X = B for GB matrices (simple driver). slay.
β¨ Purpose β¨
okay so SGBSV computes the solution to a real system of linear equations A * X = B, where A is a band matrix of order N with KL subdiagonals and KU superdiagonals, and X and B are N-by-NRHS matrices.
The LU decomposition with partial pivoting and row interchanges is used to factor A as A = L * U, where L is a product of permutation and unit lower triangular matrices with KL subdiagonals, and U is upper triangular with KL+KU superdiagonals. The factored form of A is then used to solve the system of equations A * X = B. lowkey genius behavior.
πΈ Parameters πΈ
NβNisINTEGER. The number of linear equations, i.e., the order of the matrixA.N >= 0.KLβKLisINTEGER. The number of subdiagonals within the band ofA.KL >= 0.KUβKUisINTEGER. The number of superdiagonals within the band ofA.KU >= 0.NRHSβNRHSisINTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0.ABβABisREALarray, dimension(LDAB,N). On entry, the matrixAin band storage, in rowsKL+1to2*KL+KU+1; rows1toKLof the array need not be set. Thej-th column ofAis stored in thej-th column of the arrayABas follows:AB(KL+KU+1+i-j,j) = A(i,j)formax(1,j-KU)<=i<=min(N,j+KL). On exit, details of the factorization:Uis stored as an upper triangular band matrix withKL+KUsuperdiagonals in rows1toKL+KU+1, and the multipliers used during the factorization are stored in rowsKL+KU+2to2*KL+KU+1. See below for further details. it's giving storage scheme realness.LDABβLDABisINTEGER. The leading dimension of the arrayAB.LDAB >= 2*KL+KU+1.IPIVβIPIVisINTEGERarray, dimension(N). The pivot indices that define the permutation matrixP; rowiof the matrix was interchanged with rowIPIV(i).BβBisREALarray, dimension(LDB,NRHS). On entry, theN-by-NRHSright hand side matrixB. On exit, ifINFO = 0, theN-by-NRHSsolution matrixX.LDBβLDBisINTEGER. The leading dimension of the arrayB.LDB >= max(1,N).INFOβINFOisINTEGER.= 0: successful exit.< 0: ifINFO = -i, thei-th argument had an illegal value.> 0: ifINFO = i,U(i,i)is exactly zero. The factorization has been completed, but the factorUis exactly singular, and the solution has not been computed. π so watch out for that.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π₯ Further Details π₯
The band storage scheme is illustrated by the following example, when M = N = 6, KL = 2, KU = 1:
On entry: On exit:
* * * + + + * * * u14 u25 u36
* * + + + + * * u13 u24 u35 u46
* a12 a23 a34 a45 a56 * u12 u23 u34 u45 u56
a11 a22 a33 a44 a55 a66 u11 u22 u33 u44 u55 u66
a21 a32 a43 a54 a65 * m21 m32 m43 m54 m65 *
a31 a42 a53 a64 * * m31 m42 m53 m64 * *
Array elements marked * are not used by the routine; elements marked + need not be set on entry, but are required by the routine to store elements of U because of fill-in resulting from the row interchanges. iykyk.
π Definition at line 161 of file sgbsv.f. π
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
π okay bestie, that's the whole page. it's from LAPACK, Version 3.12.0, and it's literally SRC/sgbsv.f(3) β mwah! π
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms