tptri(3)
π NAME π
tptri β tptri: triangular inverse. Bestie, this is the manual page for tptri(3), and it is literally the LAPACK glow-up for computing the inverse of a triangular matrix stored in packed format. π
β¨
β¨ SYNOPSIS β¨
πΈ Functions πΈ
subroutine ctptri (uplo, diag, n, ap, info)βCTPTRIsubroutine dtptri (uplo, diag, n, ap, info)βDTPTRIsubroutine stptri (uplo, diag, n, ap, info)βSTPTRIsubroutine ztptri (uplo, diag, n, ap, info)βZTPTRI
π¦ Detailed Description π¦
Okay so this page is the group chat for four LAPACK subroutines: ctptri, dtptri, stptri, and ztptri. They all do the triangular-inverse thing, just with different type/precision vibes. Scroll down for the full purpose, parameters, author, further details, and definition line for each one. No skipped tea. π«Ά
π Function Documentation π
π ctptri β CTPTRI π
subroutine ctptri (character uplo, character diag, integer n, complex,
dimension( * ) ap, integer info)
CTPTRI
π Purpose π
CTPTRI computes the inverse of a complex upper or lower triangular matrix A stored in packed format.
πΈ Parameters πΈ
UPLOβUPLO is CHARACTER*1.= 'U':A is upper triangular;= 'L':A is lower triangular. πDIAGβDIAG is CHARACTER*1.= 'N':A is non-unit triangular;= 'U':A is unit triangular. πNβN is INTEGER, the order of the matrix A.N >= 0. No cap.APβAP is COMPLEX array, dimension (N*(N+1)/2). On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. The j-th column of A is stored in the arrayAPas follows: ifUPLO = 'U',AP(i + (j-1)*j/2) = A(i,j)for1<=i<=j; ifUPLO = 'L',AP(i + (j-1)*((2*n-j)/2) = A(i,j)forj<=i<=n. See below for further details. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. β¨INFOβINFO is INTEGER.= 0:successful exit.< 0:ifINFO = -i, the i-th argument had an illegal value.> 0:ifINFO = i,A(i,i)is exactly zero. The triangular matrix is singular and its inverse can not be computed. π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π§ Further Details π§
A triangular matrix A can be transferred to packed storage using one of the following program segments:
!>
!> A triangular matrix A can be transferred to packed storage using one
!> of the following program segments:
!>
!> UPLO = 'U': UPLO = 'L':
!>
!> JC = 1 JC = 1
!> DO 2 J = 1, N DO 2 J = 1, N
!> DO 1 I = 1, J DO 1 I = J, N
!> AP(JC+I-1) = A(I,J) AP(JC+I-J) = A(I,J)
!> 1 CONTINUE 1 CONTINUE
!> JC = JC + J JC = JC + N - J + 1
!> 2 CONTINUE 2 CONTINUE
!>
Definition at line 116 of file ctptri.f.
π dtptri β DTPTRI π
subroutine dtptri (character uplo, character diag, integer n, double
precision, dimension( * ) ap, integer info)
DTPTRI
π Purpose π
DTPTRI computes the inverse of a real upper or lower triangular matrix A stored in packed format.
πΈ Parameters πΈ
UPLOβUPLO is CHARACTER*1.= 'U':A is upper triangular;= 'L':A is lower triangular. πDIAGβDIAG is CHARACTER*1.= 'N':A is non-unit triangular;= 'U':A is unit triangular. πNβN is INTEGER, the order of the matrix A.N >= 0. No cap.APβAP is DOUBLE PRECISION array, dimension (N*(N+1)/2). On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. The j-th column of A is stored in the arrayAPas follows: ifUPLO = 'U',AP(i + (j-1)*j/2) = A(i,j)for1<=i<=j; ifUPLO = 'L',AP(i + (j-1)*((2*n-j)/2) = A(i,j)forj<=i<=n. See below for further details. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. β¨INFOβINFO is INTEGER.= 0:successful exit.< 0:ifINFO = -i, the i-th argument had an illegal value.> 0:ifINFO = i,A(i,i)is exactly zero. The triangular matrix is singular and its inverse can not be computed. π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π§ Further Details π§
A triangular matrix A can be transferred to packed storage using one of the following program segments:
!>
!> A triangular matrix A can be transferred to packed storage using one
!> of the following program segments:
!>
!> UPLO = 'U': UPLO = 'L':
!>
!> JC = 1 JC = 1
!> DO 2 J = 1, N DO 2 J = 1, N
!> DO 1 I = 1, J DO 1 I = J, N
!> AP(JC+I-1) = A(I,J) AP(JC+I-J) = A(I,J)
!> 1 CONTINUE 1 CONTINUE
!> JC = JC + J JC = JC + N - J + 1
!> 2 CONTINUE 2 CONTINUE
!>
Definition at line 116 of file dtptri.f.
π stptri β STPTRI π
subroutine stptri (character uplo, character diag, integer n, real,
dimension( * ) ap, integer info)
STPTRI
π Purpose π
STPTRI computes the inverse of a real upper or lower triangular matrix A stored in packed format.
πΈ Parameters πΈ
UPLOβUPLO is CHARACTER*1.= 'U':A is upper triangular;= 'L':A is lower triangular. πDIAGβDIAG is CHARACTER*1.= 'N':A is non-unit triangular;= 'U':A is unit triangular. πNβN is INTEGER, the order of the matrix A.N >= 0. No cap.APβAP is REAL array, dimension (N*(N+1)/2). On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. The j-th column of A is stored in the arrayAPas follows: ifUPLO = 'U',AP(i + (j-1)*j/2) = A(i,j)for1<=i<=j; ifUPLO = 'L',AP(i + (j-1)*((2*n-j)/2) = A(i,j)forj<=i<=n. See below for further details. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. β¨INFOβINFO is INTEGER.= 0:successful exit.< 0:ifINFO = -i, the i-th argument had an illegal value.> 0:ifINFO = i,A(i,i)is exactly zero. The triangular matrix is singular and its inverse can not be computed. π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π§ Further Details π§
A triangular matrix A can be transferred to packed storage using one of the following program segments:
!>
!> A triangular matrix A can be transferred to packed storage using one
!> of the following program segments:
!>
!> UPLO = 'U': UPLO = 'L':
!>
!> JC = 1 JC = 1
!> DO 2 J = 1, N DO 2 J = 1, N
!> DO 1 I = 1, J DO 1 I = J, N
!> AP(JC+I-1) = A(I,J) AP(JC+I-J) = A(I,J)
!> 1 CONTINUE 1 CONTINUE
!> JC = JC + J JC = JC + N - J + 1
!> 2 CONTINUE 2 CONTINUE
!>
Definition at line 116 of file stptri.f.
π ztptri β ZTPTRI π
subroutine ztptri (character uplo, character diag, integer n, complex*16,
dimension( * ) ap, integer info)
ZTPTRI
π Purpose π
ZTPTRI computes the inverse of a complex upper or lower triangular matrix A stored in packed format.
πΈ Parameters πΈ
UPLOβUPLO is CHARACTER*1.= 'U':A is upper triangular;= 'L':A is lower triangular. πDIAGβDIAG is CHARACTER*1.= 'N':A is non-unit triangular;= 'U':A is unit triangular. πNβN is INTEGER, the order of the matrix A.N >= 0. No cap.APβAP is COMPLEX*16 array, dimension (N*(N+1)/2). On entry, the upper or lower triangular matrix A, stored columnwise in a linear array. The j-th column of A is stored in the arrayAPas follows: ifUPLO = 'U',AP(i + (j-1)*j/2) = A(i,j)for1<=i<=j; ifUPLO = 'L',AP(i + (j-1)*((2*n-j)/2) = A(i,j)forj<=i<=n. See below for further details. On exit, the (triangular) inverse of the original matrix, in the same packed storage format. β¨INFOβINFO is INTEGER.= 0:successful exit.< 0:ifINFO = -i, the i-th argument had an illegal value.> 0:ifINFO = i,A(i,i)is exactly zero. The triangular matrix is singular and its inverse can not be computed. π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π§ Further Details π§
A triangular matrix A can be transferred to packed storage using one of the following program segments:
!>
!> A triangular matrix A can be transferred to packed storage using one
!> of the following program segments:
!>
!> UPLO = 'U': UPLO = 'L':
!>
!> JC = 1 JC = 1
!> DO 2 J = 1, N DO 2 J = 1, N
!> DO 1 I = 1, J DO 1 I = J, N
!> AP(JC+I-1) = A(I,J) AP(JC+I-J) = A(I,J)
!> 1 CONTINUE 1 CONTINUE
!> JC = JC + J JC = JC + N - J + 1
!> 2 CONTINUE 2 CONTINUE
!>
Definition at line 116 of file ztptri.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code. π«Ά
okay bestie, thatβs the whole tptri(3) vibe π
β the footer stamps this as LAPACK Version 3.12.0, page tptri(3). No date is shown on this footer, so Iβm not gonna invent one, periodt π. Bye! β¨
π¦ 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