version 1.15, 2014/01/27 09:28:23
|
version 1.20, 2023/08/07 08:39:00
|
Line 2
|
Line 2
|
* |
* |
* =========== 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 DLATRS + dependencies |
*> Download DLATRS + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlatrs.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dlatrs.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlatrs.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dlatrs.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlatrs.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dlatrs.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE DLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, |
* SUBROUTINE DLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, |
* CNORM, INFO ) |
* CNORM, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* CHARACTER DIAG, NORMIN, TRANS, UPLO |
* CHARACTER DIAG, NORMIN, TRANS, UPLO |
* INTEGER INFO, LDA, N |
* INTEGER INFO, LDA, N |
Line 29
|
Line 29
|
* .. Array Arguments .. |
* .. Array Arguments .. |
* DOUBLE PRECISION A( LDA, * ), CNORM( * ), X( * ) |
* DOUBLE PRECISION A( LDA, * ), CNORM( * ), X( * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 153
|
Line 153
|
* 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 September 2012 |
|
* |
* |
*> \ingroup doubleOTHERauxiliary |
*> \ingroup doubleOTHERauxiliary |
* |
* |
Line 238
|
Line 236
|
SUBROUTINE DLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, |
SUBROUTINE DLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, |
$ CNORM, INFO ) |
$ CNORM, INFO ) |
* |
* |
* -- LAPACK auxiliary routine (version 3.4.2) -- |
* -- LAPACK auxiliary routine -- |
* -- 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..-- |
* September 2012 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER DIAG, NORMIN, TRANS, UPLO |
CHARACTER DIAG, NORMIN, TRANS, UPLO |
Line 267
|
Line 264
|
* .. External Functions .. |
* .. External Functions .. |
LOGICAL LSAME |
LOGICAL LSAME |
INTEGER IDAMAX |
INTEGER IDAMAX |
DOUBLE PRECISION DASUM, DDOT, DLAMCH |
DOUBLE PRECISION DASUM, DDOT, DLAMCH, DLANGE |
EXTERNAL LSAME, IDAMAX, DASUM, DDOT, DLAMCH |
EXTERNAL LSAME, IDAMAX, DASUM, DDOT, DLAMCH, DLANGE |
* .. |
* .. |
* .. External Subroutines .. |
* .. External Subroutines .. |
EXTERNAL DAXPY, DSCAL, DTRSV, XERBLA |
EXTERNAL DAXPY, DSCAL, DTRSV, XERBLA |
Line 307
|
Line 304
|
* |
* |
* Quick return if possible |
* Quick return if possible |
* |
* |
|
SCALE = ONE |
IF( N.EQ.0 ) |
IF( N.EQ.0 ) |
$ RETURN |
$ RETURN |
* |
* |
Line 314
|
Line 312
|
* |
* |
SMLNUM = DLAMCH( 'Safe minimum' ) / DLAMCH( 'Precision' ) |
SMLNUM = DLAMCH( 'Safe minimum' ) / DLAMCH( 'Precision' ) |
BIGNUM = ONE / SMLNUM |
BIGNUM = ONE / SMLNUM |
SCALE = ONE |
|
* |
* |
IF( LSAME( NORMIN, 'N' ) ) THEN |
IF( LSAME( NORMIN, 'N' ) ) THEN |
* |
* |
Line 346
|
Line 343
|
IF( TMAX.LE.BIGNUM ) THEN |
IF( TMAX.LE.BIGNUM ) THEN |
TSCAL = ONE |
TSCAL = ONE |
ELSE |
ELSE |
TSCAL = ONE / ( SMLNUM*TMAX ) |
* |
CALL DSCAL( N, TSCAL, CNORM, 1 ) |
* Avoid NaN generation if entries in CNORM exceed the |
|
* overflow threshold |
|
* |
|
IF( TMAX.LE.DLAMCH('Overflow') ) THEN |
|
* Case 1: All entries in CNORM are valid floating-point numbers |
|
TSCAL = ONE / ( SMLNUM*TMAX ) |
|
CALL DSCAL( N, TSCAL, CNORM, 1 ) |
|
ELSE |
|
* Case 2: At least one column norm of A cannot be represented |
|
* as floating-point number. Find the offdiagonal entry A( I, J ) |
|
* with the largest absolute value. If this entry is not +/- Infinity, |
|
* use this value as TSCAL. |
|
TMAX = ZERO |
|
IF( UPPER ) THEN |
|
* |
|
* A is upper triangular. |
|
* |
|
DO J = 2, N |
|
TMAX = MAX( DLANGE( 'M', J-1, 1, A( 1, J ), 1, SUMJ ), |
|
$ TMAX ) |
|
END DO |
|
ELSE |
|
* |
|
* A is lower triangular. |
|
* |
|
DO J = 1, N - 1 |
|
TMAX = MAX( DLANGE( 'M', N-J, 1, A( J+1, J ), 1, |
|
$ SUMJ ), TMAX ) |
|
END DO |
|
END IF |
|
* |
|
IF( TMAX.LE.DLAMCH('Overflow') ) THEN |
|
TSCAL = ONE / ( SMLNUM*TMAX ) |
|
DO J = 1, N |
|
IF( CNORM( J ).LE.DLAMCH('Overflow') ) THEN |
|
CNORM( J ) = CNORM( J )*TSCAL |
|
ELSE |
|
* Recompute the 1-norm without introducing Infinity |
|
* in the summation |
|
CNORM( J ) = ZERO |
|
IF( UPPER ) THEN |
|
DO I = 1, J - 1 |
|
CNORM( J ) = CNORM( J ) + |
|
$ TSCAL * ABS( A( I, J ) ) |
|
END DO |
|
ELSE |
|
DO I = J + 1, N |
|
CNORM( J ) = CNORM( J ) + |
|
$ TSCAL * ABS( A( I, J ) ) |
|
END DO |
|
END IF |
|
END IF |
|
END DO |
|
ELSE |
|
* At least one entry of A is not a valid floating-point entry. |
|
* Rely on TRSV to propagate Inf and NaN. |
|
CALL DTRSV( UPLO, TRANS, DIAG, N, A, LDA, X, 1 ) |
|
RETURN |
|
END IF |
|
END IF |
END IF |
END IF |
* |
* |
* Compute a bound on the computed solution vector to see if the |
* Compute a bound on the computed solution vector to see if the |