Solve a system of linear equations a(1:n, ja:ja+n-1) * x = b(ib:ib+n-1, 1:nrhs)
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( * )
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.