version 1.1.1.1, 2010/01/26 15:22:45
|
version 1.16, 2017/06/17 11:06:59
|
Line 1
|
Line 1
|
|
*> \brief <b> ZPOSV computes the solution to system of linear equations A * X = B for PO matrices</b> |
|
* |
|
* =========== DOCUMENTATION =========== |
|
* |
|
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
|
* |
|
*> \htmlonly |
|
*> Download ZPOSV + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zposv.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zposv.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zposv.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE ZPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER UPLO |
|
* INTEGER INFO, LDA, LDB, N, NRHS |
|
* .. |
|
* .. Array Arguments .. |
|
* COMPLEX*16 A( LDA, * ), B( LDB, * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> ZPOSV computes the solution to a complex system of linear equations |
|
*> A * X = B, |
|
*> where A is an N-by-N Hermitian positive definite matrix and X and B |
|
*> are N-by-NRHS matrices. |
|
*> |
|
*> The Cholesky decomposition is used to factor A as |
|
*> 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 a lower triangular |
|
*> matrix. The factored form of A is then used to solve the system of |
|
*> equations A * X = B. |
|
*> \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 number of linear equations, i.e., the order of the |
|
*> matrix A. N >= 0. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] NRHS |
|
*> \verbatim |
|
*> NRHS is INTEGER |
|
*> The number of right hand sides, i.e., the number of columns |
|
*> of the matrix B. NRHS >= 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[in,out] B |
|
*> \verbatim |
|
*> B is COMPLEX*16 array, dimension (LDB,NRHS) |
|
*> On entry, the N-by-NRHS right hand side matrix B. |
|
*> On exit, if INFO = 0, the N-by-NRHS solution matrix X. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] LDB |
|
*> \verbatim |
|
*> LDB is INTEGER |
|
*> The leading dimension of the array B. LDB >= 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 of A is not |
|
*> positive definite, so the factorization could not be |
|
*> completed, and the solution has not been computed. |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date December 2016 |
|
* |
|
*> \ingroup complex16POsolve |
|
* |
|
* ===================================================================== |
SUBROUTINE ZPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) |
SUBROUTINE ZPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO ) |
* |
* |
* -- LAPACK driver routine (version 3.2) -- |
* -- LAPACK driver routine (version 3.7.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 |
* December 2016 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER UPLO |
CHARACTER UPLO |
Line 13
|
Line 143
|
COMPLEX*16 A( LDA, * ), B( LDB, * ) |
COMPLEX*16 A( LDA, * ), B( LDB, * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* ZPOSV computes the solution to a complex system of linear equations |
|
* A * X = B, |
|
* where A is an N-by-N Hermitian positive definite matrix and X and B |
|
* are N-by-NRHS matrices. |
|
* |
|
* The Cholesky decomposition is used to factor A as |
|
* 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 a lower triangular |
|
* matrix. The factored form of A is then used to solve the system of |
|
* equations A * X = B. |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* UPLO (input) CHARACTER*1 |
|
* = 'U': Upper triangle of A is stored; |
|
* = 'L': Lower triangle of A is stored. |
|
* |
|
* N (input) INTEGER |
|
* The number of linear equations, i.e., the order of the |
|
* matrix A. N >= 0. |
|
* |
|
* NRHS (input) INTEGER |
|
* The number of right hand sides, i.e., the number of columns |
|
* of the matrix B. NRHS >= 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). |
|
* |
|
* B (input/output) COMPLEX*16 array, dimension (LDB,NRHS) |
|
* On entry, the N-by-NRHS right hand side matrix B. |
|
* On exit, if INFO = 0, the N-by-NRHS solution matrix X. |
|
* |
|
* LDB (input) INTEGER |
|
* The leading dimension of the array B. LDB >= 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 of A is not |
|
* positive definite, so the factorization could not be |
|
* completed, and the solution has not been computed. |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. External Functions .. |
* .. External Functions .. |
Line 105
|
Line 176
|
RETURN |
RETURN |
END IF |
END IF |
* |
* |
* Compute the Cholesky factorization A = U'*U or A = L*L'. |
* Compute the Cholesky factorization A = U**H *U or A = L*L**H. |
* |
* |
CALL ZPOTRF( UPLO, N, A, LDA, INFO ) |
CALL ZPOTRF( UPLO, N, A, LDA, INFO ) |
IF( INFO.EQ.0 ) THEN |
IF( INFO.EQ.0 ) THEN |