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

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

Name

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

Purpose

       PSDBTRS solves a system of linear equations
                                         or
                 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 used to produce the factors stored in A(1:N,JA:JA+N-1) and AF by
       PSDBTRF.
       A(1:N, JA:JA+N-1) is an N-by-N real
       banded diagonally dominant-like distributed
       matrix with bandwidth BWL, BWU.

       Routine PSDBTRF MUST be called first.

LAPACK version 1.5                                 12 May 1997                                        PSDBTRS(l)

Synopsis

       SUBROUTINE PSDBTRS( TRANS, N, BWL, BWU, NRHS, A, JA, DESCA, B, IB, DESCB, AF, LAF, WORK, LWORK, INFO )

           CHARACTER       TRANS

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

           INTEGER         DESCA( * ), DESCB( * )

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

See Also