4
izmax1_(int *n, doublecomplex *cx, int *incx)
6
/* -- LAPACK auxiliary routine (version 2.0) --
7
Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
8
Courant Institute, Argonne National Lab, and Rice University
15
IZMAX1 finds the index of the element whose real part has maximum
18
Based on IZAMAX from Level 1 BLAS.
19
The change is to use the 'genuine' absolute value.
21
Contributed by Nick Higham for use with ZLACON.
27
The number of elements in the vector CX.
29
CX (input) COMPLEX*16 array, dimension (N)
30
The vector whose elements will be summed.
33
The spacing between successive values of CX. INCX >= 1.
35
=====================================================================
38
/* System generated locals */
39
int ret_val, i__1, i__2;
46
#define CX(I) cx[(I)-1]
60
/* CODE FOR INCREMENT NOT EQUAL TO 1 */
63
smax = (d__1 = CX(1).r, abs(d__1));
66
for (i = 2; i <= *n; ++i) {
68
if ((d__1 = CX(ix).r, abs(d__1)) <= smax) {
73
smax = (d__1 = CX(ix).r, abs(d__1));
80
/* CODE FOR INCREMENT EQUAL TO 1 */
83
smax = (d__1 = CX(1).r, abs(d__1));
85
for (i = 2; i <= *n; ++i) {
87
if ((d__1 = CX(i).r, abs(d__1)) <= smax) {
92
smax = (d__1 = CX(i).r, abs(d__1));