TESTING/LIN/zgerqs.f(3)

πŸ“¦
version 3.12.1 Β· 3 versions
, in arch rolling

πŸ¦‹ TESTING/LIN/zgerqs.f(3) β€” Library Functions Manual πŸ¦‹

okay so bestie, welcome to the TESTING/LIN/zgerqs.f(3) page from the Library Functions Manual! This is your group-chat rundown of ZGERQS, and I am literally keeping every type, dimension, constraint, and status code exactly as it is. No cap. πŸ’–

✨ NAME ✨

TESTING/LIN/zgerqs.f

🌸 SYNOPSIS 🌸

Functions/Subroutines 🫢

subroutine zgerqs (m, n, nrhs, a, lda, tau, b, ldb, work, lwork, info)

ZGERQS β€” iconic subroutine, periodt.

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

🫢 ZGERQS Full Signature 🫢

subroutine zgerqs (integer m, integer n, integer nrhs, complex*16,
       dimension( lda, * ) a, integer lda, complex*16, dimension( * ) tau,
       complex*16, dimension( ldb, * ) b, integer ldb, complex*16, dimension(
       lwork ) work, integer lwork, integer info)

ZGERQS

πŸŽ€ Purpose: πŸŽ€

okay so the purpose is giving:

!>
!> Compute a minimum-norm solution
!>     min || A*X - B ||
!> using the RQ factorization
!>     A = R*Q
!> computed by ZGERQF.
!>

Translation for the besties: it computes a minimum-norm solution min || A*X - B || using the RQ factorization A = R*Q computed by ZGERQF. That's the whole vibe. ✨

🌟 Parameters 🌟

  • M β€” M is INTEGER. It's the number of rows of matrix A, and M >= 0. Non-negative row count, we love to see it. πŸ’œ
  • N β€” N is INTEGER. It's the number of columns of matrix A, and N >= M >= 0. The way that inequality chain is chaining. πŸ’…
  • NRHS β€” NRHS is INTEGER. It's the number of columns of B, and NRHS >= 0. Periodt.
  • A β€” A is COMPLEX*16 array, dimension (LDA,N). It holds details of the RQ factorization of the original matrix A as returned by ZGERQF. This is the factorization lore, iykyk.
  • LDA β€” LDA is INTEGER. It's the leading dimension of the array A, and LDA >= M. Respect the leading dimension, bestie.
  • TAU β€” TAU is COMPLEX*16 array, dimension (M). It holds details of the orthogonal matrix Q. Iconic little tau. πŸŽ€
  • B β€” B is COMPLEX*16 array, dimension (LDB,NRHS). On entry, it's the right hand side vectors for the linear system. On exit, it's the solution vectors X. Each solution vector is contained in rows 1:N of a column of B. Not me being obsessed with rows 1:N. 🌸
  • LDB β€” LDB is INTEGER. It's the leading dimension of the array B, and LDB >= max(1,N). Exact constraint, no cap.
  • WORK β€” WORK is COMPLEX*16 array, dimension (LWORK). The workspace bestie.
  • LWORK β€” LWORK is INTEGER. It's the length of the array WORK. LWORK must be at least NRHS, and should be at least NRHS*NB, where NB is the block size for this environment. Highkey important.
  • INFO β€” INFO is INTEGER. Exit status tea:
    • = 0: successful exit, we love to see it.
    • < 0: if INFO = -i, the i-th argument had an illegal value. Oop.

πŸ‘‘ Author πŸ‘‘

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

Definition at line 120 of file zgerqs.f.

🌈 Author 🌈

Generated automatically by Doxygen for LAPACK from the source code.


okay bestie, that's the whole page! The footer says LAPACK Version 3.12.0, and the source page is TESTING/LIN/zgerqs.f(3). Stay slay, keep your leading dimensions valid, and remember: the vibe is cute, but the constraints are fr fr. πŸ’–βœ¨πŸŽ€

πŸ“¦ where this page comes from