ZGEQRT(3)
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zgeqrt.f
Okay bestie, this is zgeqrt.f(3) from the Library Functions Manual β and itβs giving βblocked QR factorization but make it LAPACK.β π
π¦ SYNOPSIS π¦
Functions/Subroutines
subroutine ZGEQRT (m, n, nb, a, lda, t, ldt, work, info)
ZGEQRT
πΈ Function/Subroutine Documentation πΈ
subroutine ZGEQRT (integer m, integer n, integer nb, complex*16, dimension(
lda, * ) a, integer lda, complex*16, dimension( ldt, * ) t, integer ldt,
complex*16, dimension( * ) work, integer info)
π Purpose π
ZGEQRT computes a blocked QR factorization of a complex M-by-N matrix A using the compact WY representation of Q. Periodt. π
π§ Parameters π§
MβM is INTEGER. The number of rows of the matrixA.M >= 0.NβN is INTEGER. The number of columns of the matrixA.N >= 0.NBβNB is INTEGER. The block size to be used in the blocked QR.MIN(M,N) >= NB >= 1.AβA is COMPLEX*16 array, dimension (LDA,N). On entry, theM-by-NmatrixA. On exit, the elements on and above the diagonal of the array contain themin(M,N)-by-Nupper trapezoidal matrixR(Ris upper triangular ifM >= N); the elements below the diagonal are the columns ofV. π«ΆLDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,M).TβT is COMPLEX*16 array, dimension (LDT,MIN(M,N)). The upper triangular block reflectors stored in compact form as a sequence of upper triangular blocks. See below for further details. πLDTβLDT is INTEGER. The leading dimension of the arrayT.LDT >= NB.WORKβWORK is COMPLEX*16 array, dimension (NB*N).INFOβINFO is INTEGER.= 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 matrix V stores the elementary reflectors H(i) in the i-th column below the diagonal. For example, if M=5 and N=3, the matrix V is
V = ( 1 )
( v1 1 )
( v1 v2 1 )
( v1 v2 v3 )
( v1 v2 v3 )
where the vi's represent the vectors which define H(i), which are returned in the matrix A. The 1's along the diagonal of V are not stored in A. π (iconic behavior, honestly)
Let K=MIN(M,N). The number of blocks is B = ceiling(K/NB), where each block is of order NB except for the last block, which is of order IB = K - (B-1)*NB. For each of the B blocks, an upper triangular block reflector factor is computed: T1, T2, ..., TB. The NB-by-NB (and IB-by-IB for the last block) T's are stored in the NB-by-K matrix T as
T = (T1 T2 ... TB).
Definition at line 140 of file zgeqrt.f.
β Author β
Generated automatically by Doxygen for LAPACK from the source code.
Thatβs the whole page, bestie π Footer vibe check: LAPACK Version 3.12.0, with /home/abui...RC/zgeqrt.f(3) doing its little source/date-footer moment. Slay responsibly πβ¨
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms