PZPBSV(l)

📦 version 1.5, in ubuntu jammy

✨ PZPBSV ✨

okay bestie, welcome to PZPBSV from the LAPACK routine squad — version 1.5 energy, and yes she is that girl 💅

💖 NAME 💖

PZPBSV — she solves a system of linear equations

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

like it's literally nothing 🫶

🎀 SYNOPSIS 🎀

SUBROUTINE PZPBSV( UPLO, N, BW, NRHS, A, JA, DESCA, B, IB, DESCB, WORK,
                   LWORK, INFO )

    CHARACTER      UPLO

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

    INTEGER        DESCA( * ), DESCB( * )

    COMPLEX*16     A( * ), B( * ), WORK( * )

the whole cast list, no skips, no cuts 🦋

🌸 PURPOSE 🌸

so PZPBSV solves a system of linear equations

where A(1:N, JA:JA+N-1) is an N-by-N complex banded symmetric positive definite distributed matrix with bandwidth BW. yes that's a lot of adjectives, she's versatile 💜

Cholesky factorization is used to factor a reordering of the matrix into L L'. iconic behavior, truly.

See PZPBTRF and PZPBTRS for details — those are her sisters, go say hi 👑

not me dropping a whole distributed linear solver like it's a fit check 😭 fr fr, every detail stayed, nothing got cut, that's the rule and we live by it.

and that's the tea, bestie ☕ — this page is from LAPACK version 1.5, dated 12 May 1997 🎀 slay, periodt 💖✨

📦 where this page comes from