SRC/clarzb.f(3)

📦
version 3.12.1 · 7 versions
, in arch rolling

🎀 clarzb — Library Functions Manual, but make it group chat 🎀

okay so bestie, we're looking at SRC/clarzb.f in the Library Functions Manual, and this routine is here to apply a block reflector or its conjugate-transpose to a general matrix. Let's get into it 💅✨

🌸 NAME 🌸

SRC/clarzb.f

✨ SYNOPSIS ✨

💫 Functions/Subroutines 💫

Here's the callable cutie:

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

CLARZB applies a block reflector or its conjugate-transpose to a general matrix. Periodt. 🫶

💅 Function/Subroutine Documentation 💅

🧚 subroutine clarzb 🧚

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

CLARZB applies a block reflector or its conjugate-transpose to a general matrix. That's the whole vibe of this routine, bestie. 💖

🎯 Purpose 🎯

okay so here's the lore: CLARZB applies a complex block reflector H or its transpose H**H to a complex distributed M-by-N C, from the left or the right. Left or right, main character choice energy. ✨

Currently, only STOREV = 'R' and DIRECT = 'B' are supported. That is not a drill, bestie — those are the supported ones right now. 💀

🧸 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 — it tells you how H is formed from a product of elementary reflectors, iykyk:

  • = 'F': H = H(1) H(2) . . . H(k) (Forward, not supported yet)
  • = 'B': H = H(k) . . . H(2) H(1) (Backward)

STOREV 🌈

STOREV is CHARACTER*1 — it tells you how the vectors that define the elementary reflectors are stored:

  • = 'C': Columnwise (not supported yet)
  • = '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).

L 🍓

L is INTEGER — the number of columns of the matrix V containing the meaningful part of the Householder reflectors. If SIDE = 'L', M >= L >= 0, if SIDE = 'R', N >= L >= 0.

V 🧚

V is COMPLEX array, dimension (LDV,NV). If STOREV = 'C', NV = K; if STOREV = 'R', NV = L.

LDV 🌟

LDV is INTEGER — the leading dimension of the array V. If STOREV = 'C', LDV >= L; if STOREV = 'R', LDV >= K.

T 👑

T is COMPLEX 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 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 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.

🎀 Contributors 🎀

  • A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, USA

🦋 Further Details 🦋

The source's !> comment here is literally empty, bestie — no extra lore in this section. It's giving minimal. 🫶

📍 Definition 📍

Definition at line 181 of file clarzb.f.

🤖 Author (auto-generated) 🤖

Generated automatically by Doxygen for LAPACK from the source code.

okay bye bestie — this page is serving LAPACK Version 3.12.0 on SRC/clarzb.f(3). The original footer didn't give a date, so we are not inventing one. No cap. Mwah 💋✨🎀

📦 where this page comes from