zptsv (l)  Linux Manuals
zptsv: computes the solution to a complex system of linear equations A*X = B, where A is an NbyN Hermitian positive definite tridiagonal matrix, and X and B are NbyNRHS matrices
Command to display zptsv
manual in Linux: $ man l zptsv
NAME
ZPTSV  computes the solution to a complex system of linear equations A*X = B, where A is an NbyN Hermitian positive definite tridiagonal matrix, and X and B are NbyNRHS matrices
SYNOPSIS
 SUBROUTINE ZPTSV(

N, NRHS, D, E, B, LDB, INFO )

INTEGER
INFO, LDB, N, NRHS

DOUBLE
PRECISION D( * )

COMPLEX*16
B( LDB, * ), E( * )
PURPOSE
ZPTSV computes the solution to a complex system of linear equations
A*X = B, where A is an NbyN Hermitian positive definite tridiagonal
matrix, and X and B are NbyNRHS matrices.
A is factored as A = L*D*L**H, and the factored form of A is then
used to solve the system of equations.
ARGUMENTS
 N (input) INTEGER

The order of the matrix A. N >= 0.
 NRHS (input) INTEGER

The number of right hand sides, i.e., the number of columns
of the matrix B. NRHS >= 0.
 D (input/output) DOUBLE PRECISION array, dimension (N)

On entry, the n diagonal elements of the tridiagonal matrix
A. On exit, the n diagonal elements of the diagonal matrix
D from the factorization A = L*D*L**H.
 E (input/output) COMPLEX*16 array, dimension (N1)

On entry, the (n1) subdiagonal elements of the tridiagonal
matrix A. On exit, the (n1) subdiagonal elements of the
unit bidiagonal factor L from the L*D*L**H factorization of
A. E can also be regarded as the superdiagonal of the unit
bidiagonal factor U from the U**H*D*U factorization of A.
 B (input/output) COMPLEX*16 array, dimension (LDB,N)

On entry, the NbyNRHS right hand side matrix B.
On exit, if INFO = 0, the NbyNRHS solution matrix X.
 LDB (input) INTEGER

The leading dimension of the array B. LDB >= max(1,N).
 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
> 0: if INFO = i, the leading minor of order i is not
positive definite, and the solution has not been
computed. The factorization has not been completed
unless i = N.
Pages related to zptsv
 zptsv (3)
 zptsvx (l)  uses the factorization A = L*D*L**H to compute the solution to a complex system of linear equations A*X = B, where A is an NbyN Hermitian positive definite tridiagonal matrix and X and B are NbyNRHS matrices
 zptcon (l)  computes the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite tridiagonal matrix using the factorization A = L*D*L**H or A = U**H*D*U computed by ZPTTRF
 zpteqr (l)  computes all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF and then calling ZBDSQR to compute the singular values of the bidiagonal factor
 zptrfs (l)  improves the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
 zpttrf (l)  computes the L*D*Laq factorization of a complex Hermitian positive definite tridiagonal matrix A
 zpttrs (l)  solves a tridiagonal system of the form A * X = B using the factorization A = Uaq*D*U or A = L*D*Laq computed by ZPTTRF
 zptts2 (l)  solves a tridiagonal system of the form A * X = B using the factorization A = Uaq*D*U or A = L*D*Laq computed by ZPTTRF
 zpbcon (l)  estimates the reciprocal of the condition number (in the 1norm) of a complex Hermitian positive definite band matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by ZPBTRF