version 1.5, 2010/12/21 13:53:40
|
version 1.9, 2012/08/22 09:48:27
|
Line 1
|
Line 1
|
SUBROUTINE DTPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) |
*> \brief \b DTPTTF |
* |
* |
* -- LAPACK routine (version 3.3.0) -- |
* =========== DOCUMENTATION =========== |
* |
* |
* -- Contributed by Fred Gustavson of the IBM Watson Research Center -- |
* Online html documentation available at |
* November 2010 |
* http://www.netlib.org/lapack/explore-html/ |
* |
* |
|
*> \htmlonly |
|
*> Download DTPTTF + dependencies |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dtpttf.f"> |
|
*> [TGZ]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dtpttf.f"> |
|
*> [ZIP]</a> |
|
*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dtpttf.f"> |
|
*> [TXT]</a> |
|
*> \endhtmlonly |
|
* |
|
* Definition: |
|
* =========== |
|
* |
|
* SUBROUTINE DTPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) |
|
* |
|
* .. Scalar Arguments .. |
|
* CHARACTER TRANSR, UPLO |
|
* INTEGER INFO, N |
|
* .. |
|
* .. Array Arguments .. |
|
* DOUBLE PRECISION AP( 0: * ), ARF( 0: * ) |
|
* |
|
* |
|
*> \par Purpose: |
|
* ============= |
|
*> |
|
*> \verbatim |
|
*> |
|
*> DTPTTF copies a triangular matrix A from standard packed format (TP) |
|
*> to rectangular full packed format (TF). |
|
*> \endverbatim |
|
* |
|
* Arguments: |
|
* ========== |
|
* |
|
*> \param[in] TRANSR |
|
*> \verbatim |
|
*> TRANSR is CHARACTER*1 |
|
*> = 'N': ARF in Normal format is wanted; |
|
*> = 'T': ARF in Conjugate-transpose format is wanted. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] UPLO |
|
*> \verbatim |
|
*> UPLO is CHARACTER*1 |
|
*> = 'U': A is upper triangular; |
|
*> = 'L': A is lower triangular. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] N |
|
*> \verbatim |
|
*> N is INTEGER |
|
*> The order of the matrix A. N >= 0. |
|
*> \endverbatim |
|
*> |
|
*> \param[in] AP |
|
*> \verbatim |
|
*> AP is DOUBLE PRECISION array, dimension ( N*(N+1)/2 ), |
|
*> On entry, the upper or lower triangular matrix A, packed |
|
*> columnwise in a linear array. The j-th column of A is stored |
|
*> in the array AP as follows: |
|
*> if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; |
|
*> if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] ARF |
|
*> \verbatim |
|
*> ARF is DOUBLE PRECISION array, dimension ( N*(N+1)/2 ), |
|
*> On exit, the upper or lower triangular matrix A stored in |
|
*> RFP format. For a further discussion see Notes below. |
|
*> \endverbatim |
|
*> |
|
*> \param[out] INFO |
|
*> \verbatim |
|
*> INFO is INTEGER |
|
*> = 0: successful exit |
|
*> < 0: if INFO = -i, the i-th argument had an illegal value |
|
*> \endverbatim |
|
* |
|
* Authors: |
|
* ======== |
|
* |
|
*> \author Univ. of Tennessee |
|
*> \author Univ. of California Berkeley |
|
*> \author Univ. of Colorado Denver |
|
*> \author NAG Ltd. |
|
* |
|
*> \date November 2011 |
|
* |
|
*> \ingroup doubleOTHERcomputational |
|
* |
|
*> \par Further Details: |
|
* ===================== |
|
*> |
|
*> \verbatim |
|
*> |
|
*> We first consider Rectangular Full Packed (RFP) 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 |
|
*> the 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 |
|
*> the transpose of the last three columns of AP lower. |
|
*> 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 = 'T'. RFP A in both UPLO cases is just the |
|
*> 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 then consider Rectangular Full Packed (RFP) 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 |
|
*> the 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 |
|
*> the transpose of the last two columns of AP lower. |
|
*> 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 = 'T'. RFP A in both UPLO cases is just the |
|
*> 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 DTPTTF( TRANSR, UPLO, N, AP, ARF, 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 |
CHARACTER TRANSR, UPLO |
INTEGER INFO, N |
INTEGER INFO, N |
Line 16
|
Line 198
|
* .. Array Arguments .. |
* .. Array Arguments .. |
DOUBLE PRECISION AP( 0: * ), ARF( 0: * ) |
DOUBLE PRECISION AP( 0: * ), ARF( 0: * ) |
* |
* |
* Purpose |
|
* ======= |
|
* |
|
* DTPTTF copies a triangular matrix A from standard packed format (TP) |
|
* to rectangular full packed format (TF). |
|
* |
|
* Arguments |
|
* ========= |
|
* |
|
* TRANSR (input) CHARACTER*1 |
|
* = 'N': ARF in Normal format is wanted; |
|
* = 'T': ARF in Conjugate-transpose format is wanted. |
|
* |
|
* UPLO (input) CHARACTER*1 |
|
* = 'U': A is upper triangular; |
|
* = 'L': A is lower triangular. |
|
* |
|
* N (input) INTEGER |
|
* The order of the matrix A. N >= 0. |
|
* |
|
* AP (input) DOUBLE PRECISION array, dimension ( N*(N+1)/2 ), |
|
* On entry, the upper or lower triangular matrix A, packed |
|
* columnwise in a linear array. The j-th column of A is stored |
|
* in the array AP as follows: |
|
* if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; |
|
* if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n. |
|
* |
|
* ARF (output) DOUBLE PRECISION array, dimension ( N*(N+1)/2 ), |
|
* On exit, the upper or lower triangular matrix A stored in |
|
* RFP format. For a further discussion see Notes below. |
|
* |
|
* INFO (output) INTEGER |
|
* = 0: successful exit |
|
* < 0: if INFO = -i, the i-th argument had an illegal value |
|
* |
|
* Further Details |
|
* =============== |
|
* |
|
* We first consider Rectangular Full Packed (RFP) 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 |
|
* the 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 |
|
* the transpose of the last three columns of AP lower. |
|
* 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 = 'T'. RFP A in both UPLO cases is just the |
|
* 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 then consider Rectangular Full Packed (RFP) 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 |
|
* the 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 |
|
* the transpose of the last two columns of AP lower. |
|
* 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 = 'T'. RFP A in both UPLO cases is just the |
|
* 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 177
|
Line 240
|
* Quick return if possible |
* Quick return if possible |
* |
* |
IF( N.EQ.0 ) |
IF( N.EQ.0 ) |
+ RETURN |
$ RETURN |
* |
* |
IF( N.EQ.1 ) THEN |
IF( N.EQ.1 ) THEN |
IF( NORMALTRANSR ) THEN |
IF( NORMALTRANSR ) THEN |
Line 220
|
Line 283
|
* ARF^C has lda rows and n+1-noe cols |
* ARF^C has lda rows and n+1-noe cols |
* |
* |
IF( .NOT.NORMALTRANSR ) |
IF( .NOT.NORMALTRANSR ) |
+ LDA = ( N+1 ) / 2 |
$ LDA = ( N+1 ) / 2 |
* |
* |
* start execution: there are eight cases |
* start execution: there are eight cases |
* |
* |