version 1.2, 2017/06/17 11:06:37
|
version 1.3, 2018/05/29 06:55:21
|
Line 65
|
Line 65
|
*> |
*> |
*> \param[in,out] A |
*> \param[in,out] A |
*> \verbatim |
*> \verbatim |
*> A is DOUBLE PRECISION array, dimension (LDA,N) |
*> A is DOUBLE PRECISION array, dimension (LDA,M) |
*> On entry, the lower triangular M-by-M matrix A. |
*> On entry, the lower triangular M-by-M matrix A. |
*> On exit, the elements on and below the diagonal of the array |
*> On exit, the elements on and below the diagonal of the array |
*> contain the lower triangular matrix L. |
*> contain the lower triangular matrix L. |
Line 74
|
Line 74
|
*> \param[in] LDA |
*> \param[in] LDA |
*> \verbatim |
*> \verbatim |
*> LDA is INTEGER |
*> LDA is INTEGER |
*> The leading dimension of the array A. LDA >= max(1,N). |
*> The leading dimension of the array A. LDA >= max(1,M). |
*> \endverbatim |
*> \endverbatim |
*> |
*> |
*> \param[in,out] B |
*> \param[in,out] B |
Line 119
|
Line 119
|
*> \author Univ. of Colorado Denver |
*> \author Univ. of Colorado Denver |
*> \author NAG Ltd. |
*> \author NAG Ltd. |
* |
* |
*> \date December 2016 |
*> \date June 2017 |
* |
* |
*> \ingroup doubleOTHERcomputational |
*> \ingroup doubleOTHERcomputational |
* |
* |
Line 133
|
Line 133
|
*> C = [ A ][ B ] |
*> C = [ A ][ B ] |
*> |
*> |
*> |
*> |
*> where A is an lower triangular N-by-N matrix, and B is M-by-N pentagonal |
*> where A is an lower triangular M-by-M matrix, and B is M-by-N pentagonal |
*> matrix consisting of a M-by-(N-L) rectangular matrix B1 left of a M-by-L |
*> matrix consisting of a M-by-(N-L) rectangular matrix B1 left of a M-by-L |
*> upper trapezoidal matrix B2: |
*> upper trapezoidal matrix B2: |
*> |
*> |
Line 149
|
Line 149
|
*> above the diagonal (of A) in the M-by-(M+N) input matrix C |
*> above the diagonal (of A) in the M-by-(M+N) input matrix C |
*> |
*> |
*> C = [ A ][ B ] |
*> C = [ A ][ B ] |
*> [ A ] <- lower triangular N-by-N |
*> [ A ] <- lower triangular M-by-M |
*> [ B ] <- M-by-N pentagonal |
*> [ B ] <- M-by-N pentagonal |
*> |
*> |
*> so that W can be represented as |
*> so that W can be represented as |
*> |
*> |
*> W = [ I ][ V ] |
*> W = [ I ][ V ] |
*> [ I ] <- identity, N-by-N |
*> [ I ] <- identity, M-by-M |
*> [ V ] <- M-by-N, same form as B. |
*> [ V ] <- M-by-N, same form as B. |
*> |
*> |
*> Thus, all of information needed for W is contained on exit in B, which |
*> Thus, all of information needed for W is contained on exit in B, which |
Line 177
|
Line 177
|
* ===================================================================== |
* ===================================================================== |
SUBROUTINE DTPLQT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) |
SUBROUTINE DTPLQT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO ) |
* |
* |
* -- LAPACK computational routine (version 3.7.0) -- |
* -- LAPACK computational routine (version 3.7.1) -- |
* -- 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..-- |
* December 2016 |
* June 2017 |
* |
* |
* .. Scalar Arguments .. |
* .. Scalar Arguments .. |
INTEGER INFO, LDA, LDB, LDT, N, M, L |
INTEGER INFO, LDA, LDB, LDT, N, M, L |