TESTING/LIN/dtplqt.f(3)
β¨ NAME β¨
TESTING/LIN/dtplqt.f β bestie, this is the TESTING/LIN/dtplqt.f(3) page from the Library Functions Manual, and it's all about DTPLQT. π¦
πΈ SYNOPSIS πΈ
Functions/Subroutines
subroutine dtplqt (m, n, l, mb, a, lda, b, ldb, t, ldt, work, info)
DTPLQT π
π Function/Subroutine Documentation π
subroutine dtplqt (integer m, integer n, integer l, integer mb, double precision, dimension( lda, * ) a, integer lda, double precision, dimension( ldb, * ) b, integer ldb, double precision, dimension( ldt, * ) t, integer ldt, double precision, dimension( * ) work, integer info)
DTPLQT is the main character here, no cap. π
β¨ Purpose β¨
Okay so DTPLQT computes a blocked LQ factorization of a real matrix C, and C is composed of a triangular block A and pentagonal block B, using the compact WY representation for Q. That's the whole vibe. π«Ά
π Parameters π
MβINTEGER. The number of rows of the matrixB, and the order of the triangular matrixA.M >= 0.NβINTEGER. The number of columns of the matrixB.N >= 0.LβINTEGER. The number of rows of the lower trapezoidal part ofB.MIN(M,N) >= L >= 0. See Further Details.MBβINTEGER. The block size to be used in the blocked QR.M >= MB >= 1.AβDOUBLE PRECISIONarray, dimension(LDA,N). On entry, the lower triangularN-by-NmatrixA. On exit, the elements on and below the diagonal of the array contain the lower triangular matrixL.LDAβINTEGER. The leading dimension of the arrayA.LDA >= max(1,N).BβDOUBLE PRECISIONarray, dimension(LDB,N). On entry, the pentagonalM-by-NmatrixB. The firstN-Lcolumns are rectangular, and the lastLcolumns are lower trapezoidal. On exit,Bcontains the pentagonal matrixV. See Further Details.LDBβINTEGER. The leading dimension of the arrayB.LDB >= max(1,M).TβDOUBLE PRECISIONarray, dimension(LDT,N). The lower triangular block reflectors stored in compact form as a sequence of upper triangular blocks. See Further Details.LDTβINTEGER. The leading dimension of the arrayT.LDT >= MB.WORKβDOUBLE PRECISIONarray, dimension(MB*M).INFOβINTEGER.= 0: successful exit.< 0: ifINFO = -i, thei-thargument had an illegal value.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π¦ Further Details π¦
Okay so picture this: the input matrix C is a M-by-(M+N) matrix
C = [ A ] [ B ]
where A is a lower triangular N-by-N matrix, and B is M-by-N pentagonal matrix consisting of a M-by-(N-L) rectangular matrix B1 on left of a M-by-L upper trapezoidal matrix B2:
[ B ] = [ B1 ] [ B2 ]
[ B1 ] <- M-by-(N-L) rectangular
[ B2 ] <- M-by-L upper trapezoidal.
The lower trapezoidal matrix B2 consists of the first L columns of a N-by-N lower triangular matrix, where 0 <= L <= MIN(M,N). If L=0, B is rectangular M-by-N; if M=L=N, B is lower triangular. β¨
The matrix W stores the elementary reflectors H(i) in the i-th row above the diagonal (of A) in the M-by-(M+N) input matrix C
[ C ] = [ A ] [ B ]
[ A ] <- lower triangular N-by-N
[ B ] <- M-by-N pentagonal
so that W can be represented as
[ W ] = [ I ] [ V ]
[ I ] <- identity, N-by-N
[ V ] <- M-by-N, same form as B.
Thus, all of information needed for W is contained on exit in B, which we call V above. Note that V has the same form as B; that is,
[ V ] = [ V1 ] [ V2 ]
[ V1 ] <- M-by-(N-L) rectangular
[ V2 ] <- M-by-L lower trapezoidal.
The rows of V represent the vectors which define the H(i)'s. π§
The number of blocks is B = ceiling(M/MB), where each block is of order MB except for the last block, which is of order IB = M - (M-1)*MB. For each of the B blocks, an upper triangular block reflector factor is computed: T1, T2, ..., TB. The MB-by-MB (and IB-by-IB for the last block) T's are stored in the MB-by-N matrix T as
T = [T1 T2 ... TB].
Definition at line 187 of file dtplqt.f.
β Author β
Generated automatically by Doxygen for LAPACK from the source code. π«Ά
LAPACK Version 3.12.0 Β· TESTING/LIN/dtplqt.f(3) β that's the footer, bestie, and the source/version vibe is certified iconic. Byeee πβ¨
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms