SRC/ztpqrt2.f(3)
Hey bestie 💖 welcome to the SRC/ztpqrt2.f(3) page from the Library Functions Manual. This one is giving “tiny routine, big linear-algebra energy,” and we’re gonna get through every single detail together. 🫶
🌸 NAME
SRC/ztpqrt2.f
✨ SYNOPSIS
Functions/Subroutines
subroutine ztpqrt2 (m, n, l, a, lda, b, ldb, t, ldt, info)
ZTPQRT2 computes a QR factorization of a real or complex “triangular-pentagonal” matrix, which is composed of a triangular block and a pentagonal block, using the compact WY representation for Q. 💅
🎀 Function/Subroutine Documentation
subroutine ztpqrt2 (integer m, integer n, integer l, complex*16, dimension(
lda, * ) a, integer lda, complex*16, dimension( ldb, * ) b, integer ldb,
complex*16, dimension( ldt, * ) t, integer ldt, integer info)
ZTPQRT2 computes a QR factorization of a real or complex “triangular-pentagonal” matrix, which is composed of a triangular block and a pentagonal block, using the compact WY representation for Q.
💖 Purpose
Okay so the Purpose block is literally this: ZTPQRT2 computes a QR factorization of a complex matrix C, which is composed of a triangular block A and pentagonal block B, using the compact WY representation for Q. No cap, that’s the whole vibe. ✨
🦋 Parameters
M—MisINTEGER. It’s the total number of rows of the matrixB.M >= 0.N—NisINTEGER. It’s the number of columns of the matrixB, and the order of the triangular matrixA.N >= 0.L—LisINTEGER. It’s the number of rows of the upper trapezoidal part ofB.MIN(M,N) >= L >= 0. See Further Details.A—AisCOMPLEX*16array, dimension(LDA,N). On entry, it’s the upper triangularN-by-NmatrixA. On exit, the elements on and above the diagonal of the array contain the upper triangular matrixR.LDA—LDAisINTEGER. It’s the leading dimension of the arrayA.LDA >= max(1,N).B—BisCOMPLEX*16array, dimension(LDB,N). On entry, it’s the pentagonalM-by-NmatrixB. The firstM-Lrows are rectangular, and the lastLrows are upper trapezoidal. On exit,Bcontains the pentagonal matrixV. See Further Details.LDB—LDBisINTEGER. It’s the leading dimension of the arrayB.LDB >= max(1,M).T—TisCOMPLEX*16array, dimension(LDT,N). It’s theN-by-Nupper triangular factorTof the block reflector. See Further Details.LDT—LDTisINTEGER. It’s the leading dimension of the arrayT.LDT >= max(1,N)INFO—INFOisINTEGER.= 0: successful exit.< 0: ifINFO = -i, thei-th argument had an illegal value.
🌈 Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
👑 Further Details
The input matrix C is a (N+M)-by-N matrix
C = [ A ]
[ B ]
where A is an upper triangular N-by-N matrix, and B is M-by-N pentagonal matrix consisting of a (M-L)-by-N rectangular matrix B1 on top of a L-by-N upper trapezoidal matrix B2:
B = [ B1 ] <- (M-L)-by-N rectangular
[ B2 ] <- L-by-N upper trapezoidal.
The upper trapezoidal matrix B2 consists of the first L rows of a N-by-N upper triangular matrix, where 0 <= L <= MIN(M,N). If L=0, B is rectangular M-by-N; if M=L=N, B is upper triangular.
The matrix W stores the elementary reflectors H(i) in the i-th column below the diagonal (of A) in the (N+M)-by-N input matrix C
C = [ A ] <- upper triangular N-by-N
[ B ] <- M-by-N pentagonal
so that W can be represented as
W = [ 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 ] <- (M-L)-by-N rectangular
[ V2 ] <- L-by-N upper trapezoidal.
The columns of V represent the vectors which define the H(i)'s. The (M+N)-by-(M+N) block reflector H is then given by
H = I - W * T * W**H
where W**H is the conjugate transpose of W and T is the upper triangular factor of the block reflector.
Definition at line 172 of file ztpqrt2.f.
🌟 Author
Generated automatically by Doxygen for LAPACK from the source code.
Cute sign-off time, bestie: this footer energy is LAPACK, Version 3.12.0, on page SRC/ztpqrt2.f(3). Periodt. 💅✨
📦 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