/home/abui.../cunbdb4.f(3)
β¨ NAME β¨
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/cunbdb4.f β bestie, this is the source file for the CUNBDB4 routine, and this page is /home/abui.../cunbdb4.f(3) from the Library Functions Manual. Sheβs a LAPACK function with full main-character energy, no cap. π
πΈ SYNOPSIS πΈ
π Functions/Subroutines
subroutine CUNBDB4 (m, p, q, x11, ldx11, x21, ldx21, theta, phi, taup1,
taup2, tauq1, phantom, work, lwork, info)
CUNBDB4
π§ Function/Subroutine Documentation π§
subroutine CUNBDB4 (integer m, integer p, integer q, complex,
dimension(ldx11,*) x11, integer ldx11, complex, dimension(ldx21,*) x21,
integer ldx21, real, dimension(*) theta, real, dimension(*) phi,
complex, dimension(*) taup1, complex, dimension(*) taup2, complex,
dimension(*) tauq1, complex, dimension(*) phantom, complex, dimension(*)
work, integer lwork, integer info)
CUNBDB4
β¨ Purpose β¨
okay so CUNBDB4 is out here simultaneously bidiagonalizing the blocks of a tall and skinny matrix X with orthonormal columns. Itβs giving:
[ B11 ]
[ X11 ] [ P1 | ] [ 0 ]
[-----] = [---------] [-----] Q1**T .
[ X21 ] [ | P2 ] [ B21 ]
[ 0 ]
X11 is P-by-Q, and X21 is (M-P)-by-Q. M-Q must be no larger than P, M-P, or Q. Routines CUNBDB1, CUNBDB2, and CUNBDB3 handle cases in which M-Q is not the minimum dimension. π¦
The unitary matrices P1, P2, and Q1 are P-by-P, (M-P)-by-(M-P), and (M-Q)-by-(M-Q), respectively. They are represented implicitly by Householder vectors. β¨
B11 and B12 are (M-Q)-by-(M-Q) bidiagonal matrices represented implicitly by angles THETA, PHI. π
π Parameters π
MβM is INTEGER. The number of rows inX11plus the number of rows inX21.PβP is INTEGER. The number of rows inX11.0 <= P <= M.QβQ is INTEGER. The number of columns inX11andX21.0 <= Q <= MandM-Q <= min(P,M-P,Q).X11βX11 is COMPLEX array, dimension (LDX11,Q). On entry, the top block of the matrixXto be reduced. On exit, the columns oftril(X11)specify reflectors forP1and the rows oftriu(X11,1)specify reflectors forQ1.LDX11βLDX11 is INTEGER. The leading dimension ofX11.LDX11 >= P.X21βX21 is COMPLEX array, dimension (LDX21,Q). On entry, the bottom block of the matrixXto be reduced. On exit, the columns oftril(X21)specify reflectors forP2.LDX21βLDX21 is INTEGER. The leading dimension ofX21.LDX21 >= M-P.THETAβTHETA is REAL array, dimension (Q). The entries of the bidiagonal blocksB11,B21are defined byTHETAandPHI. See Further Details.PHIβPHI is REAL array, dimension (Q-1). The entries of the bidiagonal blocksB11,B21are defined byTHETAandPHI. See Further Details.TAUP1βTAUP1 is COMPLEX array, dimension (M-Q). The scalar factors of the elementary reflectors that defineP1.TAUP2βTAUP2 is COMPLEX array, dimension (M-Q). The scalar factors of the elementary reflectors that defineP2.TAUQ1βTAUQ1 is COMPLEX array, dimension (Q). The scalar factors of the elementary reflectors that defineQ1.PHANTOMβPHANTOM is COMPLEX array, dimension (M). The routine computes anM-by-1column vectorYthat is orthogonal to the columns of[ X11; X21 ].PHANTOM(1:P)andPHANTOM(P+1:M)contain Householder vectors forY(1:P)andY(P+1:M), respectively.WORKβWORK is COMPLEX array, dimension (LWORK).LWORKβLWORK is INTEGER. The dimension of the arrayWORK.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, thei-th argument had an illegal value.
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π¦ Further Details π¦
The upper-bidiagonal blocks B11, B21 are represented implicitly by angles THETA(1), ..., THETA(Q) and PHI(1), ..., PHI(Q-1). 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, and Q1 are represented as products of elementary reflectors. See CUNCSD2BY1 for details on generating P1, P2, and Q1 using CUNGQR and CUNGLQ. π«Ά
π References π
[1] Brian D. Sutton. Computing the complete CS decomposition. Numer. Algorithms, 50(1):33-65, 2009.
β Definition at line β
Definition at line 210 of file cunbdb4.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
later bestie! π This page was brought to you by LAPACK Version 3.12.0 and /home/abui.../cunbdb4.f(3) β slay, periodt. πβ¨
π¦ 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