CUNBDB(3)
π CUNBDB(3) β like, the CS-decomposition bidiagonalizer, bestie β¨
okay so real quick: this page lives at /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/cunbdb.f β that's the whole path, yes it's a lot, we don't gatekeep π and it's a <pink>Library Functions Manual</pink> situation from LAPACK 3.12.0. Let's get into it, because this one is genuinely iconic.
πΈ SYNOPSIS πΈ
Functions/Subroutines
subroutine CUNBDB (trans, signs, m, p, q, x11, ldx11, x12, ldx12, x21,
ldx21, x22, ldx22, theta, phi, taup1, taup2, tauq1, tauq2, work,
lwork, info)
CUNBDB. that's it, that's the function π«Ά
π¦ Function/Subroutine Documentation π¦
subroutine CUNBDB (character trans, character signs, integer m, integer p,
integer q, complex, dimension( ldx11, * ) x11, integer ldx11, complex,
dimension( ldx12, * ) x12, integer ldx12, complex, dimension( ldx21, * )
x21, integer ldx21, complex, dimension( ldx22, * ) x22, integer ldx22,
real, dimension( * ) theta, real, dimension( * ) phi, complex,
dimension( * ) taup1, complex, dimension( * ) taup2, complex, dimension(
* ) tauq1, complex, dimension( * ) tauq2, complex, dimension( * ) work,
integer lwork, integer info)
CUNBDB π«
β¨ Purpose β¨
!>!> CUNBDB simultaneously bidiagonalizes the blocks of an M-by-M!> partitioned unitary matrix X:!>!> [ B11 | B12 0 0 ]!> [ X11 | X12 ] [ P1 | ] [ 0 | 0 -I 0 ] [ Q1 | ]**H!> X = [-----------] = [---------] [----------------] [---------] .!> [ X21 | X22 ] [ | P2 ] [ B21 | B22 0 0 ] [ | Q2 ]!> [ 0 | 0 0 I ]!>!> X11 is P-by-Q. Q must be no larger than P, M-P, or M-Q. (If this is!> not the case, then X must be transposed and/or permuted. This can be!> done in constant time using the TRANS and SIGNS options. See CUNCSD!> for details.)!>!> The unitary matrices P1, P2, Q1, and Q2 are P-by-P, (M-P)-by-!> (M-P), Q-by-Q, and (M-Q)-by-(M-Q), respectively. They are!> represented implicitly by Householder vectors.!>!> B11, B12, B21, and B22 are Q-by-Q bidiagonal matrices represented!> implicitly by angles THETA, PHI.!>
like, the way it just takes your big unitary X and bidiagonalizes all the blocks at once?? main character energy fr fr π
π Parameters π
TRANSβTRANS is CHARACTER= 'T':X, U1, U2, V1T, and V2T are stored in row-major order;- otherwise: X, U1, U2, V1T, and V2T are stored in column-major order.
SIGNSβSIGNS is CHARACTER= 'O':The lower-left block is made nonpositive (the convention);- otherwise: The upper-right block is made nonpositive (the convention).
MβM is INTEGER. The number of rows and columns in X. πPβP is INTEGER. The number of rows in X11 and X12.0 <= P <= M.QβQ is INTEGER. The number of columns in X11 and X21.0 <= Q <= MIN(P,M-P,M-Q).X11βX11 is COMPLEX array, dimension (LDX11,Q). On entry, the top-left block of the unitary matrix to be reduced. On exit, the form depends on TRANS:- If
TRANS = 'N', then the columns oftril(X11)specify reflectors for P1, the rows oftriu(X11,1)specify reflectors for Q1; - else
TRANS = 'T', and the rows oftriu(X11)specify reflectors for P1, the columns oftril(X11,-1)specify reflectors for Q1.
- If
LDX11βLDX11 is INTEGER. The leading dimension of X11. IfTRANS = 'N', thenLDX11 >= P; elseLDX11 >= Q.X12βX12 is COMPLEX array, dimension (LDX12,M-Q). On entry, the top-right block of the unitary matrix to be reduced. On exit, the form depends on TRANS:- If
TRANS = 'N', then the rows oftriu(X12)specify the first P reflectors for Q2; - else
TRANS = 'T', and the columns oftril(X12)specify the first P reflectors for Q2.
- If
LDX12βLDX12 is INTEGER. The leading dimension of X12. IfTRANS = 'N', thenLDX12 >= P; elseLDX11 >= M-Q. (yes bestie, it saysLDX11there β that's literally what the page says, i'm just the messenger π)X21βX21 is COMPLEX array, dimension (LDX21,Q). On entry, the bottom-left block of the unitary matrix to be reduced. On exit, the form depends on TRANS:- If
TRANS = 'N', then the columns oftril(X21)specify reflectors for P2; - else
TRANS = 'T', and the rows oftriu(X21)specify reflectors for P2.
- If
LDX21βLDX21 is INTEGER. The leading dimension of X21. IfTRANS = 'N', thenLDX21 >= M-P; elseLDX21 >= Q.X22βX22 is COMPLEX array, dimension (LDX22,M-Q). On entry, the bottom-right block of the unitary matrix to be reduced. On exit, the form depends on TRANS:- If
TRANS = 'N', then the rows oftriu(X22(Q+1:M-P,P+1:M-Q))specify the last M-P-Q reflectors for Q2, - else
TRANS = 'T', and the columns oftril(X22(P+1:M-Q,Q+1:M-P))specify the last M-P-Q reflectors for P2.
- If
LDX22βLDX22 is INTEGER. The leading dimension of X22. IfTRANS = 'N', thenLDX22 >= M-P; elseLDX22 >= M-Q.THETAβTHETA is REAL array, dimension (Q). The entries of the bidiagonal blocks B11, B12, B21, B22 can be computed from the angles THETA and PHI. See Further Details. βPHIβPHI is REAL array, dimension (Q-1). The entries of the bidiagonal blocks B11, B12, B21, B22 can be computed from the angles THETA and PHI. See Further Details. βTAUP1βTAUP1 is COMPLEX array, dimension (P). The scalar factors of the elementary reflectors that define P1.TAUP2βTAUP2 is COMPLEX array, dimension (M-P). The scalar factors of the elementary reflectors that define P2.TAUQ1βTAUQ1 is COMPLEX array, dimension (Q). The scalar factors of the elementary reflectors that define Q1.TAUQ2βTAUQ2 is COMPLEX array, dimension (M-Q). The scalar factors of the elementary reflectors that define Q2.WORKβWORK is COMPLEX array, dimension (LWORK).LWORKβLWORK is INTEGER. The dimension of the array WORK.LWORK >= M-Q.
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:ifINFO = -i, the i-th argument had an illegal value.
π Author π
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
π Further Details π
!>!> The bidiagonal blocks B11, B12, B21, and B22 are represented!> implicitly by angles THETA(1), ..., THETA(Q) and PHI(1), ...,!> PHI(Q-1). B11 and B21 are upper bidiagonal, while B21 and B22 are!> lower bidiagonal. Every entry in each bidiagonal band is a product!> of a sine or cosine of a THETA with a sine or cosine of a PHI. See!> [1] or CUNCSD for details.!>!> P1, P2, Q1, and Q2 are represented as products of elementary!> reflectors. See CUNCSD for details on generating P1, P2, Q1, and Q2!> using CUNGQR and CUNGLQ.!>
π References π
[1] Brian D. Sutton. Computing the complete CS decomposition. Numer. Algorithms, 50(1):33-65, 2009.
Definition at line 284 of file cunbdb.f. π
π Author (the meta one) π
Generated automatically by Doxygen for LAPACK from the source code. beep boop, the robots made this one π€β¨
and that's the whole page bestie, you ate that π
okay so the small print: it's LAPACK, Version 3.12.0, and the source file is /home/abui...RC/cunbdb.f(3) β go forth and bidiagonalize responsibly, mwah ππ«Άπ
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms