version 1.1.1.1, 2010/01/26 15:22:46
|
version 1.11, 2012/08/22 09:48:39
|
Line 1
|
Line 1
|
|
*> \brief \b ZPOTRF |
|
* |
|
* =========== DOCUMENTATION =========== |
|
* |
|
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
|
* |
|
*> \htmlonly |
|
*> Download ZPOTRF + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zpotrf.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zpotrf.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zpotrf.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE ZPOTRF( UPLO, N, A, LDA, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER UPLO |
|
* INTEGER INFO, LDA, N |
|
* .. |
|
* .. Array Arguments .. |
|
* COMPLEX*16 A( LDA, * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> ZPOTRF computes the Cholesky factorization of a complex Hermitian |
|
*> positive definite matrix A. |
|
*> |
|
*> The factorization has the form |
|
*> A = U**H * U, if UPLO = 'U', or |
|
*> A = L * L**H, if UPLO = 'L', |
|
*> where U is an upper triangular matrix and L is lower triangular. |
|
*> |
|
*> This is the block version of the algorithm, calling Level 3 BLAS. |
|
*> \endverbatim |
|
* |
|
* Arguments: |
|
* ========== |
|
* |
|
*> \param[in] UPLO |
|
*> \verbatim |
|
*> UPLO is CHARACTER*1 |
|
*> = 'U': Upper triangle of A is stored; |
|
*> = 'L': Lower triangle of A is stored. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] N |
|
*> \verbatim |
|
*> N is INTEGER |
|
*> The order of the matrix A. N >= 0. |
|
*> \endverbatim |
|
*> |
|
*> \param[in,out] A |
|
*> \verbatim |
|
*> A is COMPLEX*16 array, dimension (LDA,N) |
|
*> On entry, the Hermitian matrix A. If UPLO = 'U', the leading |
|
*> N-by-N upper triangular part of A contains the upper |
|
*> triangular part of the matrix A, and the strictly lower |
|
*> triangular part of A is not referenced. If UPLO = 'L', the |
|
*> leading N-by-N lower triangular part of A contains the lower |
|
*> triangular part of the matrix A, and the strictly upper |
|
*> triangular part of A is not referenced. |
|
*> |
|
*> On exit, if INFO = 0, the factor U or L from the Cholesky |
|
*> factorization A = U**H *U or A = L*L**H. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDA |
|
*> \verbatim |
|
*> LDA is INTEGER |
|
*> The leading dimension of the array A. LDA >= max(1,N). |
|
*> \endverbatim |
|
*> |
|
*> \param[out] INFO |
|
*> \verbatim |
|
*> INFO is INTEGER |
|
*> = 0: successful exit |
|
*> < 0: if INFO = -i, the i-th argument had an illegal value |
|
*> > 0: if INFO = i, the leading minor of order i is not |
|
*> positive definite, and the factorization could not be |
|
*> completed. |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date November 2011 |
|
* |
|
*> \ingroup complex16POcomputational |
|
* |
|
* ===================================================================== |
SUBROUTINE ZPOTRF( UPLO, N, A, LDA, INFO ) |
SUBROUTINE ZPOTRF( UPLO, N, A, LDA, INFO ) |
* |
* |
* -- LAPACK routine (version 3.2) -- |
* -- LAPACK computational routine (version 3.4.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 2006 |
* November 2011 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER UPLO |
CHARACTER UPLO |
Line 13
|
Line 120
|
COMPLEX*16 A( LDA, * ) |
COMPLEX*16 A( LDA, * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* ZPOTRF computes the Cholesky factorization of a complex Hermitian |
|
* positive definite matrix A. |
|
* |
|
* The factorization has the form |
|
* A = U**H * U, if UPLO = 'U', or |
|
* A = L * L**H, if UPLO = 'L', |
|
* where U is an upper triangular matrix and L is lower triangular. |
|
* |
|
* This is the block version of the algorithm, calling Level 3 BLAS. |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* UPLO (input) CHARACTER*1 |
|
* = 'U': Upper triangle of A is stored; |
|
* = 'L': Lower triangle of A is stored. |
|
* |
|
* N (input) INTEGER |
|
* The order of the matrix A. N >= 0. |
|
* |
|
* A (input/output) COMPLEX*16 array, dimension (LDA,N) |
|
* On entry, the Hermitian matrix A. If UPLO = 'U', the leading |
|
* N-by-N upper triangular part of A contains the upper |
|
* triangular part of the matrix A, and the strictly lower |
|
* triangular part of A is not referenced. If UPLO = 'L', the |
|
* leading N-by-N lower triangular part of A contains the lower |
|
* triangular part of the matrix A, and the strictly upper |
|
* triangular part of A is not referenced. |
|
* |
|
* On exit, if INFO = 0, the factor U or L from the Cholesky |
|
* factorization A = U**H*U or A = L*L**H. |
|
* |
|
* LDA (input) INTEGER |
|
* The leading dimension of the array A. LDA >= max(1,N). |
|
* |
|
* INFO (output) INTEGER |
|
* = 0: successful exit |
|
* < 0: if INFO = -i, the i-th argument had an illegal value |
|
* > 0: if INFO = i, the leading minor of order i is not |
|
* positive definite, and the factorization could not be |
|
* completed. |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. Parameters .. |
* .. Parameters .. |
Line 117
|
Line 179
|
* |
* |
IF( UPPER ) THEN |
IF( UPPER ) THEN |
* |
* |
* Compute the Cholesky factorization A = U'*U. |
* Compute the Cholesky factorization A = U**H *U. |
* |
* |
DO 10 J = 1, N, NB |
DO 10 J = 1, N, NB |
* |
* |
Line 146
|
Line 208
|
* |
* |
ELSE |
ELSE |
* |
* |
* Compute the Cholesky factorization A = L*L'. |
* Compute the Cholesky factorization A = L*L**H. |
* |
* |
DO 20 J = 1, N, NB |
DO 20 J = 1, N, NB |
* |
* |