Section: LAPACK routine (version 1.5) (l) Updated: 12 May 1997 Local index
PSPBSV - 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 )
BW, IB, INFO, JA, LWORK, N, NRHS
DESCA( * ), DESCB( * )
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.
This document was created by
using the manual pages.
Time: 21:53:11 GMT, April 16, 2011