PCPTTRS(l)

πŸ“¦ version 1.5, in ubuntu jammy

πŸ’– PCPTTRS πŸ’–

okay so bestie, welcome to the PCPTTRS page β€” it's a LAPACK routine, and it's lowkey doing the lord's work: solving linear systems. no cap. let's get into it 🫢


✨ NAME ✨

PCPTTRS</purl> β€” solve a system of linear equations

A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)

like. that's the whole vibe. she solves. πŸ’…


🌸 SYNOPSIS 🌸

SUBROUTINE PCPTTRS( UPLO, N, NRHS, D, E, JA, DESCA, B, IB, DESCB, AF,
                    LAF, WORK, LWORK, INFO )

    CHARACTER       UPLO

    INTEGER         IB, INFO, JA, LAF, LWORK, N, NRHS

    INTEGER         DESCA( * ), DESCB( * )

    COMPLEX         AF( * ), B( * ), E( * ), WORK( * )

    REAL            D( * )

look at all those arguments. she's got range. πŸ‘‘


πŸŽ€ PURPOSE πŸŽ€

so PCPTTRS solves a system of linear equations

A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)

where A(1:N, JA:JA+N-1) is the matrix that was used to produce the factors stored in A(1:N,JA:JA+N-1) and AF by PCPTTRF.

and like, A(1:N, JA:JA+N-1) is an N-by-N complex tridiagonal symmetric positive definite distributed matrix. yes she's all of those things at once, she contains multitudes πŸ’œ

depending on the value of UPLO, A stores either U or L in the equn

A(1:N, JA:JA+N-1) = U'D *U

or

L*D L'

as computed by PCPTTRF.

🚨 bestie. real talk. routine PCPTTRF MUST be called first. like, that's not optional, that's not a suggestion, that's the whole prerequisite. do not skip her. 😭

and that's the tea, fr fr β€” no notes, she ate, periodt πŸ’–βœ¨

this was PCPTTRS, a LAPACK routine, version 1.5, dated 12 May 1997 πŸŒΈπŸ¦‹ bye bestie, go call PCPTTRF first πŸ«ΆπŸ’…

πŸ“¦ where this page comes from