PSDTTRSV(l)
β¨ NAME β¨
okay bestie, meet PSDTTRSV(l) β a LAPACK routine, version 1.5, and she does exactly this:
PSDTTRSVβ solve a tridiagonal triangular system of linear equationsA(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
π¦ SYNOPSIS π¦
no cap, here's the whole cast list:
SUBROUTINE PSDTTRSV( UPLO, TRANS, N, NRHS, DL, D, DU, JA, DESCA, B, IB,
DESCB, AF, LAF, WORK, LWORK, INFO )
CHARACTER TRANS, UPLO
INTEGER IB, INFO, JA, LAF, LWORK, N, NRHS
INTEGER DESCA( * ), DESCB( * )
REAL AF( * ), B( * ), D( * ), DL( * ), DU( * ), WORK( *
)
πΈ PURPOSE πΈ
PSDTTRSV solves a tridiagonal triangular system of linear equations
A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
or
A(1:N, JA:JA+N-1)^T * X = B(IB:IB+N-1, 1:NRHS)
where A(1:N, JA:JA+N-1) is a tridiagonal triangular matrix factor produced by the Gaussian elimination code PS@(dom_pre)TTRF and is stored in A(1:N,JA:JA+N-1) and AF. The matrix stored in A(1:N, JA:JA+N-1) is either upper or lower triangular according to UPLO, and the choice of solving A(1:N, JA:JA+N-1) or A(1:N, JA:JA+N-1)^T is dictated by the user by the parameter TRANS.
Routine PSDTTRF MUST be called first.
mwah π that's the whole page, bestie. This was LAPACK version 1.5, dated 12 May 1997, and the manual page is PSDTTRSV(l). slay β¨
π¦ where this page comes from
- ubuntu jammy: scalapack-doc 1.5-11
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms