|
5164
|
1 SUBROUTINE ZPTTRF( N, D, E, INFO ) |
|
|
2 * |
|
7034
|
3 * -- LAPACK routine (version 3.1) -- |
|
|
4 * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. |
|
|
5 * November 2006 |
|
5164
|
6 * |
|
|
7 * .. Scalar Arguments .. |
|
|
8 INTEGER INFO, N |
|
|
9 * .. |
|
|
10 * .. Array Arguments .. |
|
|
11 DOUBLE PRECISION D( * ) |
|
|
12 COMPLEX*16 E( * ) |
|
|
13 * .. |
|
|
14 * |
|
|
15 * Purpose |
|
|
16 * ======= |
|
|
17 * |
|
|
18 * ZPTTRF computes the L*D*L' factorization of a complex Hermitian |
|
|
19 * positive definite tridiagonal matrix A. The factorization may also |
|
|
20 * be regarded as having the form A = U'*D*U. |
|
|
21 * |
|
|
22 * Arguments |
|
|
23 * ========= |
|
|
24 * |
|
|
25 * N (input) INTEGER |
|
|
26 * The order of the matrix A. N >= 0. |
|
|
27 * |
|
|
28 * D (input/output) DOUBLE PRECISION array, dimension (N) |
|
|
29 * On entry, the n diagonal elements of the tridiagonal matrix |
|
|
30 * A. On exit, the n diagonal elements of the diagonal matrix |
|
|
31 * D from the L*D*L' factorization of A. |
|
|
32 * |
|
|
33 * E (input/output) COMPLEX*16 array, dimension (N-1) |
|
|
34 * On entry, the (n-1) subdiagonal elements of the tridiagonal |
|
|
35 * matrix A. On exit, the (n-1) subdiagonal elements of the |
|
|
36 * unit bidiagonal factor L from the L*D*L' factorization of A. |
|
|
37 * E can also be regarded as the superdiagonal of the unit |
|
|
38 * bidiagonal factor U from the U'*D*U factorization of A. |
|
|
39 * |
|
|
40 * INFO (output) INTEGER |
|
|
41 * = 0: successful exit |
|
|
42 * < 0: if INFO = -k, the k-th argument had an illegal value |
|
|
43 * > 0: if INFO = k, the leading minor of order k is not |
|
|
44 * positive definite; if k < N, the factorization could not |
|
|
45 * be completed, while if k = N, the factorization was |
|
7034
|
46 * completed, but D(N) <= 0. |
|
5164
|
47 * |
|
|
48 * ===================================================================== |
|
|
49 * |
|
|
50 * .. Parameters .. |
|
|
51 DOUBLE PRECISION ZERO |
|
|
52 PARAMETER ( ZERO = 0.0D+0 ) |
|
|
53 * .. |
|
|
54 * .. Local Scalars .. |
|
|
55 INTEGER I, I4 |
|
|
56 DOUBLE PRECISION EII, EIR, F, G |
|
|
57 * .. |
|
|
58 * .. External Subroutines .. |
|
|
59 EXTERNAL XERBLA |
|
|
60 * .. |
|
|
61 * .. Intrinsic Functions .. |
|
|
62 INTRINSIC DBLE, DCMPLX, DIMAG, MOD |
|
|
63 * .. |
|
|
64 * .. Executable Statements .. |
|
|
65 * |
|
|
66 * Test the input parameters. |
|
|
67 * |
|
|
68 INFO = 0 |
|
|
69 IF( N.LT.0 ) THEN |
|
|
70 INFO = -1 |
|
|
71 CALL XERBLA( 'ZPTTRF', -INFO ) |
|
|
72 RETURN |
|
|
73 END IF |
|
|
74 * |
|
|
75 * Quick return if possible |
|
|
76 * |
|
|
77 IF( N.EQ.0 ) |
|
|
78 $ RETURN |
|
|
79 * |
|
|
80 * Compute the L*D*L' (or U'*D*U) factorization of A. |
|
|
81 * |
|
|
82 I4 = MOD( N-1, 4 ) |
|
|
83 DO 10 I = 1, I4 |
|
|
84 IF( D( I ).LE.ZERO ) THEN |
|
|
85 INFO = I |
|
|
86 GO TO 30 |
|
|
87 END IF |
|
|
88 EIR = DBLE( E( I ) ) |
|
|
89 EII = DIMAG( E( I ) ) |
|
|
90 F = EIR / D( I ) |
|
|
91 G = EII / D( I ) |
|
|
92 E( I ) = DCMPLX( F, G ) |
|
|
93 D( I+1 ) = D( I+1 ) - F*EIR - G*EII |
|
|
94 10 CONTINUE |
|
|
95 * |
|
|
96 DO 20 I = I4 + 1, N - 4, 4 |
|
|
97 * |
|
|
98 * Drop out of the loop if d(i) <= 0: the matrix is not positive |
|
|
99 * definite. |
|
|
100 * |
|
|
101 IF( D( I ).LE.ZERO ) THEN |
|
|
102 INFO = I |
|
|
103 GO TO 30 |
|
|
104 END IF |
|
|
105 * |
|
|
106 * Solve for e(i) and d(i+1). |
|
|
107 * |
|
|
108 EIR = DBLE( E( I ) ) |
|
|
109 EII = DIMAG( E( I ) ) |
|
|
110 F = EIR / D( I ) |
|
|
111 G = EII / D( I ) |
|
|
112 E( I ) = DCMPLX( F, G ) |
|
|
113 D( I+1 ) = D( I+1 ) - F*EIR - G*EII |
|
|
114 * |
|
|
115 IF( D( I+1 ).LE.ZERO ) THEN |
|
|
116 INFO = I + 1 |
|
|
117 GO TO 30 |
|
|
118 END IF |
|
|
119 * |
|
|
120 * Solve for e(i+1) and d(i+2). |
|
|
121 * |
|
|
122 EIR = DBLE( E( I+1 ) ) |
|
|
123 EII = DIMAG( E( I+1 ) ) |
|
|
124 F = EIR / D( I+1 ) |
|
|
125 G = EII / D( I+1 ) |
|
|
126 E( I+1 ) = DCMPLX( F, G ) |
|
|
127 D( I+2 ) = D( I+2 ) - F*EIR - G*EII |
|
|
128 * |
|
|
129 IF( D( I+2 ).LE.ZERO ) THEN |
|
|
130 INFO = I + 2 |
|
|
131 GO TO 30 |
|
|
132 END IF |
|
|
133 * |
|
|
134 * Solve for e(i+2) and d(i+3). |
|
|
135 * |
|
|
136 EIR = DBLE( E( I+2 ) ) |
|
|
137 EII = DIMAG( E( I+2 ) ) |
|
|
138 F = EIR / D( I+2 ) |
|
|
139 G = EII / D( I+2 ) |
|
|
140 E( I+2 ) = DCMPLX( F, G ) |
|
|
141 D( I+3 ) = D( I+3 ) - F*EIR - G*EII |
|
|
142 * |
|
|
143 IF( D( I+3 ).LE.ZERO ) THEN |
|
|
144 INFO = I + 3 |
|
|
145 GO TO 30 |
|
|
146 END IF |
|
|
147 * |
|
|
148 * Solve for e(i+3) and d(i+4). |
|
|
149 * |
|
|
150 EIR = DBLE( E( I+3 ) ) |
|
|
151 EII = DIMAG( E( I+3 ) ) |
|
|
152 F = EIR / D( I+3 ) |
|
|
153 G = EII / D( I+3 ) |
|
|
154 E( I+3 ) = DCMPLX( F, G ) |
|
|
155 D( I+4 ) = D( I+4 ) - F*EIR - G*EII |
|
|
156 20 CONTINUE |
|
|
157 * |
|
|
158 * Check d(n) for positive definiteness. |
|
|
159 * |
|
|
160 IF( D( N ).LE.ZERO ) |
|
|
161 $ INFO = N |
|
|
162 * |
|
|
163 30 CONTINUE |
|
|
164 RETURN |
|
|
165 * |
|
|
166 * End of ZPTTRF |
|
|
167 * |
|
|
168 END |
