version 1.11, 2011/11/21 22:19:44
|
version 1.22, 2023/08/07 08:39:15
|
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 ZCGESV + dependencies |
*> Download ZCGESV + dependencies |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zcgesv.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zcgesv.f"> |
*> [TGZ]</a> |
*> [TGZ]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zcgesv.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zcgesv.f"> |
*> [ZIP]</a> |
*> [ZIP]</a> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zcgesv.f"> |
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zcgesv.f"> |
*> [TXT]</a> |
*> [TXT]</a> |
*> \endhtmlonly |
*> \endhtmlonly |
* |
* |
* Definition: |
* Definition: |
* =========== |
* =========== |
* |
* |
* SUBROUTINE ZCGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK, |
* SUBROUTINE ZCGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK, |
* SWORK, RWORK, ITER, INFO ) |
* SWORK, RWORK, ITER, INFO ) |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
* INTEGER INFO, ITER, LDA, LDB, LDX, N, NRHS |
* INTEGER INFO, ITER, LDA, LDB, LDX, N, NRHS |
* .. |
* .. |
Line 31
|
Line 31
|
* COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( N, * ), |
* COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( N, * ), |
* $ X( LDX, * ) |
* $ X( LDX, * ) |
* .. |
* .. |
* |
* |
* |
* |
*> \par Purpose: |
*> \par Purpose: |
* ============= |
* ============= |
Line 93
|
Line 93
|
*> dimension (LDA,N) |
*> dimension (LDA,N) |
*> On entry, the N-by-N coefficient matrix A. |
*> On entry, the N-by-N coefficient matrix A. |
*> On exit, if iterative refinement has been successfully used |
*> On exit, if iterative refinement has been successfully used |
*> (INFO.EQ.0 and ITER.GE.0, see description below), then A is |
*> (INFO = 0 and ITER >= 0, see description below), then A is |
*> unchanged, if double precision factorization has been used |
*> unchanged, if double precision factorization has been used |
*> (INFO.EQ.0 and ITER.LT.0, see description below), then the |
*> (INFO = 0 and ITER < 0, see description below), then the |
*> array A contains the factors L and U from the factorization |
*> array A contains the factors L and U from the factorization |
*> A = P*L*U; the unit diagonal elements of L are not stored. |
*> A = P*L*U; the unit diagonal elements of L are not stored. |
*> \endverbatim |
*> \endverbatim |
Line 112
|
Line 112
|
*> The pivot indices that define the permutation matrix P; |
*> The pivot indices that define the permutation matrix P; |
*> row i of the matrix was interchanged with row IPIV(i). |
*> row i of the matrix was interchanged with row IPIV(i). |
*> Corresponds either to the single precision factorization |
*> Corresponds either to the single precision factorization |
*> (if INFO.EQ.0 and ITER.GE.0) or the double precision |
*> (if INFO = 0 and ITER >= 0) or the double precision |
*> factorization (if INFO.EQ.0 and ITER.LT.0). |
*> factorization (if INFO = 0 and ITER < 0). |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in] B |
*> \param[in] B |
Line 142
|
Line 142
|
*> |
*> |
*> \param[out] WORK |
*> \param[out] WORK |
*> \verbatim |
*> \verbatim |
*> WORK is COMPLEX*16 array, dimension (N*NRHS) |
*> WORK is COMPLEX*16 array, dimension (N,NRHS) |
*> This array is used to hold the residual vectors. |
*> This array is used to hold the residual vectors. |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
Line 170
|
Line 170
|
*> -3 : failure of CGETRF |
*> -3 : failure of CGETRF |
*> -31: stop the iterative refinement after the 30th |
*> -31: stop the iterative refinement after the 30th |
*> iterations |
*> iterations |
*> > 0: iterative refinement has been sucessfully used. |
*> > 0: iterative refinement has been successfully used. |
*> Returns the number of iterations |
*> Returns the number of iterations |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
Line 188
|
Line 188
|
* 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 |
|
* |
* |
*> \ingroup complex16GEsolve |
*> \ingroup complex16GEsolve |
* |
* |
Line 201
|
Line 199
|
SUBROUTINE ZCGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK, |
SUBROUTINE ZCGESV( N, NRHS, A, LDA, IPIV, B, LDB, X, LDX, WORK, |
$ SWORK, RWORK, ITER, INFO ) |
$ SWORK, RWORK, ITER, INFO ) |
* |
* |
* -- LAPACK driver routine (version 3.4.0) -- |
* -- LAPACK driver 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 2011 |
|
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, ITER, LDA, LDB, LDX, N, NRHS |
INTEGER INFO, ITER, LDA, LDB, LDX, N, NRHS |
Line 240
|
Line 237
|
* |
* |
* .. External Subroutines .. |
* .. External Subroutines .. |
EXTERNAL CGETRS, CGETRF, CLAG2Z, XERBLA, ZAXPY, ZGEMM, |
EXTERNAL CGETRS, CGETRF, CLAG2Z, XERBLA, ZAXPY, ZGEMM, |
$ ZLACPY, ZLAG2C |
$ ZLACPY, ZLAG2C, ZGETRF, ZGETRS |
* .. |
* .. |
* .. External Functions .. |
* .. External Functions .. |
INTEGER IZAMAX |
INTEGER IZAMAX |
Line 421
|
Line 418
|
30 CONTINUE |
30 CONTINUE |
* |
* |
* If we are at this place of the code, this is because we have |
* If we are at this place of the code, this is because we have |
* performed ITER=ITERMAX iterations and never satisified the stopping |
* performed ITER=ITERMAX iterations and never satisfied the stopping |
* criterion, set up the ITER flag accordingly and follow up on double |
* criterion, set up the ITER flag accordingly and follow up on double |
* precision routine. |
* precision routine. |
* |
* |
Line 443
|
Line 440
|
* |
* |
RETURN |
RETURN |
* |
* |
* End of ZCGESV. |
* End of ZCGESV |
* |
* |
END |
END |