version 1.4, 2010/12/21 13:48:06
|
version 1.11, 2014/01/27 09:28:43
|
Line 1
|
Line 1
|
SUBROUTINE ZTFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) |
*> \brief \b ZTFTRI |
|
* |
|
* =========== DOCUMENTATION =========== |
* |
* |
* -- LAPACK routine (version 3.3.0) -- |
* Online html documentation available at |
|
* http://www.netlib.org/lapack/explore-html/ |
* |
* |
* -- Contributed by Fred Gustavson of the IBM Watson Research Center -- |
*> \htmlonly |
* November 2010 |
*> Download ZTFTRI + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ztftri.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ztftri.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ztftri.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE ZTFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER TRANSR, UPLO, DIAG |
|
* INTEGER INFO, N |
|
* .. |
|
* .. Array Arguments .. |
|
* COMPLEX*16 A( 0: * ) |
|
* .. |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> ZTFTRI computes the inverse of a triangular matrix A stored in RFP |
|
*> format. |
|
*> |
|
*> This is a Level 3 BLAS version of the algorithm. |
|
*> \endverbatim |
|
* |
|
* Arguments: |
|
* ========== |
|
* |
|
*> \param[in] TRANSR |
|
*> \verbatim |
|
*> TRANSR is CHARACTER*1 |
|
*> = 'N': The Normal TRANSR of RFP A is stored; |
|
*> = 'C': The Conjugate-transpose TRANSR of RFP A is stored. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] UPLO |
|
*> \verbatim |
|
*> UPLO is CHARACTER*1 |
|
*> = 'U': A is upper triangular; |
|
*> = 'L': A is lower triangular. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] DIAG |
|
*> \verbatim |
|
*> DIAG is CHARACTER*1 |
|
*> = 'N': A is non-unit triangular; |
|
*> = 'U': A is unit triangular. |
|
*> \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 ( N*(N+1)/2 ); |
|
*> On entry, the triangular matrix A in RFP format. RFP format |
|
*> is described by TRANSR, UPLO, and N as follows: If TRANSR = |
|
*> 'N' then RFP A is (0:N,0:k-1) when N is even; k=N/2. RFP A is |
|
*> (0:N-1,0:k) when N is odd; k=N/2. IF TRANSR = 'C' then RFP is |
|
*> the Conjugate-transpose of RFP A as defined when |
|
*> TRANSR = 'N'. The contents of RFP A are defined by UPLO as |
|
*> follows: If UPLO = 'U' the RFP A contains the nt elements of |
|
*> upper packed A; If UPLO = 'L' the RFP A contains the nt |
|
*> elements of lower packed A. The LDA of RFP A is (N+1)/2 when |
|
*> TRANSR = 'C'. When TRANSR is 'N' the LDA is N+1 when N is |
|
*> even and N is odd. See the Note below for more details. |
|
*> |
|
*> On exit, the (triangular) inverse of the original matrix, in |
|
*> the same storage format. |
|
*> \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, A(i,i) is exactly zero. The triangular |
|
*> matrix is singular and its inverse can not be computed. |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date November 2011 |
|
* |
|
*> \ingroup complex16OTHERcomputational |
|
* |
|
*> \par Further Details: |
|
* ===================== |
|
*> |
|
*> \verbatim |
|
*> |
|
*> We first consider Standard Packed Format when N is even. |
|
*> We give an example where N = 6. |
|
*> |
|
*> AP is Upper AP is Lower |
|
*> |
|
*> 00 01 02 03 04 05 00 |
|
*> 11 12 13 14 15 10 11 |
|
*> 22 23 24 25 20 21 22 |
|
*> 33 34 35 30 31 32 33 |
|
*> 44 45 40 41 42 43 44 |
|
*> 55 50 51 52 53 54 55 |
|
*> |
|
*> |
|
*> Let TRANSR = 'N'. RFP holds AP as follows: |
|
*> For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last |
|
*> three columns of AP upper. The lower triangle A(4:6,0:2) consists of |
|
*> conjugate-transpose of the first three columns of AP upper. |
|
*> For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first |
|
*> three columns of AP lower. The upper triangle A(0:2,0:2) consists of |
|
*> conjugate-transpose of the last three columns of AP lower. |
|
*> To denote conjugate we place -- above the element. This covers the |
|
*> case N even and TRANSR = 'N'. |
|
*> |
|
*> RFP A RFP A |
|
*> |
|
*> -- -- -- |
|
*> 03 04 05 33 43 53 |
|
*> -- -- |
|
*> 13 14 15 00 44 54 |
|
*> -- |
|
*> 23 24 25 10 11 55 |
|
*> |
|
*> 33 34 35 20 21 22 |
|
*> -- |
|
*> 00 44 45 30 31 32 |
|
*> -- -- |
|
*> 01 11 55 40 41 42 |
|
*> -- -- -- |
|
*> 02 12 22 50 51 52 |
|
*> |
|
*> Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate- |
|
*> transpose of RFP A above. One therefore gets: |
|
*> |
|
*> |
|
*> RFP A RFP A |
|
*> |
|
*> -- -- -- -- -- -- -- -- -- -- |
|
*> 03 13 23 33 00 01 02 33 00 10 20 30 40 50 |
|
*> -- -- -- -- -- -- -- -- -- -- |
|
*> 04 14 24 34 44 11 12 43 44 11 21 31 41 51 |
|
*> -- -- -- -- -- -- -- -- -- -- |
|
*> 05 15 25 35 45 55 22 53 54 55 22 32 42 52 |
|
*> |
|
*> |
|
*> We next consider Standard Packed Format when N is odd. |
|
*> We give an example where N = 5. |
|
*> |
|
*> AP is Upper AP is Lower |
|
*> |
|
*> 00 01 02 03 04 00 |
|
*> 11 12 13 14 10 11 |
|
*> 22 23 24 20 21 22 |
|
*> 33 34 30 31 32 33 |
|
*> 44 40 41 42 43 44 |
|
*> |
|
*> |
|
*> Let TRANSR = 'N'. RFP holds AP as follows: |
|
*> For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last |
|
*> three columns of AP upper. The lower triangle A(3:4,0:1) consists of |
|
*> conjugate-transpose of the first two columns of AP upper. |
|
*> For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first |
|
*> three columns of AP lower. The upper triangle A(0:1,1:2) consists of |
|
*> conjugate-transpose of the last two columns of AP lower. |
|
*> To denote conjugate we place -- above the element. This covers the |
|
*> case N odd and TRANSR = 'N'. |
|
*> |
|
*> RFP A RFP A |
|
*> |
|
*> -- -- |
|
*> 02 03 04 00 33 43 |
|
*> -- |
|
*> 12 13 14 10 11 44 |
|
*> |
|
*> 22 23 24 20 21 22 |
|
*> -- |
|
*> 00 33 34 30 31 32 |
|
*> -- -- |
|
*> 01 11 44 40 41 42 |
|
*> |
|
*> Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate- |
|
*> transpose of RFP A above. One therefore gets: |
|
*> |
|
*> |
|
*> RFP A RFP A |
|
*> |
|
*> -- -- -- -- -- -- -- -- -- |
|
*> 02 12 22 00 01 00 10 20 30 40 50 |
|
*> -- -- -- -- -- -- -- -- -- |
|
*> 03 13 23 33 11 33 11 21 31 41 51 |
|
*> -- -- -- -- -- -- -- -- -- |
|
*> 04 14 24 34 44 43 44 22 32 42 52 |
|
*> \endverbatim |
|
*> |
|
* ===================================================================== |
|
SUBROUTINE ZTFTRI( TRANSR, UPLO, DIAG, N, A, INFO ) |
* |
* |
|
* -- 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 2011 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
CHARACTER TRANSR, UPLO, DIAG |
CHARACTER TRANSR, UPLO, DIAG |
Line 16
|
Line 234
|
COMPLEX*16 A( 0: * ) |
COMPLEX*16 A( 0: * ) |
* .. |
* .. |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* ZTFTRI computes the inverse of a triangular matrix A stored in RFP |
|
* format. |
|
* |
|
* This is a Level 3 BLAS version of the algorithm. |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* TRANSR (input) CHARACTER*1 |
|
* = 'N': The Normal TRANSR of RFP A is stored; |
|
* = 'C': The Conjugate-transpose TRANSR of RFP A is stored. |
|
* |
|
* UPLO (input) CHARACTER*1 |
|
* = 'U': A is upper triangular; |
|
* = 'L': A is lower triangular. |
|
* |
|
* DIAG (input) CHARACTER*1 |
|
* = 'N': A is non-unit triangular; |
|
* = 'U': A is unit triangular. |
|
* |
|
* N (input) INTEGER |
|
* The order of the matrix A. N >= 0. |
|
* |
|
* A (input/output) COMPLEX*16 array, dimension ( N*(N+1)/2 ); |
|
* On entry, the triangular matrix A in RFP format. RFP format |
|
* is described by TRANSR, UPLO, and N as follows: If TRANSR = |
|
* 'N' then RFP A is (0:N,0:k-1) when N is even; k=N/2. RFP A is |
|
* (0:N-1,0:k) when N is odd; k=N/2. IF TRANSR = 'C' then RFP is |
|
* the Conjugate-transpose of RFP A as defined when |
|
* TRANSR = 'N'. The contents of RFP A are defined by UPLO as |
|
* follows: If UPLO = 'U' the RFP A contains the nt elements of |
|
* upper packed A; If UPLO = 'L' the RFP A contains the nt |
|
* elements of lower packed A. The LDA of RFP A is (N+1)/2 when |
|
* TRANSR = 'C'. When TRANSR is 'N' the LDA is N+1 when N is |
|
* even and N is odd. See the Note below for more details. |
|
* |
|
* On exit, the (triangular) inverse of the original matrix, in |
|
* the same storage format. |
|
* |
|
* INFO (output) INTEGER |
|
* = 0: successful exit |
|
* < 0: if INFO = -i, the i-th argument had an illegal value |
|
* > 0: if INFO = i, A(i,i) is exactly zero. The triangular |
|
* matrix is singular and its inverse can not be computed. |
|
* |
|
* Further Details |
|
* =============== |
|
* |
|
* We first consider Standard Packed Format when N is even. |
|
* We give an example where N = 6. |
|
* |
|
* AP is Upper AP is Lower |
|
* |
|
* 00 01 02 03 04 05 00 |
|
* 11 12 13 14 15 10 11 |
|
* 22 23 24 25 20 21 22 |
|
* 33 34 35 30 31 32 33 |
|
* 44 45 40 41 42 43 44 |
|
* 55 50 51 52 53 54 55 |
|
* |
|
* |
|
* Let TRANSR = 'N'. RFP holds AP as follows: |
|
* For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last |
|
* three columns of AP upper. The lower triangle A(4:6,0:2) consists of |
|
* conjugate-transpose of the first three columns of AP upper. |
|
* For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first |
|
* three columns of AP lower. The upper triangle A(0:2,0:2) consists of |
|
* conjugate-transpose of the last three columns of AP lower. |
|
* To denote conjugate we place -- above the element. This covers the |
|
* case N even and TRANSR = 'N'. |
|
* |
|
* RFP A RFP A |
|
* |
|
* -- -- -- |
|
* 03 04 05 33 43 53 |
|
* -- -- |
|
* 13 14 15 00 44 54 |
|
* -- |
|
* 23 24 25 10 11 55 |
|
* |
|
* 33 34 35 20 21 22 |
|
* -- |
|
* 00 44 45 30 31 32 |
|
* -- -- |
|
* 01 11 55 40 41 42 |
|
* -- -- -- |
|
* 02 12 22 50 51 52 |
|
* |
|
* Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate- |
|
* transpose of RFP A above. One therefore gets: |
|
* |
|
* |
|
* RFP A RFP A |
|
* |
|
* -- -- -- -- -- -- -- -- -- -- |
|
* 03 13 23 33 00 01 02 33 00 10 20 30 40 50 |
|
* -- -- -- -- -- -- -- -- -- -- |
|
* 04 14 24 34 44 11 12 43 44 11 21 31 41 51 |
|
* -- -- -- -- -- -- -- -- -- -- |
|
* 05 15 25 35 45 55 22 53 54 55 22 32 42 52 |
|
* |
|
* |
|
* We next consider Standard Packed Format when N is odd. |
|
* We give an example where N = 5. |
|
* |
|
* AP is Upper AP is Lower |
|
* |
|
* 00 01 02 03 04 00 |
|
* 11 12 13 14 10 11 |
|
* 22 23 24 20 21 22 |
|
* 33 34 30 31 32 33 |
|
* 44 40 41 42 43 44 |
|
* |
|
* |
|
* Let TRANSR = 'N'. RFP holds AP as follows: |
|
* For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last |
|
* three columns of AP upper. The lower triangle A(3:4,0:1) consists of |
|
* conjugate-transpose of the first two columns of AP upper. |
|
* For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first |
|
* three columns of AP lower. The upper triangle A(0:1,1:2) consists of |
|
* conjugate-transpose of the last two columns of AP lower. |
|
* To denote conjugate we place -- above the element. This covers the |
|
* case N odd and TRANSR = 'N'. |
|
* |
|
* RFP A RFP A |
|
* |
|
* -- -- |
|
* 02 03 04 00 33 43 |
|
* -- |
|
* 12 13 14 10 11 44 |
|
* |
|
* 22 23 24 20 21 22 |
|
* -- |
|
* 00 33 34 30 31 32 |
|
* -- -- |
|
* 01 11 44 40 41 42 |
|
* |
|
* Now let TRANSR = 'C'. RFP A in both UPLO cases is just the conjugate- |
|
* transpose of RFP A above. One therefore gets: |
|
* |
|
* |
|
* RFP A RFP A |
|
* |
|
* -- -- -- -- -- -- -- -- -- |
|
* 02 12 22 00 01 00 10 20 30 40 50 |
|
* -- -- -- -- -- -- -- -- -- |
|
* 03 13 23 33 11 33 11 21 31 41 51 |
|
* -- -- -- -- -- -- -- -- -- |
|
* 04 14 24 34 44 43 44 22 32 42 52 |
|
* |
|
* ===================================================================== |
* ===================================================================== |
* |
* |
* .. Parameters .. |
* .. Parameters .. |
Line 201
|
Line 266
|
ELSE IF( .NOT.LOWER .AND. .NOT.LSAME( UPLO, 'U' ) ) THEN |
ELSE IF( .NOT.LOWER .AND. .NOT.LSAME( UPLO, 'U' ) ) THEN |
INFO = -2 |
INFO = -2 |
ELSE IF( .NOT.LSAME( DIAG, 'N' ) .AND. .NOT.LSAME( DIAG, 'U' ) ) |
ELSE IF( .NOT.LSAME( DIAG, 'N' ) .AND. .NOT.LSAME( DIAG, 'U' ) ) |
+ THEN |
$ THEN |
INFO = -3 |
INFO = -3 |
ELSE IF( N.LT.0 ) THEN |
ELSE IF( N.LT.0 ) THEN |
INFO = -4 |
INFO = -4 |
Line 214
|
Line 279
|
* Quick return if possible |
* Quick return if possible |
* |
* |
IF( N.EQ.0 ) |
IF( N.EQ.0 ) |
+ RETURN |
$ RETURN |
* |
* |
* If N is odd, set NISODD = .TRUE. |
* If N is odd, set NISODD = .TRUE. |
* If N is even, set K = N/2 and NISODD = .FALSE. |
* If N is even, set K = N/2 and NISODD = .FALSE. |
Line 255
|
Line 320
|
* |
* |
CALL ZTRTRI( 'L', DIAG, N1, A( 0 ), N, INFO ) |
CALL ZTRTRI( 'L', DIAG, N1, A( 0 ), N, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'L', 'N', DIAG, N2, N1, -CONE, A( 0 ), |
CALL ZTRMM( 'R', 'L', 'N', DIAG, N2, N1, -CONE, A( 0 ), |
+ N, A( N1 ), N ) |
$ N, A( N1 ), N ) |
CALL ZTRTRI( 'U', DIAG, N2, A( N ), N, INFO ) |
CALL ZTRTRI( 'U', DIAG, N2, A( N ), N, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + N1 |
$ INFO = INFO + N1 |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'U', 'C', DIAG, N2, N1, CONE, A( N ), N, |
CALL ZTRMM( 'L', 'U', 'C', DIAG, N2, N1, CONE, A( N ), N, |
+ A( N1 ), N ) |
$ A( N1 ), N ) |
* |
* |
ELSE |
ELSE |
* |
* |
Line 274
|
Line 339
|
* |
* |
CALL ZTRTRI( 'L', DIAG, N1, A( N2 ), N, INFO ) |
CALL ZTRTRI( 'L', DIAG, N1, A( N2 ), N, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'L', 'C', DIAG, N1, N2, -CONE, A( N2 ), |
CALL ZTRMM( 'L', 'L', 'C', DIAG, N1, N2, -CONE, A( N2 ), |
+ N, A( 0 ), N ) |
$ N, A( 0 ), N ) |
CALL ZTRTRI( 'U', DIAG, N2, A( N1 ), N, INFO ) |
CALL ZTRTRI( 'U', DIAG, N2, A( N1 ), N, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + N1 |
$ INFO = INFO + N1 |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'U', 'N', DIAG, N1, N2, CONE, A( N1 ), |
CALL ZTRMM( 'R', 'U', 'N', DIAG, N1, N2, CONE, A( N1 ), |
+ N, A( 0 ), N ) |
$ N, A( 0 ), N ) |
* |
* |
END IF |
END IF |
* |
* |
Line 298
|
Line 363
|
* |
* |
CALL ZTRTRI( 'U', DIAG, N1, A( 0 ), N1, INFO ) |
CALL ZTRTRI( 'U', DIAG, N1, A( 0 ), N1, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'U', 'N', DIAG, N1, N2, -CONE, A( 0 ), |
CALL ZTRMM( 'L', 'U', 'N', DIAG, N1, N2, -CONE, A( 0 ), |
+ N1, A( N1*N1 ), N1 ) |
$ N1, A( N1*N1 ), N1 ) |
CALL ZTRTRI( 'L', DIAG, N2, A( 1 ), N1, INFO ) |
CALL ZTRTRI( 'L', DIAG, N2, A( 1 ), N1, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + N1 |
$ INFO = INFO + N1 |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'L', 'C', DIAG, N1, N2, CONE, A( 1 ), |
CALL ZTRMM( 'R', 'L', 'C', DIAG, N1, N2, CONE, A( 1 ), |
+ N1, A( N1*N1 ), N1 ) |
$ N1, A( N1*N1 ), N1 ) |
* |
* |
ELSE |
ELSE |
* |
* |
Line 316
|
Line 381
|
* |
* |
CALL ZTRTRI( 'U', DIAG, N1, A( N2*N2 ), N2, INFO ) |
CALL ZTRTRI( 'U', DIAG, N1, A( N2*N2 ), N2, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'U', 'C', DIAG, N2, N1, -CONE, |
CALL ZTRMM( 'R', 'U', 'C', DIAG, N2, N1, -CONE, |
+ A( N2*N2 ), N2, A( 0 ), N2 ) |
$ A( N2*N2 ), N2, A( 0 ), N2 ) |
CALL ZTRTRI( 'L', DIAG, N2, A( N1*N2 ), N2, INFO ) |
CALL ZTRTRI( 'L', DIAG, N2, A( N1*N2 ), N2, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + N1 |
$ INFO = INFO + N1 |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'L', 'N', DIAG, N2, N1, CONE, |
CALL ZTRMM( 'L', 'L', 'N', DIAG, N2, N1, CONE, |
+ A( N1*N2 ), N2, A( 0 ), N2 ) |
$ A( N1*N2 ), N2, A( 0 ), N2 ) |
END IF |
END IF |
* |
* |
END IF |
END IF |
Line 346
|
Line 411
|
* |
* |
CALL ZTRTRI( 'L', DIAG, K, A( 1 ), N+1, INFO ) |
CALL ZTRTRI( 'L', DIAG, K, A( 1 ), N+1, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'L', 'N', DIAG, K, K, -CONE, A( 1 ), |
CALL ZTRMM( 'R', 'L', 'N', DIAG, K, K, -CONE, A( 1 ), |
+ N+1, A( K+1 ), N+1 ) |
$ N+1, A( K+1 ), N+1 ) |
CALL ZTRTRI( 'U', DIAG, K, A( 0 ), N+1, INFO ) |
CALL ZTRTRI( 'U', DIAG, K, A( 0 ), N+1, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + K |
$ INFO = INFO + K |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'U', 'C', DIAG, K, K, CONE, A( 0 ), N+1, |
CALL ZTRMM( 'L', 'U', 'C', DIAG, K, K, CONE, A( 0 ), N+1, |
+ A( K+1 ), N+1 ) |
$ A( K+1 ), N+1 ) |
* |
* |
ELSE |
ELSE |
* |
* |
Line 365
|
Line 430
|
* |
* |
CALL ZTRTRI( 'L', DIAG, K, A( K+1 ), N+1, INFO ) |
CALL ZTRTRI( 'L', DIAG, K, A( K+1 ), N+1, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'L', 'C', DIAG, K, K, -CONE, A( K+1 ), |
CALL ZTRMM( 'L', 'L', 'C', DIAG, K, K, -CONE, A( K+1 ), |
+ N+1, A( 0 ), N+1 ) |
$ N+1, A( 0 ), N+1 ) |
CALL ZTRTRI( 'U', DIAG, K, A( K ), N+1, INFO ) |
CALL ZTRTRI( 'U', DIAG, K, A( K ), N+1, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + K |
$ INFO = INFO + K |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'U', 'N', DIAG, K, K, CONE, A( K ), N+1, |
CALL ZTRMM( 'R', 'U', 'N', DIAG, K, K, CONE, A( K ), N+1, |
+ A( 0 ), N+1 ) |
$ A( 0 ), N+1 ) |
END IF |
END IF |
ELSE |
ELSE |
* |
* |
Line 388
|
Line 453
|
* |
* |
CALL ZTRTRI( 'U', DIAG, K, A( K ), K, INFO ) |
CALL ZTRTRI( 'U', DIAG, K, A( K ), K, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'U', 'N', DIAG, K, K, -CONE, A( K ), K, |
CALL ZTRMM( 'L', 'U', 'N', DIAG, K, K, -CONE, A( K ), K, |
+ A( K*( K+1 ) ), K ) |
$ A( K*( K+1 ) ), K ) |
CALL ZTRTRI( 'L', DIAG, K, A( 0 ), K, INFO ) |
CALL ZTRTRI( 'L', DIAG, K, A( 0 ), K, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + K |
$ INFO = INFO + K |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'L', 'C', DIAG, K, K, CONE, A( 0 ), K, |
CALL ZTRMM( 'R', 'L', 'C', DIAG, K, K, CONE, A( 0 ), K, |
+ A( K*( K+1 ) ), K ) |
$ A( K*( K+1 ) ), K ) |
ELSE |
ELSE |
* |
* |
* SRPA for UPPER, TRANSPOSE and N is even (see paper) |
* SRPA for UPPER, TRANSPOSE and N is even (see paper) |
Line 406
|
Line 471
|
* |
* |
CALL ZTRTRI( 'U', DIAG, K, A( K*( K+1 ) ), K, INFO ) |
CALL ZTRTRI( 'U', DIAG, K, A( K*( K+1 ) ), K, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'R', 'U', 'C', DIAG, K, K, -CONE, |
CALL ZTRMM( 'R', 'U', 'C', DIAG, K, K, -CONE, |
+ A( K*( K+1 ) ), K, A( 0 ), K ) |
$ A( K*( K+1 ) ), K, A( 0 ), K ) |
CALL ZTRTRI( 'L', DIAG, K, A( K*K ), K, INFO ) |
CALL ZTRTRI( 'L', DIAG, K, A( K*K ), K, INFO ) |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ INFO = INFO + K |
$ INFO = INFO + K |
IF( INFO.GT.0 ) |
IF( INFO.GT.0 ) |
+ RETURN |
$ RETURN |
CALL ZTRMM( 'L', 'L', 'N', DIAG, K, K, CONE, A( K*K ), K, |
CALL ZTRMM( 'L', 'L', 'N', DIAG, K, K, CONE, A( K*K ), K, |
+ A( 0 ), K ) |
$ A( 0 ), K ) |
END IF |
END IF |
END IF |
END IF |
END IF |
END IF |