realGTcomputational(3)
realGTcomputational(3) π
okay so welcome to the LAPACK group chat for realGTcomputational, bestie. This is the real computational crew for GT matrices. No cap, it's giving linear algebra but make it cute. β¨
πΈ NAME πΈ
realGTcomputational β real. That's the name, that's the vibe. Periodt.
β¨ SYNOPSIS β¨
Functions:
subroutine sgtcon (NORM, N, DL, D, DU, DU2, IPIV, ANORM, RCOND, WORK, IWORK, INFO)βSGTCONsubroutine sgtrfs (TRANS, N, NRHS, DL, D, DU, DLF, DF, DUF, DU2, IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO)βSGTRFSsubroutine sgttrf (N, DL, D, DU, DU2, IPIV, INFO)βSGTTRFsubroutine sgttrs (TRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB, INFO)βSGTTRSsubroutine sgtts2 (ITRANS, N, NRHS, DL, D, DU, DU2, IPIV, B, LDB)βSGTTS2 solves a system of linear equations with a tridiagonal matrix using the LU factorization computed by sgttrf.
π¦ Detailed Description π¦
This is the group of real computational functions for GT matrices. That's it, that's the whole assignment. π
π Function Documentation π
π subroutine sgtcon π
subroutine sgtcon (character NORM, integer N, real, dimension( * ) DL, real,
dimension( * ) D, real, dimension( * ) DU, real, dimension( * ) DU2,
integer, dimension( * ) IPIV, real ANORM, real RCOND, real, dimension( *
) WORK, integer, dimension( * ) IWORK, integer INFO)
SGTCON
Purpose
SGTCON estimates the reciprocal of the condition number of a real tridiagonal matrix A using the LU factorization as computed by SGTTRF.
An estimate is obtained for norm(inv(A)), and the reciprocal of the condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))).
No cap, it's the condition-number detective. π
Parameters
NORMβNORMisCHARACTER*1. Specifies whether the 1-norm condition number or the infinity-norm condition number is required:= '1' or 'O':1-norm;= 'I':Infinity-norm.
NβNisINTEGER. The order of the matrixA.N >= 0.DLβDLisREALarray, dimension(N-1). The(n-1)multipliers that define the matrixLfrom the LU factorization ofAas computed bySGTTRF.DβDisREALarray, dimension(N). Thendiagonal elements of the upper triangular matrixUfrom the LU factorization ofA.DUβDUisREALarray, dimension(N-1). The(n-1)elements of the first superdiagonal ofU.DU2βDU2isREALarray, dimension(N-2). The(n-2)elements of the second superdiagonal ofU.IPIVβIPIVisINTEGERarray, dimension(N). The pivot indices; for1 <= i <= n, rowiof the matrix was interchanged with rowIPIV(i).IPIV(i)will always be eitheriori+1;IPIV(i) = iindicates a row interchange was not required.ANORMβANORMisREAL. IfNORM = '1'or'O', the 1-norm of the original matrixA. IfNORM = 'I', the infinity-norm of the original matrixA.RCONDβRCONDisREAL. The reciprocal of the condition number of the matrixA, computed asRCOND = 1/(ANORM * AINVNM), whereAINVNMis an estimate of the 1-norm ofinv(A)computed in this routine.WORKβWORKisREALarray, dimension(2*N)IWORKβIWORKisINTEGERarray, dimension(N)INFOβINFOisINTEGER= 0:successful exit< 0:ifINFO = -i, the i-th argument had an illegal value
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π subroutine sgtrfs π
subroutine sgtrfs (character TRANS, integer N, integer NRHS, real,
dimension( * ) DL, real, dimension( * ) D, real, dimension( * ) DU,
real, dimension( * ) DLF, real, dimension( * ) DF, real, dimension( * )
DUF, real, dimension( * ) DU2, integer, dimension( * ) IPIV, real,
dimension( ldb, * ) B, integer LDB, real, dimension( ldx, * ) X, integer
LDX, real, dimension( * ) FERR, real, dimension( * ) BERR, real,
dimension( * ) WORK, integer, dimension( * ) IWORK, integer INFO)
SGTRFS
Purpose
SGTRFS improves the computed solution to a system of linear equations when the coefficient matrix is tridiagonal, and provides error bounds and backward error estimates for the solution.
It's like a glow-up for your solution, plus receipts. π
Parameters
TRANSβTRANSisCHARACTER*1. Specifies the form of the system of equations:= 'N':A * X = B(No transpose)= 'T':A**T * X = B(Transpose)= 'C':A**H * X = B(Conjugate transpose = Transpose)
NβNisINTEGER. The order of the matrixA.N >= 0.NRHSβNRHSisINTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0.DLβDLisREALarray, dimension(N-1). The(n-1)subdiagonal elements ofA.DβDisREALarray, dimension(N). The diagonal elements ofA.DUβDUisREALarray, dimension(N-1). The(n-1)superdiagonal elements ofA.DLFβDLFisREALarray, dimension(N-1). The(n-1)multipliers that define the matrixLfrom the LU factorization ofAas computed bySGTTRF.DFβDFisREALarray, dimension(N). Thendiagonal elements of the upper triangular matrixUfrom the LU factorization ofA.DUFβDUFisREALarray, dimension(N-1). The(n-1)elements of the first superdiagonal ofU.DU2βDU2isREALarray, dimension(N-2). The(n-2)elements of the second superdiagonal ofU.IPIVβIPIVisINTEGERarray, dimension(N). The pivot indices; for1 <= i <= n, rowiof the matrix was interchanged with rowIPIV(i).IPIV(i)will always be eitheriori+1;IPIV(i) = iindicates a row interchange was not required.BβBisREALarray, dimension(LDB,NRHS). The right hand side matrixB.LDBβLDBisINTEGER. The leading dimension of the arrayB.LDB >= max(1,N).XβXisREALarray, dimension(LDX,NRHS). On entry, the solution matrixX, as computed bySGTTRS. On exit, the improved solution matrixX.LDXβLDXisINTEGER. The leading dimension of the arrayX.LDX >= max(1,N).FERRβFERRisREALarray, dimension(NRHS). The estimated forward error bound for each solution vectorX(j)(the j-th column of the solution matrixX). IfXTRUEis the true solution corresponding toX(j),FERR(j)is an estimated upper bound for the magnitude of the largest element in(X(j) - XTRUE)divided by the magnitude of the largest element inX(j). The estimate is as reliable as the estimate forRCOND, and is almost always a slight overestimate of the true error.BERRβBERRisREALarray, dimension(NRHS). The componentwise relative backward error of each solution vectorX(j)(i.e., the smallest relative change in any element ofAorBthat makesX(j)an exact solution).WORKβWORKisREALarray, dimension(3*N)IWORKβIWORKisINTEGERarray, dimension(N)INFOβINFOisINTEGER= 0:successful exit< 0:ifINFO = -i, the i-th argument had an illegal value
Internal Parameters
ITMAX is the maximum number of steps of iterative refinement.
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π subroutine sgttrf π
subroutine sgttrf (integer N, real, dimension( * ) DL, real, dimension( * )
D, real, dimension( * ) DU, real, dimension( * ) DU2, integer,
dimension( * ) IPIV, integer INFO)
SGTTRF
Purpose
SGTTRF computes an LU factorization of a real tridiagonal matrix A using elimination with partial pivoting and row interchanges.
The factorization has the form
A = L * U
where L is a product of permutation and unit lower bidiagonal matrices and U is upper triangular with nonzeros in only the main diagonal and first two superdiagonals.
It's giving factorization realness. π₯
Parameters
NβNisINTEGER. The order of the matrixA.DLβDLisREALarray, dimension(N-1). On entry,DLmust contain the(n-1)sub-diagonal elements ofA. On exit,DLis overwritten by the(n-1)multipliers that define the matrixLfrom the LU factorization ofA.DβDisREALarray, dimension(N). On entry,Dmust contain the diagonal elements ofA. On exit,Dis overwritten by thendiagonal elements of the upper triangular matrixUfrom the LU factorization ofA.DUβDUisREALarray, dimension(N-1). On entry,DUmust contain the(n-1)super-diagonal elements ofA. On exit,DUis overwritten by the(n-1)elements of the first super-diagonal ofU.DU2βDU2isREALarray, dimension(N-2). On exit,DU2is overwritten by the(n-2)elements of the second super-diagonal ofU.IPIVβIPIVisINTEGERarray, dimension(N). The pivot indices; for1 <= i <= n, rowiof the matrix was interchanged with rowIPIV(i).IPIV(i)will always be eitheriori+1;IPIV(i) = iindicates a row interchange was not required.INFOβINFOisINTEGER= 0:successful exit< 0:ifINFO = -k, the k-th argument had an illegal value> 0:ifINFO = k,U(k,k)is exactly zero. The factorization has been completed, but the factorUis exactly singular, and division by zero will occur if it is used to solve a system of equations.
Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π sgttrs π
subroutine sgttrs (character TRANS, integer N, integer NRHS, real,
dimension( * ) DL, real, dimension( * ) D, real, dimension( * ) DU,
real, dimension( * ) DU2, integer, dimension( * ) IPIV, real, dimension(
ldb, * ) B, integer LDB, integer INFO)
SGTTRS
Okay bestie, meet SGTTRS π
. She solves one of these systems of equations:
A*X = B or A**T*X = B,
with a tridiagonal matrix A using the LU factorization computed by SGTTRF. No cap, she's just that girl. β¨
πΈ Purpose πΈ
SGTTRS solves one of the systems of equations
A*X = B or A**T*X = B,
with a tridiagonal matrix A using the LU factorization computed by SGTTRF. Periodt.
π Parameters π
TRANSβTRANSisCHARACTER*1. Specifies the form of the system of equations.= 'N': A * X = B (No transpose)= 'T': A**T* X = B (Transpose)= 'C': A**T* X = B (Conjugate transpose = Transpose)
NβNisINTEGER. The order of the matrixA. π―NRHSβNRHSisINTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0. π«ΆDLβDLisREAL array, dimension (N-1). The(n-1)multipliers that define the matrixLfrom the LU factorization ofA. π§DβDisREAL array, dimension (N). Thendiagonal elements of the upper triangular matrixUfrom the LU factorization ofA. πDUβDUisREAL array, dimension (N-1). The(n-1)elements of the first super-diagonal ofU. πDU2βDU2isREAL array, dimension (N-2). The(n-2)elements of the second super-diagonal ofU. π¦IPIVβIPIVisINTEGER array, dimension (N). The pivot indices; for1 <= i <= n, rowiof the matrix was interchanged with rowIPIV(i).IPIV(i)will always be eitheriori+1;IPIV(i) = iindicates a row interchange was not required. π₯BβBisREAL array, dimension (LDB,NRHS). On entry, the matrix of right hand side vectorsB. On exit,Bis overwritten by the solution vectorsX. πLDBβLDBisINTEGER. The leading dimension of the arrayB.LDB >= max(1,N). πINFOβINFOisINTEGER.= 0: successful exit< 0: if INFO = -i, the i-th argument had an illegal valueπ
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π sgtts2 π
subroutine sgtts2 (integer ITRANS, integer N, integer NRHS, real, dimension(
* ) DL, real, dimension( * ) D, real, dimension( * ) DU, real,
dimension( * ) DU2, integer, dimension( * ) IPIV, real, dimension( ldb,
* ) B, integer LDB)
SGTTS2 solves a system of linear equations with a tridiagonal matrix using the LU factorization computed by sgttrf. β¨
πΈ Purpose πΈ
SGTTS2 solves one of the systems of equations
A*X = B or A**T*X = B,
with a tridiagonal matrix A using the LU factorization computed by SGTTRF. Periodt.
π Parameters π
ITRANSβITRANSisINTEGER. Specifies the form of the system of equations.= 0: A * X = B (No transpose)= 1: A**T* X = B (Transpose)= 2: A**T* X = B (Conjugate transpose = Transpose)
NβNisINTEGER. The order of the matrixA. π―NRHSβNRHSisINTEGER. The number of right hand sides, i.e., the number of columns of the matrixB.NRHS >= 0. π«ΆDLβDLisREAL array, dimension (N-1). The(n-1)multipliers that define the matrixLfrom the LU factorization ofA. π§DβDisREAL array, dimension (N). Thendiagonal elements of the upper triangular matrixUfrom the LU factorization ofA. πDUβDUisREAL array, dimension (N-1). The(n-1)elements of the first super-diagonal ofU. πDU2βDU2isREAL array, dimension (N-2). The(n-2)elements of the second super-diagonal ofU. π¦IPIVβIPIVisINTEGER array, dimension (N). The pivot indices; for1 <= i <= n, rowiof the matrix was interchanged with rowIPIV(i).IPIV(i)will always be eitheriori+1;IPIV(i) = iindicates a row interchange was not required. π₯BβBisREAL array, dimension (LDB,NRHS). On entry, the matrix of right hand side vectorsB. On exit,Bis overwritten by the solution vectorsX. πLDBβLDBisINTEGER. The leading dimension of the arrayB.LDB >= max(1,N). π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
π That's the tea, bestie! This was LAPACK version3.11.0, generatedSun Nov 27 2022, and you're readingrealGTcomputational(3). Byeee! π β¨
π¦ where this page comes from
- debian bookworm: liblapack-doc 3.11.0-2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms