SRC/sormrq.f(3)

🌸 NAME 🌸

Bestie, welcome to SRC/sormrq.f(3) from the Library Functions Manual β€” the source file is SRC/sormrq.f, and the subroutine living here is SORMRQ. It’s giving iconic linear-algebra behavior. πŸ’–


✨ SYNOPSIS ✨

πŸ¦‹ Functions/Subroutines πŸ¦‹

subroutine sormrq (side, trans, m, n, k, a, lda, tau, c, ldc, work,
    lwork, info)

SORMRQ


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

subroutine sormrq (character side, character trans, integer m, integer n,
    integer k, real, dimension( lda, * ) a, integer lda, real, dimension( *
    ) tau, real, dimension( ldc, * ) c, integer ldc, real, dimension( * )
    work, integer lwork, integer info)

SORMRQ

πŸŽ€ Purpose πŸŽ€

Okay so SORMRQ overwrites the general real M-by-N matrix C with one of these four looks:

                SIDE = 'L'     SIDE = 'R'
TRANS = 'N':      Q * C          C * Q
TRANS = 'T':      Q**T * C       C * Q**T

where Q is a real orthogonal matrix defined as the product of k elementary reflectors:

Q = H(1) H(2) . . . H(k)

as returned by SGERQF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. No cap. 🌈

🧚 Parameters 🧚

  • SIDE β€” SIDE is CHARACTER*1
    • = 'L': apply Q or Q**T from the Left;
    • = 'R': apply Q or Q**T from the Right.
  • TRANS β€” TRANS is CHARACTER*1
    • = 'N': No transpose, apply Q;
    • = 'T': Transpose, apply Q**T.
  • M β€” M is INTEGER. The number of rows of the matrix C. M >= 0.
  • N β€” N is INTEGER. The number of columns of the matrix C. N >= 0.
  • K β€” K is INTEGER. The number of elementary reflectors whose product defines the matrix Q. If SIDE = 'L', M >= K >= 0; if SIDE = 'R', N >= K >= 0.
  • A β€” A is REAL array, dimension
    • (LDA,M) if SIDE = 'L',
    • (LDA,N) if SIDE = 'R'.

The i-th row must contain the vector which defines the elementary reflector H(i), for i = 1,2,...,k, as returned by SGERQF in the last k rows of its array argument A.

  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,K).
  • TAU β€” TAU is REAL array, dimension (K). TAU(i) must contain the scalar factor of the elementary reflector H(i), as returned by SGERQF.
  • C β€” C is REAL array, dimension (LDC,N). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C or Q**T*C or C*Q**T or C*Q.
  • LDC β€” LDC is INTEGER. The leading dimension of the array C. LDC >= max(1,M).
  • WORK β€” WORK is REAL 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. If SIDE = 'L', LWORK >= max(1,N); if SIDE = 'R', LWORK >= max(1,M). For good performance, LWORK should generally be larger.
Heads up, bestie: 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. πŸ’€
  • 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.

Definition at line 166 of file sormrq.f.


🌈 Author 🌈

Generated automatically by Doxygen for LAPACK from the source code.


That’s the whole vibe, bestie β€” source SRC/sormrq.f(3), LAPACK Version 3.12.0. Mwah πŸ’‹βœ¨

πŸ“¦ where this page comes from