Solve a system of linear equations a(1:n, ja:ja+n-1) * x = b(ib:ib+n-1, 1:nrhs)
SUBROUTINE PSPBSV(
UPLO, N, BW, NRHS, A, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO )
CHARACTER
UPLO
INTEGER
BW, IB, INFO, JA, LWORK, N, NRHS
INTEGER
DESCA( * ), DESCB( * )
REAL
A( * ), B( * ), WORK( * )
PSPBSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N real
banded symmetric positive definite distributed
matrix with bandwidth BW.
Cholesky factorization is used to factor a reordering of
the matrix into L L'.
See PSPBTRF and PSPBTRS for details.