Solve a system of linear equations a(1:n, ja:ja+n-1) * x = b(ib:ib+n-1, 1:nrhs)
SUBROUTINE PSDTSV(
N, NRHS, DL, D, DU, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO )
INTEGER
IB, INFO, JA, LWORK, N, NRHS
INTEGER
DESCA( * ), DESCB( * )
REAL
B( * ), D( * ), DL( * ), DU( * ), WORK( * )
PSDTSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N real
tridiagonal diagonally dominant-like distributed
matrix.
Gaussian elimination without pivoting
is used to factor a reordering
of the matrix into L U.
See PSDTTRF and PSDTTRS for details.