pcptsv3
Solve a system of linear equations a(1:n, ja:ja+n-1) * x = b(ib:ib+n-1, 1:nrhs)
Usage
- SUBROUTINE PCPTSV(
-
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
-
B( * ), E( * ), WORK( * )
- REAL
-
D( * )
Purpose
PCPTSV 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 PCPTTRF and PCPTTRS for details.
Releases
Unchanged in 11 releases since Debian 2.2 (Potato).