logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

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

Name

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

Purpose

       PDPBTRS 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
       PDPBTRF.
       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 PDPBTRF.

       Routine PDPBTRF MUST be called first.

LAPACK version 1.5                                 12 May 1997                                        PDPBTRS(l)

Synopsis

       SUBROUTINE PDPBTRS( 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( * )

           DOUBLE          PRECISION A( * ), AF( * ), B( * ), WORK( * )

See Also