.TH PSDTSV l "12 May 1997" "LAPACK version 1.5" "LAPACK routine (version 1.5)"
.SH NAME
PSDTSV - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
.SH SYNOPSIS
.TP 19
SUBROUTINE PSDTSV(
N, NRHS, DL, D, DU, JA, DESCA, B, IB, DESCB,
WORK, LWORK, INFO )
.TP 19
.ti +4
INTEGER
IB, INFO, JA, LWORK, N, NRHS
.TP 19
.ti +4
INTEGER
DESCA( * ), DESCB( * )
.TP 19
.ti +4
REAL
B( * ), D( * ), DL( * ), DU( * ), WORK( * )
.SH PURPOSE
PSDTSV solves a system of linear equations

where A(1:N, JA:JA+N-1) is an N-by-N real
.br
tridiagonal diagonally dominant-like distributed
.br
matrix.
.br

Gaussian elimination without pivoting
.br
is used to factor a reordering
.br
of the matrix into L U.
.br

See PSDTTRF and PSDTTRS for details.
.br

