Section: LAPACK routine (version 1.5) (l) Updated: 12 May 1997 Local index
PCGBSV - solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
- SUBROUTINE PCGBSV(
N, BWL, BWU, NRHS, A, JA, DESCA, IPIV, B, IB,
DESCB, WORK, LWORK, INFO )
BWL, BWU, IB, INFO, JA, LWORK, N, NRHS
DESCA( * ), DESCB( * ), IPIV( * )
A( * ), B( * ), WORK( * )
PCGBSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N complex
matrix with bandwidth BWL, BWU.
Gaussian elimination with pivoting
is used to factor a reordering
of the matrix into P L U.
See PCGBTRF and PCGBTRS for details.
This document was created by
using the manual pages.
Time: 21:52:06 GMT, April 16, 2011