DPTTRSV(l)

πŸ“¦ version 1.5, in ubuntu jammy

DPTTRSV πŸ’–

okay so bestie, welcome to the DPTTRSV page β€” that's a LAPACK routine, version 2.0, and she's a real one. this is the l manual page, iykyk. ✨


🌸 NAME 🌸

DPTTRSV β€” she solves one of the triangular systems L**T* X = B, or L * X = B, πŸ’…


✨ SYNOPSIS ✨

SUBROUTINE DPTTRSV( TRANS, N, NRHS, D, E, B, LDB, INFO )

    CHARACTER       TRANS

    INTEGER         INFO, LDB, N, NRHS

    DOUBLE          PRECISION D( * )

    DOUBLE          PRECISION B( LDB, * ), E( * )

πŸ¦‹ PURPOSE πŸ¦‹

so like, DPTTRSV solves one of the triangular systems

   L**T* X = B, or  L * X = B, where L is the Cholesky factor of a
Hermitian positive
definite tridiagonal matrix A such that
A = L*D*L**H (computed by DPTTRF).

no cap, that's the whole vibe. L is the Cholesky factor of a Hermitian positive definite tridiagonal matrix A, and A = L*D*L**H, which got computed by DPTTRF earlier. 🫢


πŸŽ€ ARGUMENTS πŸŽ€

  • TRANS (input) CHARACTER β€” specifies the form of the system of equations, bestie. pick your fighter:
    • = 'N': L * X = B (No transpose)
    • = 'T': L**T * X = B (Transpose)
  • N (input) INTEGER β€” the order of the tridiagonal matrix A. and like, N >= 0, obviously. πŸ’
  • NRHS (input) INTEGER β€” the number of right hand sides, aka the number of columns of the matrix B. NRHS >= 0. periodt.
  • D (input) REAL array, dimension (N) β€” the n diagonal elements of the diagonal matrix D, straight from the factorization computed by DPTTRF. iconic. πŸ‘‘
  • E (input) COMPLEX array, dimension (N-1) β€” the (n-1) off-diagonal elements of the unit bidiagonal factor U or L from the factorization computed by DPTTRF (see UPLO). yes bestie, N-1, not N. don't come for me.
  • B (input/output) COMPLEX array, dimension (LDB,NRHS) β€” on entry, the right hand side matrix B. on exit? the solution matrix X. she ate and left no crumbs. πŸ”₯
  • LDB (input) INTEGER β€” the leading dimension of the array B. LDB >= max(1,N). fr fr.
  • INFO (output) INTEGER β€” the receipts:
    • = 0: successful exit 🌈
    • < 0: if INFO = -i, the i-th argument had an illegal value πŸ’€

heads up bestie: if INFO comes back negative, something you passed in was illegal β€” the -i tells you which argument was the problem. that's not a vibe, that's a bug in your call. πŸ™ˆ

k byeee, go solve some triangular systems πŸ’œ β€” this one's a modified LAPACK routine, dated 12 May 1997, mwah πŸ§šβ­πŸ“

πŸ“¦ where this page comes from