version 1.5, 2010/08/07 13:22:42
|
version 1.8, 2011/07/22 07:38:18
|
Line 1
|
Line 1
|
SUBROUTINE ZLAUUM( UPLO, N, A, LDA, INFO ) |
SUBROUTINE ZLAUUM( UPLO, N, A, LDA, INFO ) |
* |
* |
* -- LAPACK auxiliary routine (version 3.2) -- |
* -- LAPACK auxiliary routine (version 3.3.1) -- |
* -- 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 2006 |
* -- April 2011 -- |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER UPLO |
CHARACTER UPLO |
Line 16
|
Line 16
|
* Purpose |
* Purpose |
* ======= |
* ======= |
* |
* |
* ZLAUUM computes the product U * U' or L' * L, where the triangular |
* ZLAUUM computes the product U * U**H or L**H * L, where the triangular |
* factor U or L is stored in the upper or lower triangular part of |
* factor U or L is stored in the upper or lower triangular part of |
* the array A. |
* the array A. |
* |
* |
Line 42
|
Line 42
|
* A (input/output) COMPLEX*16 array, dimension (LDA,N) |
* A (input/output) COMPLEX*16 array, dimension (LDA,N) |
* On entry, the triangular factor U or L. |
* On entry, the triangular factor U or L. |
* On exit, if UPLO = 'U', the upper triangle of A is |
* On exit, if UPLO = 'U', the upper triangle of A is |
* overwritten with the upper triangle of the product U * U'; |
* overwritten with the upper triangle of the product U * U**H; |
* if UPLO = 'L', the lower triangle of A is overwritten with |
* if UPLO = 'L', the lower triangle of A is overwritten with |
* the lower triangle of the product L' * L. |
* the lower triangle of the product L**H * L. |
* |
* |
* LDA (input) INTEGER |
* LDA (input) INTEGER |
* The leading dimension of the array A. LDA >= max(1,N). |
* The leading dimension of the array A. LDA >= max(1,N). |
Line 114
|
Line 114
|
* |
* |
IF( UPPER ) THEN |
IF( UPPER ) THEN |
* |
* |
* Compute the product U * U'. |
* Compute the product U * U**H. |
* |
* |
DO 10 I = 1, N, NB |
DO 10 I = 1, N, NB |
IB = MIN( NB, N-I+1 ) |
IB = MIN( NB, N-I+1 ) |
Line 134
|
Line 134
|
10 CONTINUE |
10 CONTINUE |
ELSE |
ELSE |
* |
* |
* Compute the product L' * L. |
* Compute the product L**H * L. |
* |
* |
DO 20 I = 1, N, NB |
DO 20 I = 1, N, NB |
IB = MIN( NB, N-I+1 ) |
IB = MIN( NB, N-I+1 ) |