Risk-Aware Code Review: Auto Approve Low-Risk Changes
LiveReview LiveReview LiveReview - Free, Risk-Aware Code Review: Auto Approve Low-Risk Changes | Product Hunt LiveReview - Free, Risk-Aware Code Review: Auto Approve Low-Risk Changes | Product Hunt GitHub Install Now

We'd appreciate a star

PSPBTRS - solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)

Name

       PSPBTRS - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)

Purpose

       PSPBTRS solves a system of linear equations

       where  A(1:N,  JA:JA+N-1)  is the matrix used to produce the factors stored in A(1:N,JA:JA+N-1) and AF by
       PSPBTRF.
       A(1:N, JA:JA+N-1) is an N-by-N real
       banded symmetric positive definite distributed
       matrix with bandwidth BW.
       Depending on the value of UPLO, A stores either U or L in the equn A(1:N, JA:JA+N-1) = U'*U  or  L*L'  as
       computed by PSPBTRF.

       Routine PSPBTRF MUST be called first.

LAPACK version 1.5                                 12 May 1997                                        PSPBTRS(l)

Synopsis

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

           CHARACTER       UPLO

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

           INTEGER         DESCA( * ), DESCB( * )

           REAL            A( * ), AF( * ), B( * ), WORK( * )

See Also