ZGEQP3(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

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 matrix A. Constraint: M >= 0.
  • N β€” N is INTEGER. It's the number of columns of the matrix A. Constraint: N >= 0.
  • A β€” A is COMPLEX*16 array, dimension (LDA,N). On entry, it's the M-by-N matrix A. On exit, the upper triangle of the array contains the min(M,N)-by-N upper trapezoidal matrix R; the elements below the diagonal, together with the array TAU, represent the unitary matrix Q as a product of min(M,N) elementary reflectors. Iconic behavior. πŸ¦‹
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. Constraint: LDA >= max(1,M).
  • JPVT β€” JPVT is INTEGER array, dimension (N). On entry, if JPVT(J).ne.0, the J-th column of A is permuted to the front of A*P (a leading column); if JPVT(J)=0, the J-th column of A is a free column. On exit, if JPVT(J)=K, then the J-th column of A*P was the the K-th column of A. πŸ‘‘
  • 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, if INFO=0, WORK(1) returns the optimal LWORK.
  • LWORK β€” LWORK is INTEGER. The dimension of the array WORK. Constraint: LWORK >= N+1. For optimal performance, LWORK >= ( N+1 )*NB, where NB is the optimal blocksize. If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA. 🫢
  • RWORK β€” RWORK is DOUBLE PRECISION array, dimension (2*N).
  • INFO β€” INFO is INTEGER. = 0: successful exit. < 0: if INFO = -i, the i-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