1CPTTRF(1)                LAPACK routine (version 3.2)                CPTTRF(1)
2
3
4

NAME

6       CPTTRF - computes the L*D*L' factorization of a complex Hermitian posi‐
7       tive definite tridiagonal matrix A
8

SYNOPSIS

10       SUBROUTINE CPTTRF( N, D, E, INFO )
11
12           INTEGER        INFO, N
13
14           REAL           D( * )
15
16           COMPLEX        E( * )
17

PURPOSE

19       CPTTRF computes the L*D*L' factorization of a complex  Hermitian  posi‐
20       tive  definite  tridiagonal  matrix  A.   The factorization may also be
21       regarded as having the form A = U'*D*U.
22

ARGUMENTS

24       N       (input) INTEGER
25               The order of the matrix A.  N >= 0.
26
27       D       (input/output) REAL array, dimension (N)
28               On entry, the n diagonal elements of the tridiagonal matrix  A.
29               On  exit, the n diagonal elements of the diagonal matrix D from
30               the L*D*L' factorization of A.
31
32       E       (input/output) COMPLEX array, dimension (N-1)
33               On entry, the (n-1) subdiagonal  elements  of  the  tridiagonal
34               matrix  A.  On exit, the (n-1) subdiagonal elements of the unit
35               bidiagonal factor L from the L*D*L' factorization of A.  E  can
36               also  be  regarded  as the superdiagonal of the unit bidiagonal
37               factor U from the U'*D*U factorization of A.
38
39       INFO    (output) INTEGER
40               = 0: successful exit
41               < 0: if INFO = -k, the k-th argument had an illegal value
42               > 0: if INFO = k, the leading minor of order k is not  positive
43               definite;  if  k < N, the factorization could not be completed,
44               while if k = N, the factorization was completed, but D(N) <= 0.
45
46
47
48 LAPACK routine (version 3.2)    November 2008                       CPTTRF(1)
Impressum