ZGEQP3(3)
Welcome to zgeqp3.f(3) from the Library Functions Manual, bestie π
. This is the page for ZGEQP3, and we're gonna get you comfy with every single flag, dimension, and tiny little INFO code. No cap β¨.
π NAME π
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zgeqp3.f β that's the file this whole page is about. Slay. β¨
β¨ SYNOPSIS β¨
Functions/Subroutines
subroutine ZGEQP3 (m, n, a, lda, jpvt, tau, work, lwork, rwork, info)
ZGEQP3
π«Ά Function/Subroutine Documentation π«Ά
subroutine ZGEQP3 (integer m, integer n, complex*16, dimension( lda, * ) a,
integer lda, integer, dimension( * ) jpvt, complex*16, dimension( * )
tau, complex*16, dimension( * ) work, integer lwork, double precision,
dimension( * ) rwork, integer info)
ZGEQP3
Purpose
Okay so ZGEQP3 computes a QR factorization with column pivoting of a matrix A: A*P = Q*R, using Level 3 BLAS. That's the whole flex. π
Parameters
MβM is INTEGER. It's the number of rows of the matrixA. Constraint:M >= 0.NβN is INTEGER. It's the number of columns of the matrixA. Constraint:N >= 0.AβA is COMPLEX*16 array, dimension (LDA,N). On entry, it's theM-by-NmatrixA. On exit, the upper triangle of the array contains themin(M,N)-by-Nupper trapezoidal matrixR; the elements below the diagonal, together with the arrayTAU, represent the unitary matrixQas a product ofmin(M,N)elementary reflectors. Iconic behavior. π¦LDAβLDA is INTEGER. The leading dimension of the arrayA. Constraint:LDA >= max(1,M).JPVTβJPVT is INTEGER array, dimension (N). On entry, ifJPVT(J).ne.0, theJ-th column ofAis permuted to the front ofA*P(a leading column); ifJPVT(J)=0, theJ-th column ofAis a free column. On exit, ifJPVT(J)=K, then theJ-th column ofA*Pwas the theK-th column ofA. πTAUβTAU is COMPLEX*16 array, dimension (min(M,N)). These are the scalar factors of the elementary reflectors.WORKβWORK is COMPLEX*16 array, dimension (MAX(1,LWORK)). On exit, ifINFO=0,WORK(1)returns the optimalLWORK.LWORKβLWORK is INTEGER. The dimension of the arrayWORK. Constraint:LWORK >= N+1. For optimal performance,LWORK >= ( N+1 )*NB, whereNBis the optimal blocksize. IfLWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of theWORKarray, returns this value as the first entry of theWORKarray, and no error message related toLWORKis issued byXERBLA. π«ΆRWORKβRWORK is DOUBLE PRECISION array, dimension (2*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 Q is represented as a product of elementary reflectors:
Q = H(1) H(2) . . . H(k), where k = min(m,n).
Each H(i) has the form:
H(i) = I - tau * v * v**H
where tau is a complex scalar, and v is a real/complex vector with v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), and tau in TAU(i). That's the little machinery behind the magic, iykyk. β¨
Contributors:
- G. Quintana-Orti, Depto. de Informatica, Universidad Jaime I, Spain
- X. Sun, Computer Science Dept., Duke University, USA
Definition at line 157 of file zgeqp3.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
That's the whole page, bestie β signed off by LAPACK Version 3.12.0 at /home/abui...RC/zgeqp3.f(3) π. No cap, go slay your QR factorization. π
π¦ 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