94 lines
		
	
	
		
			1.9 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			94 lines
		
	
	
		
			1.9 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /* isamax.f -- translated by f2c (version 20061008).
 | |
|    You must link the resulting object file with libf2c:
 | |
| 	on Microsoft Windows system, link with libf2c.lib;
 | |
| 	on Linux or Unix systems, link with .../path/to/libf2c.a -lm
 | |
| 	or, if you install libf2c.a in a standard place, with -lf2c -lm
 | |
| 	-- in that order, at the end of the command line, as in
 | |
| 		cc *.o -lf2c -lm
 | |
| 	Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
 | |
| 
 | |
| 		http://www.netlib.org/f2c/libf2c.zip
 | |
| */
 | |
| 
 | |
| #include "clapack.h"
 | |
| 
 | |
| 
 | |
| integer isamax_(integer *n, real *sx, integer *incx)
 | |
| {
 | |
|     /* System generated locals */
 | |
|     integer ret_val, i__1;
 | |
|     real r__1;
 | |
| 
 | |
|     /* Local variables */
 | |
|     integer i__, ix;
 | |
|     real smax;
 | |
| 
 | |
| /*     .. Scalar Arguments .. */
 | |
| /*     .. */
 | |
| /*     .. Array Arguments .. */
 | |
| /*     .. */
 | |
| 
 | |
| /*  Purpose */
 | |
| /*  ======= */
 | |
| 
 | |
| /*     finds the index of element having max. absolute value. */
 | |
| /*     jack dongarra, linpack, 3/11/78. */
 | |
| /*     modified 3/93 to return if incx .le. 0. */
 | |
| /*     modified 12/3/93, array(1) declarations changed to array(*) */
 | |
| 
 | |
| 
 | |
| /*     .. Local Scalars .. */
 | |
| /*     .. */
 | |
| /*     .. Intrinsic Functions .. */
 | |
| /*     .. */
 | |
|     /* Parameter adjustments */
 | |
|     --sx;
 | |
| 
 | |
|     /* Function Body */
 | |
|     ret_val = 0;
 | |
|     if (*n < 1 || *incx <= 0) {
 | |
| 	return ret_val;
 | |
|     }
 | |
|     ret_val = 1;
 | |
|     if (*n == 1) {
 | |
| 	return ret_val;
 | |
|     }
 | |
|     if (*incx == 1) {
 | |
| 	goto L20;
 | |
|     }
 | |
| 
 | |
| /*        code for increment not equal to 1 */
 | |
| 
 | |
|     ix = 1;
 | |
|     smax = dabs(sx[1]);
 | |
|     ix += *incx;
 | |
|     i__1 = *n;
 | |
|     for (i__ = 2; i__ <= i__1; ++i__) {
 | |
| 	if ((r__1 = sx[ix], dabs(r__1)) <= smax) {
 | |
| 	    goto L5;
 | |
| 	}
 | |
| 	ret_val = i__;
 | |
| 	smax = (r__1 = sx[ix], dabs(r__1));
 | |
| L5:
 | |
| 	ix += *incx;
 | |
| /* L10: */
 | |
|     }
 | |
|     return ret_val;
 | |
| 
 | |
| /*        code for increment equal to 1 */
 | |
| 
 | |
| L20:
 | |
|     smax = dabs(sx[1]);
 | |
|     i__1 = *n;
 | |
|     for (i__ = 2; i__ <= i__1; ++i__) {
 | |
| 	if ((r__1 = sx[i__], dabs(r__1)) <= smax) {
 | |
| 	    goto L30;
 | |
| 	}
 | |
| 	ret_val = i__;
 | |
| 	smax = (r__1 = sx[i__], dabs(r__1));
 | |
| L30:
 | |
| 	;
 | |
|     }
 | |
|     return ret_val;
 | |
| } /* isamax_ */
 | 
