PCPBSV(l) LAPACK routine (version 1.5) PCPBSV(l)
NAME
PCPBSV - solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
SYNOPSIS
SUBROUTINE PCPBSV( 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( * )
COMPLEX A( * ), B( * ), WORK( * )
PURPOSE
PCPBSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N complex
banded symmetric positive definite distributed
matrix with bandwidth BW.
Cholesky factorization is used to factor a reordering of
the matrix into L L'.
See PCPBTRF and PCPBTRS for details.
LAPACK version 1.5 12 May 1997 PCPBSV(l)
