larfb(3)

πŸŽ€ NAME πŸŽ€

larfb(3) β€” straight from the Library Functions Manual β€” is all about larfb: apply block Householder reflector. Bestie, it’s giving block-reflector main character energy. πŸ’…βœ¨


✨ SYNOPSIS ✨

🧚 Functions

🌸 clarfb 🌸

       subroutine clarfb (side, trans, direct, storev, m, n, k, v, ldv, t, ldt,
           c, ldc, work, ldwork)

CLARFB applies a block reflector or its conjugate-transpose to a general rectangular matrix.

πŸ¦‹ dlarfb πŸ¦‹

       subroutine dlarfb (side, trans, direct, storev, m, n, k, v, ldv, t, ldt,
           c, ldc, work, ldwork)

DLARFB applies a block reflector or its transpose to a general rectangular matrix.

πŸŽ€ slarfb πŸŽ€

       subroutine slarfb (side, trans, direct, storev, m, n, k, v, ldv, t, ldt,
           c, ldc, work, ldwork)

SLARFB applies a block reflector or its transpose to a general rectangular matrix.

πŸ’œ zlarfb πŸ’œ

       subroutine zlarfb (side, trans, direct, storev, m, n, k, v, ldv, t, ldt,
           c, ldc, work, ldwork)

ZLARFB applies a block reflector or its conjugate-transpose to a general rectangular matrix.


🌈 Detailed Description 🌈

Okay so this is the detailed part, and the function docs are right below. Buckle up, bestie β€” there’s a lot of literal parameter tea here. πŸ“


πŸ’– Function Documentation πŸ’–

🌸 subroutine clarfb 🌸

   subroutine clarfb (character side, character trans, character direct,
       character storev, integer m, integer n, integer k, complex, dimension(
       ldv, * ) v, integer ldv, complex, dimension( ldt, * ) t, integer ldt,
       complex, dimension( ldc, * ) c, integer ldc, complex, dimension( ldwork,
       * ) work, integer ldwork)

CLARFB applies a block reflector or its conjugate-transpose to a general rectangular matrix.

✨ Purpose

CLARFB applies a complex block reflector H or its transpose H**H to a complex M-by-N matrix C, from either the left or the right. πŸ’–

🌸 Parameters

  • SIDE β€” CHARACTER*1. 'L' means apply H or H**H from the Left; 'R' means apply H or H**H from the Right. 🫢
  • TRANS β€” CHARACTER*1. 'N' means apply H (No transpose); 'C' means apply H**H (Conjugate transpose). πŸ’…
  • DIRECT β€” CHARACTER*1. This tells you how H is formed from a product of elementary reflectors: 'F' gives H = H(1) H(2) . . . H(k) (Forward); 'B' gives H = H(k) . . . H(2) H(1) (Backward). ✨
  • STOREV β€” CHARACTER*1. This tells you how the vectors which define the elementary reflectors are stored: 'C' means Columnwise; 'R' means Rowwise. πŸ¦‹
  • M β€” INTEGER. The number of rows of the matrix C. πŸ“
  • N β€” INTEGER. The number of columns of the matrix C. πŸ“
  • K β€” INTEGER. The order of the matrix T (= the number of elementary reflectors whose product defines the block reflector). If SIDE = 'L', M >= K >= 0; if SIDE = 'R', N >= K >= 0. πŸ‘‘
  • V β€” COMPLEX array, dimension (LDV,K) if STOREV = 'C'; (LDV,M) if STOREV = 'R' and SIDE = 'L'; (LDV,N) if STOREV = 'R' and SIDE = 'R'. The matrix V. See Further Details. 🌟
  • LDV β€” INTEGER. The leading dimension of the array V. If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M); if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N); if STOREV = 'R', LDV >= K. 🎯
  • T β€” COMPLEX array, dimension (LDT,K). The triangular K-by-K matrix T in the representation of the block reflector. πŸ”₯
  • LDT β€” INTEGER. The leading dimension of the array T. LDT >= K. 🧚
  • C β€” COMPLEX array, dimension (LDC,N). On entry, the M-by-N matrix C. On exit, C is overwritten by H*C or H**H*C or C*H or C*H**H. 😭
  • LDC β€” INTEGER. The leading dimension of the array C. LDC >= max(1,M). πŸ’€
  • WORK β€” COMPLEX array, dimension (LDWORK,K). πŸ“
  • LDWORK β€” INTEGER. The leading dimension of the array WORK. If SIDE = 'L', LDWORK >= max(1,N); if SIDE = 'R', LDWORK >= max(1,M). 🌈

