version 1.4, 2018/05/29 07:18:36
|
version 1.6, 2023/08/07 08:39:38
|
Line 38
|
Line 38
|
*> ZSYCONVF converts the factorization output format used in |
*> ZSYCONVF converts the factorization output format used in |
*> ZSYTRF provided on entry in parameter A into the factorization |
*> ZSYTRF provided on entry in parameter A into the factorization |
*> output format used in ZSYTRF_RK (or ZSYTRF_BK) that is stored |
*> output format used in ZSYTRF_RK (or ZSYTRF_BK) that is stored |
*> on exit in parameters A and E. It also coverts in place details of |
*> on exit in parameters A and E. It also converts in place details of |
*> the intechanges stored in IPIV from the format used in ZSYTRF into |
*> the intechanges stored in IPIV from the format used in ZSYTRF into |
*> the format used in ZSYTRF_RK (or ZSYTRF_BK). |
*> the format used in ZSYTRF_RK (or ZSYTRF_BK). |
*> |
*> |
Line 47
|
Line 47
|
*> converts the factorization output format used in ZSYTRF_RK |
*> converts the factorization output format used in ZSYTRF_RK |
*> (or ZSYTRF_BK) provided on entry in parameters A and E into |
*> (or ZSYTRF_BK) provided on entry in parameters A and E into |
*> the factorization output format used in ZSYTRF that is stored |
*> the factorization output format used in ZSYTRF that is stored |
*> on exit in parameter A. It also coverts in place details of |
*> on exit in parameter A. It also converts in place details of |
*> the intechanges stored in IPIV from the format used in ZSYTRF_RK |
*> the intechanges stored in IPIV from the format used in ZSYTRF_RK |
*> (or ZSYTRF_BK) into the format used in ZSYTRF. |
*> (or ZSYTRF_BK) into the format used in ZSYTRF. |
*> |
*> |
Line 192
|
Line 192
|
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
* |
*> \date November 2017 |
|
* |
|
*> \ingroup complex16SYcomputational |
*> \ingroup complex16SYcomputational |
* |
* |
*> \par Contributors: |
*> \par Contributors: |
Line 209
|
Line 207
|
* ===================================================================== |
* ===================================================================== |
SUBROUTINE ZSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) |
SUBROUTINE ZSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.8.0) -- |
* -- LAPACK computational 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..-- |
* November 2017 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER UPLO, WAY |
CHARACTER UPLO, WAY |
Line 294
|
Line 291
|
* |
* |
* Convert PERMUTATIONS and IPIV |
* Convert PERMUTATIONS and IPIV |
* |
* |
* Apply permutaions to submatrices of upper part of A |
* Apply permutations to submatrices of upper part of A |
* in factorization order where i decreases from N to 1 |
* in factorization order where i decreases from N to 1 |
* |
* |
I = N |
I = N |
Line 347
|
Line 344
|
* |
* |
* Revert PERMUTATIONS and IPIV |
* Revert PERMUTATIONS and IPIV |
* |
* |
* Apply permutaions to submatrices of upper part of A |
* Apply permutations to submatrices of upper part of A |
* in reverse factorization order where i increases from 1 to N |
* in reverse factorization order where i increases from 1 to N |
* |
* |
I = 1 |
I = 1 |
Line 438
|
Line 435
|
* |
* |
* Convert PERMUTATIONS and IPIV |
* Convert PERMUTATIONS and IPIV |
* |
* |
* Apply permutaions to submatrices of lower part of A |
* Apply permutations to submatrices of lower part of A |
* in factorization order where k increases from 1 to N |
* in factorization order where k increases from 1 to N |
* |
* |
I = 1 |
I = 1 |
Line 491
|
Line 488
|
* |
* |
* Revert PERMUTATIONS and IPIV |
* Revert PERMUTATIONS and IPIV |
* |
* |
* Apply permutaions to submatrices of lower part of A |
* Apply permutations to submatrices of lower part of A |
* in reverse factorization order where i decreases from N to 1 |
* in reverse factorization order where i decreases from N to 1 |
* |
* |
I = N |
I = N |