version 1.7, 2011/11/21 20:42:56
|
version 1.15, 2017/06/17 10:53:54
|
Line 1
|
Line 1
|
*> \brief \b DLANSF |
*> \brief \b DLANSF returns the value of the 1-norm, or the Frobenius norm, or the infinity norm, or the element of largest absolute value of a symmetric matrix in RFP format. |
* |
* |
* =========== DOCUMENTATION =========== |
* =========== DOCUMENTATION =========== |
* |
* |
* Online html documentation available at |
* Online html documentation available at |
* http://www.netlib.org/lapack/explore-html/ |
* http://www.netlib.org/lapack/explore-html/ |
* |
* |
*> \htmlonly |
*> \htmlonly |
*> Download DLANSF + dependencies |
*> Download DLANSF + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlansf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlansf.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlansf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlansf.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlansf.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlansf.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK ) |
* DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* CHARACTER NORM, TRANSR, UPLO |
* CHARACTER NORM, TRANSR, UPLO |
* INTEGER N |
* INTEGER N |
Line 27
|
Line 27
|
* .. Array Arguments .. |
* .. Array Arguments .. |
* DOUBLE PRECISION A( 0: * ), WORK( 0: * ) |
* DOUBLE PRECISION A( 0: * ), WORK( 0: * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 110
|
Line 110
|
* Authors: |
* Authors: |
* ======== |
* ======== |
* |
* |
*> \author Univ. of Tennessee |
*> \author Univ. of Tennessee |
*> \author Univ. of California Berkeley |
*> \author Univ. of California Berkeley |
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
* |
*> \date November 2011 |
*> \date December 2016 |
* |
* |
*> \ingroup doubleOTHERcomputational |
*> \ingroup doubleOTHERcomputational |
* |
* |
Line 209
|
Line 209
|
* ===================================================================== |
* ===================================================================== |
DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK ) |
DOUBLE PRECISION FUNCTION DLANSF( NORM, TRANSR, UPLO, N, A, WORK ) |
* |
* |
* -- LAPACK computational routine (version 3.4.0) -- |
* -- LAPACK computational routine (version 3.7.0) -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- LAPACK is a software package provided by Univ. of Tennessee, -- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- |
* November 2011 |
* December 2016 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER NORM, TRANSR, UPLO |
CHARACTER NORM, TRANSR, UPLO |
Line 230
|
Line 230
|
* .. |
* .. |
* .. Local Scalars .. |
* .. Local Scalars .. |
INTEGER I, J, IFM, ILU, NOE, N1, K, L, LDA |
INTEGER I, J, IFM, ILU, NOE, N1, K, L, LDA |
DOUBLE PRECISION SCALE, S, VALUE, AA |
DOUBLE PRECISION SCALE, S, VALUE, AA, TEMP |
* .. |
* .. |
* .. External Functions .. |
* .. External Functions .. |
LOGICAL LSAME |
LOGICAL LSAME, DISNAN |
INTEGER IDAMAX |
EXTERNAL LSAME, DISNAN |
EXTERNAL LSAME, IDAMAX |
|
* .. |
* .. |
* .. External Subroutines .. |
* .. External Subroutines .. |
EXTERNAL DLASSQ |
EXTERNAL DLASSQ |
Line 248
|
Line 247
|
IF( N.EQ.0 ) THEN |
IF( N.EQ.0 ) THEN |
DLANSF = ZERO |
DLANSF = ZERO |
RETURN |
RETURN |
|
ELSE IF( N.EQ.1 ) THEN |
|
DLANSF = ABS( A(0) ) |
|
RETURN |
END IF |
END IF |
* |
* |
* set noe = 1 if n is odd. if n is even set noe=0 |
* set noe = 1 if n is odd. if n is even set noe=0 |
Line 296
|
Line 298
|
* A is n by k |
* A is n by k |
DO J = 0, K - 1 |
DO J = 0, K - 1 |
DO I = 0, N - 1 |
DO I = 0, N - 1 |
VALUE = MAX( VALUE, ABS( A( I+J*LDA ) ) ) |
TEMP = ABS( A( I+J*LDA ) ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
END DO |
END DO |
END DO |
END DO |
ELSE |
ELSE |
* xpose case; A is k by n |
* xpose case; A is k by n |
DO J = 0, N - 1 |
DO J = 0, N - 1 |
DO I = 0, K - 1 |
DO I = 0, K - 1 |
VALUE = MAX( VALUE, ABS( A( I+J*LDA ) ) ) |
TEMP = ABS( A( I+J*LDA ) ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
END DO |
END DO |
END DO |
END DO |
END IF |
END IF |
Line 313
|
Line 319
|
* A is n+1 by k |
* A is n+1 by k |
DO J = 0, K - 1 |
DO J = 0, K - 1 |
DO I = 0, N |
DO I = 0, N |
VALUE = MAX( VALUE, ABS( A( I+J*LDA ) ) ) |
TEMP = ABS( A( I+J*LDA ) ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
END DO |
END DO |
END DO |
END DO |
ELSE |
ELSE |
* xpose case; A is k by n+1 |
* xpose case; A is k by n+1 |
DO J = 0, N |
DO J = 0, N |
DO I = 0, K - 1 |
DO I = 0, K - 1 |
VALUE = MAX( VALUE, ABS( A( I+J*LDA ) ) ) |
TEMP = ABS( A( I+J*LDA ) ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
END DO |
END DO |
END DO |
END DO |
END IF |
END IF |
Line 366
|
Line 376
|
WORK( J ) = WORK( J ) + S |
WORK( J ) = WORK( J ) + S |
END DO |
END DO |
10 CONTINUE |
10 CONTINUE |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
ELSE |
ELSE |
* ilu = 1 |
* ilu = 1 |
K = K + 1 |
K = K + 1 |
Line 404
|
Line 418
|
END DO |
END DO |
WORK( J ) = WORK( J ) + S |
WORK( J ) = WORK( J ) + S |
END DO |
END DO |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
END IF |
END IF |
ELSE |
ELSE |
* n is even |
* n is even |
Line 438
|
Line 456
|
END DO |
END DO |
WORK( J ) = WORK( J ) + S |
WORK( J ) = WORK( J ) + S |
END DO |
END DO |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
ELSE |
ELSE |
* ilu = 1 |
* ilu = 1 |
DO I = K, N - 1 |
DO I = K, N - 1 |
Line 472
|
Line 494
|
END DO |
END DO |
WORK( J ) = WORK( J ) + S |
WORK( J ) = WORK( J ) + S |
END DO |
END DO |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
END IF |
END IF |
END IF |
END IF |
ELSE |
ELSE |
Line 534
|
Line 560
|
END DO |
END DO |
WORK( J ) = WORK( J ) + S |
WORK( J ) = WORK( J ) + S |
END DO |
END DO |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
ELSE |
ELSE |
* ilu=1 |
* ilu=1 |
K = K + 1 |
K = K + 1 |
Line 595
|
Line 625
|
END DO |
END DO |
WORK( J ) = WORK( J ) + S |
WORK( J ) = WORK( J ) + S |
END DO |
END DO |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
END IF |
END IF |
ELSE |
ELSE |
* n is even |
* n is even |
Line 664
|
Line 698
|
* A(k-1,k-1) |
* A(k-1,k-1) |
S = S + AA |
S = S + AA |
WORK( I ) = WORK( I ) + S |
WORK( I ) = WORK( I ) + S |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
ELSE |
ELSE |
* ilu=1 |
* ilu=1 |
DO I = K, N - 1 |
DO I = K, N - 1 |
Line 733
|
Line 771
|
END DO |
END DO |
WORK( J-1 ) = WORK( J-1 ) + S |
WORK( J-1 ) = WORK( J-1 ) + S |
END DO |
END DO |
I = IDAMAX( N, WORK, 1 ) |
VALUE = WORK( 0 ) |
VALUE = WORK( I-1 ) |
DO I = 1, N-1 |
|
TEMP = WORK( I ) |
|
IF( VALUE .LT. TEMP .OR. DISNAN( TEMP ) ) |
|
$ VALUE = TEMP |
|
END DO |
END IF |
END IF |
END IF |
END IF |
END IF |
END IF |