πŸ‘‘ Author

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

πŸ”₯ Further Details

The shape of the matrix V and the storage of the vectors which define the H(i) is best illustrated by the following example with n = 5 and k = 3. The triangular part of V (including its diagonal) is not referenced. πŸ’–

  DIRECT = 'F' and STOREV = 'C':         DIRECT = 'F' and STOREV = 'R':

               V = (  1       )                 V = (  1 v1 v1 v1 v1 )
                   ( v1  1    )                     (     1 v2 v2 v2 )
                   ( v1 v2  1 )                     (        1 v3 v3 )
                   ( v1 v2 v3 )
                   ( v1 v2 v3 )

  DIRECT = 'B' and STOREV = 'C':         DIRECT = 'B' and STOREV = 'R':

               V = ( v1 v2 v3 )                 V = ( v1 v1  1       )
                   ( v1 v2 v3 )                     ( v2 v2 v2  1    )
                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
                   (     1 v3 )
                   (        1 )

Definition at line 194 of file clarfb.f. πŸŽ€


πŸ”₯ subroutine dlarfb πŸ”₯

   subroutine dlarfb (character side, character trans, character direct,
       character storev, integer m, integer n, integer k, double precision,
       dimension( ldv, * ) v, integer ldv, double precision, dimension( ldt, *
       ) t, integer ldt, double precision, dimension( ldc, * ) c, integer ldc,
       double precision, dimension( ldwork, * ) work, integer ldwork)

DLARFB applies a block reflector or its transpose to a general rectangular matrix.

✨ Purpose

DLARFB applies a real block reflector H or its transpose H**T to a real m by n matrix C, from either the left or the right. πŸ’œ

πŸ¦‹ Parameters

  • SIDE β€” CHARACTER*1. 'L' means apply H or H**T from the Left; 'R' means apply H or H**T from the Right. 🫢
  • TRANS β€” CHARACTER*1. 'N' means apply H (No transpose); 'T' means apply H**T (Transpose). πŸ’…
  • DIRECT β€” CHARACTER*1. This tells you how H is formed from a product of elementary reflectors: 'F' gives H = H(1) H(2) . . . H(k) (Forward); 'B' gives H = H(k) . . . H(2) H(1) (Backward). ✨
  • STOREV β€” CHARACTER*1. This tells you how the vectors which define the elementary reflectors are stored: 'C' means Columnwise; 'R' means Rowwise. πŸ¦‹
  • M β€” INTEGER. The number of rows of the matrix C. πŸ“
  • N β€” INTEGER. The number of columns of the matrix C. πŸ“
  • K β€” INTEGER. The order of the matrix T (= the number of elementary reflectors whose product defines the block reflector). If SIDE = 'L', M >= K >= 0; if SIDE = 'R', N >= K >= 0. πŸ‘‘
  • V β€” DOUBLE PRECISION array, dimension (LDV,K) if STOREV = 'C'; (LDV,M) if STOREV = 'R' and SIDE = 'L'; (LDV,N) if STOREV = 'R' and SIDE = 'R'. The matrix V. See Further Details. 🌟
  • LDV β€” INTEGER. The leading dimension of the array V. If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M); if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N); if STOREV = 'R', LDV >= K. 🎯
  • T β€” DOUBLE PRECISION array, dimension (LDT,K). The triangular k by k matrix T in the representation of the block reflector. πŸ”₯
  • LDT β€” INTEGER. The leading dimension of the array T. LDT >= K. 🧚
  • C β€” DOUBLE PRECISION array, dimension (LDC,N). On entry, the m by n matrix C. On exit, C is overwritten by H*C or H**T*C or C*H or C*H**T. 😭
  • LDC β€” INTEGER. The leading dimension of the array C. LDC >= max(1,M). πŸ’€
  • WORK β€” DOUBLE PRECISION array, dimension (LDWORK,K). πŸ“
  • LDWORK β€” INTEGER. The leading dimension of the array WORK. If SIDE = 'L', LDWORK >= max(1,N); if SIDE = 'R', LDWORK >= max(1,M). 🌈

πŸ‘‘ Author

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

πŸ”₯ Further Details

okay so here’s the visual, bestie β€” the shape of V and how the vectors that define the H(i) are stored is literally best illustrated by this example with n = 5 and k = 3. The triangular part of V (diagonal included) is not referenced, so don’t come for it πŸ’…

DIRECT = 'F' and STOREV = 'C':         DIRECT = 'F' and STOREV = 'R':

             V = (  1       )                 V = (  1 v1 v1 v1 v1 )
                 ( v1  1    )                     (     1 v2 v2 v2 )
                 ( v1 v2  1 )                     (        1 v3 v3 )
                 ( v1 v2 v3 )
                 ( v1 v2 v3 )

