NAME¶
PZDBSV - solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,
1:NRHS)
SYNOPSIS¶
- SUBROUTINE PZDBSV(
- 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( * )
- COMPLEX*16
- A( * ), B( * ), WORK( * )
PURPOSE¶
PZDBSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N complex
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 PZDBTRF and PZDBTRS for details.