NAME

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

SYNOPSIS

       SUBROUTINE PSDBSV( N, BWL, BWU, NRHS, A, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO )

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

           INTEGER        DESCA( * ), DESCB( * )

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

PURPOSE

       PSDBSV solves a system of linear equations

       where A(1:N, JA:JA+N-1) is an N-by-N real
       banded diagonally dominant-like distributed
       matrix with bandwidth BWL, BWU.

       Gaussian elimination without pivoting
       is used to factor a reordering
       of the matrix into L U.

       See PSDBTRF and PSDBTRS for details.