DIRECT = 'B' and STOREV = 'C':         DIRECT = 'B' and STOREV = 'R':

             V = ( v1 v2 v3 )                 V = ( v1 v1  1       )
                 ( v1 v2 v3 )                     ( v2 v2 v2  1    )
                 (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
                 (     1 v3 )
                 (        1 )
Definition at line 194 of file dlarfb.f.

πŸ’– subroutine slarfb

subroutine slarfb (character side, character trans, character direct,
    character storev, integer m, integer n, integer k, real, dimension( ldv,
    * ) v, integer ldv, real, dimension( ldt, * ) t, integer ldt, real,
    dimension( ldc, * ) c, integer ldc, real, dimension( ldwork, * ) work,
    integer ldwork)

SLARFB applies a block reflector or its transpose to a general rectangular matrix. Real ones only, bestie β€” this is the REAL girlie πŸ’…

✨ Purpose

SLARFB applies a real block reflector H or its transpose H**T to a real m by n matrix C, from either the left or the right.

🫢 Parameters

  • SIDE β€” SIDE is CHARACTER*1. = 'L': apply H or H**T from the Left. = 'R': apply H or H**T from the Right.
  • TRANS β€” TRANS is CHARACTER*1. = 'N': apply H (No transpose). = 'T': apply H**T (Transpose).
  • DIRECT β€” DIRECT is CHARACTER*1. Tells you how H is formed from a product of elementary reflectors. = 'F': H = H(1) H(2) . . . H(k) (Forward). = 'B': H = H(k) . . . H(2) H(1) (Backward).
  • STOREV β€” STOREV is CHARACTER*1. Tells you how the vectors which define the elementary reflectors are stored. = 'C': Columnwise. = 'R': Rowwise.
  • M β€” M is INTEGER. The number of rows of the matrix C.
  • N β€” N is INTEGER. The number of columns of the matrix C.
  • K β€” K is INTEGER. The order of the matrix T (= the number of elementary reflectors whose product defines the block reflector). If SIDE = 'L', M >= K >= 0; if SIDE = 'R', N >= K >= 0.
  • V β€” V is REAL array, dimension (LDV,K) if STOREV = 'C'; (LDV,M) if STOREV = 'R' and SIDE = 'L'; (LDV,N) if STOREV = 'R' and SIDE = 'R'. The matrix V. See Further Details.
  • LDV β€” LDV is INTEGER. The leading dimension of the array V. If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M); if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N); if STOREV = 'R', LDV >= K.
  • T β€” T is REAL array, dimension (LDT,K). The triangular k by k matrix T in the representation of the block reflector.
  • LDT β€” LDT is INTEGER. The leading dimension of the array T. LDT >= K.
  • C β€” C is REAL array, dimension (LDC,N). On entry, the m by n matrix C. On exit, C is overwritten by H*C or H**T*C or C*H or C*H**T.
  • LDC β€” LDC is INTEGER. The leading dimension of the array C. LDC >= max(1,M).
  • WORK β€” WORK is REAL array, dimension (LDWORK,K).
  • LDWORK β€” LDWORK is INTEGER. The leading dimension of the array WORK. If SIDE = 'L', LDWORK >= max(1,N); if SIDE = 'R', LDWORK >= max(1,M).

πŸ’Œ Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

πŸ¦‹ Further Details

The shape of the matrix V and the storage of the vectors which define the H(i) is best illustrated by the following example with n = 5 and k = 3. The triangular part of V (including its diagonal) is not referenced.

DIRECT = 'F' and STOREV = 'C':         DIRECT = 'F' and STOREV = 'R':

             V = (  1       )                 V = (  1 v1 v1 v1 v1 )
                 ( v1  1    )                     (     1 v2 v2 v2 )
                 ( v1 v2  1 )                     (        1 v3 v3 )
                 ( v1 v2 v3 )
                 ( v1 v2 v3 )

