CGQRTS(3)

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

✨ NAME ✨

Okay bestie πŸ’–, welcome to CGQRTS(3) from the Library Functions Manual β€” the vibe is very "LAPACK test routine who knows she's that girl." The actual file is:

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/cgqrts.f


🌸 SYNOPSIS 🌸

🫢 Functions/Subroutines 🫢

subroutine CGQRTS (n, m, p, a, af, q, r, lda, taua, b, bf, z, t, bwk,
    ldb, taub, work, lwork, rwork, result)
    CGQRTS

πŸ’… Function/Subroutine Documentation πŸ’…

subroutine CGQRTS (integer n, integer m, integer p, complex, dimension( lda,
    * ) a, complex, dimension( lda, * ) af, complex, dimension( lda, * ) q,
    complex, dimension( lda, * ) r, integer lda, complex, dimension( * )
    taua, complex, dimension( ldb, * ) b, complex, dimension( ldb, * ) bf,
    complex, dimension( ldb, * ) z, complex, dimension( ldb, * ) t, complex,
    dimension( ldb, * ) bwk, integer ldb, complex, dimension( * ) taub,
    complex, dimension( lwork ) work, integer lwork, real, dimension( * )
    rwork, real, dimension( 4 ) result)
    CGQRTS

πŸŽ€ Purpose πŸŽ€

CGQRTS tests CGGQRF, which computes the GQR factorization of an N-by-M matrix A and a N-by-P matrix B: A = Q*R and B = Q*T*Z. Periodt. ✨

⭐ Parameters ⭐

  • N β€” N is INTEGER. The number of rows of the matrices A and B. N >= 0.
  • M β€” M is INTEGER. The number of columns of the matrix A. M >= 0.
  • P β€” P is INTEGER. The number of columns of the matrix B. P >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,M). The N-by-M matrix A.
  • AF β€” AF is COMPLEX array, dimension (LDA,N). Details of the GQR factorization of A and B, as returned by CGGQRF, see CGGQRF for further details.
  • Q β€” Q is COMPLEX array, dimension (LDA,N). The M-by-M unitary matrix Q.
  • R β€” R is COMPLEX array, dimension (LDA,MAX(M,N)). That's it, that's the description β€” iconic minimalism πŸ’….
  • LDA β€” LDA is INTEGER. The leading dimension of the arrays A, AF, R and Q. LDA >= max(M,N).
  • TAUA β€” TAUA is COMPLEX array, dimension (min(M,N)). The scalar factors of the elementary reflectors, as returned by CGGQRF.
  • B β€” B is COMPLEX array, dimension (LDB,P). On entry, the N-by-P matrix A.
Not me keeping the exact B line that says "matrix A" β€” yes bestie, that's literally what the page says. Facts are facts. πŸ’€
  • BF β€” BF is COMPLEX array, dimension (LDB,N). Details of the GQR factorization of A and B, as returned by CGGQRF, see CGGQRF for further details.
  • Z β€” Z is COMPLEX array, dimension (LDB,P). The P-by-P unitary matrix Z.
  • T β€” T is COMPLEX array, dimension (LDB,max(P,N)). No extra notes, she's just here for the vibes.
  • BWK β€” BWK is COMPLEX array, dimension (LDB,N). Also no extra notes.
  • LDB β€” LDB is INTEGER. The leading dimension of the arrays B, BF, Z and T. LDB >= max(P,N).
  • TAUB β€” TAUB is COMPLEX array, dimension (min(P,N)). The scalar factors of the elementary reflectors, as returned by SGGRQF.
  • WORK β€” WORK is COMPLEX array, dimension (LWORK).
  • LWORK β€” LWORK is INTEGER. The dimension of the array WORK, LWORK >= max(N,M,P)**2.
  • RWORK β€” RWORK is REAL array, dimension (max(N,M,P)).
  • RESULT β€” RESULT is REAL array, dimension (4). The test ratios:
RESULT(1) = norm( R - Q'*A ) / ( MAX(M,N)*norm(A)*ULP)
RESULT(2) = norm( T*Z - Q'*B ) / (MAX(P,N)*norm(B)*ULP)
RESULT(3) = norm( I - Q'*Q ) / ( M*ULP )
RESULT(4) = norm( I - Z'*Z ) / ( P*ULP )

πŸ‘‘ Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

πŸ“ Definition at line 174 of file cgqrts.f. πŸ“

Definition at line 174 of file cgqrts.f.

πŸ€– Author πŸ€–

Generated automatically by Doxygen for LAPACK from the source code.


Okay that's the whole page, bestie 🫢. Stay iconic β€” footer energy is LAPACK Version 3.12.0, page /home/abui...IG/cgqrts.f(3). πŸ’…βœ¨πŸ¦‹

πŸ“¦ where this page comes from