DORMLQ(3)

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

πŸ’œ dormlq.f(3) β€” LAPACK manual, section 3 πŸŽ€

okay bestie, welcome to the dormlq.f page from the LAPACK library functions manual ✨. The full path situation is /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dormlq.f β€” that's literally the file we're out here documenting, no cap πŸ™ˆ.


✨ NAME ✨

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dormlq.f β€” yes the NAME section is just the whole file path, she's that kind of girl πŸ’….


🌸 SYNOPSIS 🌸

Functions/Subroutines

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

πŸ’– Function/Subroutine Documentation πŸ’–

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

DORMLQ πŸ‘‘ (iconic name, no notes)

πŸ¦‹ Purpose πŸ¦‹

ok so listen πŸ‘‚ β€” DORMLQ overwrites the general real M-by-N matrix C with:

                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(k) . . . H(2) H(1)

as returned by DGELQF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. and that's the whole vibe check βœ…

🧚 Parameters 🧚

girl, buckle up, there's a lot of them and they all matter:

  • 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 DOUBLE PRECISION 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 DGELQF in the first 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 DOUBLE PRECISION array, dimension (K). TAU(i) must contain the scalar factor of the elementary reflector H(i), as returned by DGELQF.
  • C β€” C is DOUBLE PRECISION 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. (she gets replaced, main character energy honestly 😭)
  • LDC β€” LDC is INTEGER. The leading dimension of the array C. LDC >= max(1,M).
  • WORK β€” WORK is DOUBLE PRECISION 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.
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. 🩡 (a little spy-mission mode, iykyk)
  • 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 165 of file dormlq.f. πŸ“


🌈 Author 🌈

Generated automatically by Doxygen for LAPACK from the source code. (the robots wrote the docs, we just gave them flair πŸ€–πŸ’…)


LAPACK Β· Version 3.12.0 Β· /home/abui...RC/dormlq.f(3) β€” okay that's the whole page bestie, go forth and multiply your matrices, xoxo πŸ“πŸ¦‹πŸ’œ

πŸ“¦ where this page comes from