unmlq(3)

πŸ¦‹ unmlq(3) β€” {un,or}mlq: multiply by Q from gelqf πŸ¦‹

okay bestie, this is the unmlq(3) page from the Library Functions Manual, and it's giving "four LAPACK routines, one very specific mission" energy. No cap: this is part 1, and it's all about multiplying by Q from gelqf. Let's go ✨

πŸ“ NAME πŸ“

unmlq β€” {un,or}mlq: multiply by Q from gelqf.

✨ SYNOPSIS ✨

🧚 Functions

subroutine cunmlq (side, trans, m, n, k, a, lda, tau, c, ldc, work,
    lwork, info)
    CUNMLQ
subroutine dormlq (side, trans, m, n, k, a, lda, tau, c, ldc, work,
    lwork, info)
    DORMLQ
subroutine sormlq (side, trans, m, n, k, a, lda, tau, c, ldc, work,
    lwork, info)
    SORMLQ
subroutine zunmlq (side, trans, m, n, k, a, lda, tau, c, ldc, work,
    lwork, info)
    ZUNMLQ

πŸ¦‹ Detailed Description πŸ¦‹

This is where the page gets into the actual routines, bestie β€” the Function Documentation below is the main character energy ✨

πŸ”₯ Function Documentation πŸ”₯

πŸ‘‘ subroutine cunmlq πŸ‘‘

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

CUNMLQ

🌸 Purpose

Bestie, CUNMLQ overwrites the general complex M-by-N matrix C with

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

where Q is a complex unitary matrix defined as the product of k elementary reflectors

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

as returned by CGELQF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'.

πŸŽ€ Parameters

  • SIDE β€” SIDE is CHARACTER*1
    • = 'L': apply Q or Q**H from the Left;
    • = 'R': apply Q or Q**H from the Right.
  • TRANS β€” TRANS is CHARACTER*1
    • = 'N': No transpose, apply Q;
    • = 'C': Conjugate transpose, apply Q**H.
  • 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 COMPLEX 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 CGELQF 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 COMPLEX array, dimension (K). TAU(i) must contain the scalar factor of the elementary reflector H(i), as returned by CGELQF.
  • C β€” C is COMPLEX array, dimension (LDC,N). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q.
  • LDC β€” LDC is INTEGER. The leading dimension of the array C. LDC >= max(1,M).
  • WORK β€” WORK is COMPLEX 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.
  • 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 cunmlq.f.


πŸ‘‘ subroutine dormlq πŸ‘‘

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

🌸 Purpose

Bestie, 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'.

πŸŽ€ 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 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.
  • 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.
  • 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.


πŸ‘‘ subroutine sormlq πŸ‘‘

subroutine sormlq (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)

SORMLQ

🌸 Purpose

Bestie, SORMLQ 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 SGELQF. Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'.

πŸŽ€ 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 SGELQF 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 β€” bestie, part 2 picks up right here with the TAU tea β˜•
  • TAU β€” REAL array, dimension (K). TAU(i) has to hold the scalar factor of the elementary reflector H(i), exactly like SGELQF handed it to you. No improvising, bestie πŸ’…
  • C β€” REAL array, dimension (LDC,N). On entry? The M-by-N matrix C. On exit? It's been overwritten by Q*C or Q**T*C or C*Q**T or C*Q. She's a main character who reinvents herself, okay πŸ¦‹
  • LDC β€” INTEGER, the leading dimension of the array C. Constraint: LDC >= max(1,M). Respect the boundary, girl πŸŽ€
  • WORK β€” REAL array, dimension (MAX(1,LWORK)). On exit, if INFO = 0, then WORK(1) gives you back the optimal LWORK. A little thank-you note in slot one ✨
  • LWORK β€” INTEGER, the dimension of the array WORK.
    • If SIDE = 'L', then LWORK >= max(1,N)
    • If SIDE = 'R', then LWORK >= max(1,M)
    • For good performance, LWORK should generally be larger. Like, be generous, she thrives 🫢
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. It's a vibe check, not a full commit 😌
  • INFO β€” 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 sormlq.f.


🧚 subroutine zunmlq (character side, character trans, integer m, integer n, integer k, complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension( * ) tau, complex*16, dimension( ldc, * ) c, integer ldc, complex*16, dimension( * ) work, integer lwork, integer info)

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

🌸 ZUNMLQ

πŸ’– Purpose:

ZUNMLQ overwrites the general complex M-by-N matrix C with:

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

where Q is a complex unitary matrix defined as the product of k elementary reflectors:

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

as returned by ZGELQF. Like, Q is of order M if SIDE = 'L', and of order N if SIDE = 'R'. Depends on the side, and honestly? Relatable 🌈


✨ Parameters

  • SIDE β€” CHARACTER*1
    • = 'L': apply Q or Q**H from the Left
    • = 'R': apply Q or Q**H from the Right

Pick a side, any side πŸ’…

  • TRANS β€” CHARACTER*1
    • = 'N': No transpose, apply Q
    • = 'C': Conjugate transpose, apply Q**H
  • M β€” INTEGER, the number of rows of the matrix C. Constraint: M >= 0.
  • N β€” INTEGER, the number of columns of the matrix C. Constraint: N >= 0.
  • K β€” INTEGER, the number of elementary reflectors whose product defines the matrix Q.
    • If SIDE = 'L', then M >= K >= 0
    • If SIDE = 'R', then N >= K >= 0

Boundaries: respected πŸ“

  • A β€” COMPLEX*16 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 ZGELQF in the first k rows of its array argument A. So like… don't rearrange her rows, she was already perfect 😭

  • LDA β€” INTEGER, the leading dimension of the array A. Constraint: LDA >= max(1,K).
  • TAU β€” COMPLEX*16 array, dimension (K). TAU(i) must contain the scalar factor of the elementary reflector H(i), as returned by ZGELQF. Same energy as above, just complex now πŸ’œ
  • C β€” COMPLEX*16 array, dimension (LDC,N). On entry, the M-by-N matrix C. On exit, C is overwritten by Q*C or Q**H*C or C*Q**H or C*Q.
  • LDC β€” INTEGER, the leading dimension of the array C. Constraint: LDC >= max(1,M).
  • WORK β€” COMPLEX*16 array, dimension (MAX(1,LWORK)). On exit, if INFO = 0, then WORK(1) returns the optimal LWORK. Iconic little receipt 🧾
  • LWORK β€” INTEGER, the dimension of the array WORK.
    • If SIDE = 'L', then LWORK >= max(1,N)
    • If SIDE = 'R', then LWORK >= max(1,M)
    • For good performance, LWORK should generally be larger. Bigger workspace, better life ⭐
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. Just peeking, not touching πŸ™ˆ
  • INFO β€” 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 zunmlq.f.


🫢 Author

Generated automatically by Doxygen for LAPACK from the source code.


Ok bestie, that's the whole page πŸ’– This one was auto-generated by Doxygen for LAPACK straight from the source code β€” LAPACK, Version 3.12.0, filed under unmlq(3). Go forth and apply your reflectors correctly, no cap πŸ‘‘πŸŒΈ
πŸ“¦ where this page comes from