DIRECT = 'B' and STOREV = 'C':         DIRECT = 'B' and STOREV = 'R':

             V = ( v1 v2 v3 )                 V = ( v1 v1  1       )
                 ( v1 v2 v3 )                     ( v2 v2 v2  1    )
                 (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
                 (     1 v3 )
                 (        1 )
Definition at line 194 of file slarfb.f.

🌈 subroutine zlarfb

subroutine zlarfb (character side, character trans, character direct,
    character storev, integer m, integer n, integer k, complex*16,
    dimension( ldv, * ) v, integer ldv, complex*16, dimension( ldt, * ) t,
    integer ldt, complex*16, dimension( ldc, * ) c, integer ldc, complex*16,
    dimension( ldwork, * ) work, integer ldwork)

ZLARFB applies a block reflector or its conjugate-transpose to a general rectangular matrix. And yes, she’s COMPLEX*16 β€” we’re in our complex era πŸ”₯

✨ Purpose

ZLARFB applies a complex block reflector H or its transpose H**H to a complex M-by-N matrix C, from either the left or the right.

🫢 Parameters

  • SIDE β€” SIDE is CHARACTER*1. = 'L': apply H or H**H from the Left. = 'R': apply H or H**H from the Right.
  • TRANS β€” TRANS is CHARACTER*1. = 'N': apply H (No transpose). = 'C': apply H**H (Conjugate transpose).
  • DIRECT β€” DIRECT is CHARACTER*1. Indicates how H is formed from a product of elementary reflectors. = 'F': H = H(1) H(2) . . . H(k) (Forward). = 'B': H = H(k) . . . H(2) H(1) (Backward).
  • STOREV β€” STOREV is CHARACTER*1. Indicates how the vectors which define the elementary reflectors are stored. = 'C': Columnwise. = 'R': Rowwise.
  • M β€” M is INTEGER. The number of rows of the matrix C.
  • N β€” N is INTEGER. The number of columns of the matrix C.
  • K β€” K is INTEGER. The order of the matrix T (= the number of elementary reflectors whose product defines the block reflector). If SIDE = 'L', M >= K >= 0; if SIDE = 'R', N >= K >= 0.
  • V β€” V is COMPLEX*16 array, dimension (LDV,K) if STOREV = 'C'; (LDV,M) if STOREV = 'R' and SIDE = 'L'; (LDV,N) if STOREV = 'R' and SIDE = 'R'. See Further Details.
  • LDV β€” LDV is INTEGER. The leading dimension of the array V. If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M); if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N); if STOREV = 'R', LDV >= K.
  • T β€” T is COMPLEX*16 array, dimension (LDT,K). The triangular K-by-K matrix T in the representation of the block reflector.
  • LDT β€” LDT is INTEGER. The leading dimension of the array T. LDT >= K.
  • C β€” C is COMPLEX*16 array, dimension (LDC,N). On entry, the M-by-N matrix C. On exit, C is overwritten by H*C or H**H*C or C*H or C*H**H.
  • LDC β€” LDC is INTEGER. The leading dimension of the array C. LDC >= max(1,M).
  • WORK β€” WORK is COMPLEX*16 array, dimension (LDWORK,K).
  • LDWORK β€” LDWORK is INTEGER. The leading dimension of the array WORK. If SIDE = 'L', LDWORK >= max(1,N); if SIDE = 'R', LDWORK >= max(1,M).

πŸ’Œ Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

🌸 Further Details

okay so bestie, the shape of the matrix V and the storage of the vectors which define the H(i) is best illustrated by this example with n = 5 and k = 3. and lowkey important: the triangular part of V (including its diagonal) is not referenced β€” don't @ me, that's just how it is πŸ’…

           !>  DIRECT = 'F' and STOREV = 'C':         DIRECT = 'F' and STOREV = 'R':
           !>
           !>               V = (  1       )                 V = (  1 v1 v1 v1 v1 )
           !>                   ( v1  1    )                     (     1 v2 v2 v2 )
           !>                   ( v1 v2  1 )                     (        1 v3 v3 )
           !>                   ( v1 v2 v3 )
           !>                   ( v1 v2 v3 )
           !>
           !>  DIRECT = 'B' and STOREV = 'C':         DIRECT = 'B' and STOREV = 'R':
           !>
           !>               V = ( v1 v2 v3 )                 V = ( v1 v1  1       )
           !>                   ( v1 v2 v3 )                     ( v2 v2 v2  1    )
           !>                   (  1 v2 v3 )                     ( v3 v3 v3 v3  1 )
           !>                   (     1 v3 )
           !>                   (        1 )
           !>

πŸ“ oh and btw, the definition is at line 194 of file zlarfb.f β€” slay.

πŸ‘‘ AUTHOR πŸ‘‘

this whole page was generated automatically by Doxygen for LAPACK from the source code. no cap, the robots did it πŸ’…βœ¨


anyway bestie, that's the whole page! it's from LAPACK Version 3.12.0, and the page is larfb(3) β€” stay iconic πŸ’–πŸ¦‹πŸŒΈ

πŸ“¦ where this page comes from