other versions
PDPTSV(l) | LAPACK routine (version 1.5) | PDPTSV(l) |
NAME¶
PDPTSV - solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
SYNOPSIS¶
- SUBROUTINE PDPTSV(
- N, NRHS, D, E, JA, DESCA, B, IB, DESCB, WORK, LWORK, INFO )
INTEGER IB, INFO, JA, LWORK, N, NRHS INTEGER DESCA( * ), DESCB( * ) DOUBLE PRECISION B( * ), D( * ), E( * ), WORK( * )
PURPOSE¶
PDPTSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N real
tridiagonal symmetric positive definite distributed
matrix.
Cholesky factorization is used to factor a reordering of
the matrix into L L'.
See PDPTTRF and PDPTTRS for details.
12 May 1997 | LAPACK version 1.5 |