comparison libcruft/lapack/zlacon.f @ 7034:68db500cb558

[project @ 2007-10-16 18:54:19 by jwe]
author jwe
date Tue, 16 Oct 2007 18:54:23 +0000
parents 15cddaacbc2d
children
comparison
equal deleted inserted replaced
7033:f0142f2afdc6 7034:68db500cb558
1 SUBROUTINE ZLACON( N, V, X, EST, KASE ) 1 SUBROUTINE ZLACON( N, V, X, EST, KASE )
2 * 2 *
3 * -- LAPACK auxiliary routine (version 3.0) -- 3 * -- LAPACK auxiliary routine (version 3.1) --
4 * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., 4 * Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
5 * Courant Institute, Argonne National Lab, and Rice University 5 * November 2006
6 * June 30, 1999
7 * 6 *
8 * .. Scalar Arguments .. 7 * .. Scalar Arguments ..
9 INTEGER KASE, N 8 INTEGER KASE, N
10 DOUBLE PRECISION EST 9 DOUBLE PRECISION EST
11 * .. 10 * ..
34 * A * X, if KASE=1, 33 * A * X, if KASE=1,
35 * A' * X, if KASE=2, 34 * A' * X, if KASE=2,
36 * where A' is the conjugate transpose of A, and ZLACON must be 35 * where A' is the conjugate transpose of A, and ZLACON must be
37 * re-called with all the other parameters unchanged. 36 * re-called with all the other parameters unchanged.
38 * 37 *
39 * EST (output) DOUBLE PRECISION 38 * EST (input/output) DOUBLE PRECISION
40 * An estimate (a lower bound) for norm(A). 39 * On entry with KASE = 1 or 2 and JUMP = 3, EST should be
40 * unchanged from the previous call to ZLACON.
41 * On exit, EST is an estimate (a lower bound) for norm(A).
41 * 42 *
42 * KASE (input/output) INTEGER 43 * KASE (input/output) INTEGER
43 * On the initial call to ZLACON, KASE should be 0. 44 * On the initial call to ZLACON, KASE should be 0.
44 * On an intermediate return, KASE will be 1 or 2, indicating 45 * On an intermediate return, KASE will be 1 or 2, indicating
45 * whether X should be overwritten by A * X or A' * X. 46 * whether X should be overwritten by A * X or A' * X.
124 KASE = 2 125 KASE = 2
125 JUMP = 2 126 JUMP = 2
126 RETURN 127 RETURN
127 * 128 *
128 * ................ ENTRY (JUMP = 2) 129 * ................ ENTRY (JUMP = 2)
129 * FIRST ITERATION. X HAS BEEN OVERWRITTEN BY ZTRANS(A)*X. 130 * FIRST ITERATION. X HAS BEEN OVERWRITTEN BY CTRANS(A)*X.
130 * 131 *
131 40 CONTINUE 132 40 CONTINUE
132 J = IZMAX1( N, X, 1 ) 133 J = IZMAX1( N, X, 1 )
133 ITER = 2 134 ITER = 2
134 * 135 *
167 KASE = 2 168 KASE = 2
168 JUMP = 4 169 JUMP = 4
169 RETURN 170 RETURN
170 * 171 *
171 * ................ ENTRY (JUMP = 4) 172 * ................ ENTRY (JUMP = 4)
172 * X HAS BEEN OVERWRITTEN BY ZTRANS(A)*X. 173 * X HAS BEEN OVERWRITTEN BY CTRANS(A)*X.
173 * 174 *
174 90 CONTINUE 175 90 CONTINUE
175 JLAST = J 176 JLAST = J
176 J = IZMAX1( N, X, 1 ) 177 J = IZMAX1( N, X, 1 )
177 IF( ( ABS( X( JLAST ) ).NE.ABS( X( J ) ) ) .AND. 178 IF( ( ABS( X( JLAST ) ).NE.ABS( X( J ) ) ) .AND.