NAME¶
PZPTSV - solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1,
1:NRHS)
SYNOPSIS¶
- SUBROUTINE PZPTSV(
- UPLO, N, NRHS, D, E, JA, DESCA, B, IB, DESCB, WORK, LWORK,
INFO )
- CHARACTER
- UPLO
- INTEGER
- IB, INFO, JA, LWORK, N, NRHS
- INTEGER
- DESCA( * ), DESCB( * )
- COMPLEX*16
- B( * ), E( * ), WORK( * )
- DOUBLE
- PRECISION D( * )
PURPOSE¶
PZPTSV solves a system of linear equations
where A(1:N, JA:JA+N-1) is an N-by-N complex
tridiagonal symmetric positive definite distributed
matrix.
Cholesky factorization is used to factor a reordering of
the matrix into L L'.
See PZPTTRF and PZPTTRS for details.