/home/abui.../dorbdb1.f(3)
Hey bestie! ๐ This is the dorbdb1.f(3) page from the Library Functions Manual, and itโs literally all about DORBDB1. Itโs giving old-school LAPACK, but make it group chat. ๐ซถ
๐ NAME ๐
The NAME is a whole path, no cap:
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dorbdb1.f
Yes, thatโs the file. Iconic. ๐
โจ SYNOPSIS โจ
๐ง Functions/Subroutines ๐ง
Hereโs the short subroutine vibe:
subroutine DORBDB1 (m, p, q, x11, ldx11, x21, ldx21, theta, phi, taup1,
taup2, tauq1, work, lwork, info)
DORBDB1
๐ Function/Subroutine Documentation ๐
Hereโs the full typed signature, bestie:
subroutine DORBDB1 (integer m, integer p, integer q, double precision,
dimension(ldx11,*) x11, integer ldx11, double precision,
dimension(ldx21,*) x21, integer ldx21, double precision, dimension(*)
theta, double precision, dimension(*) phi, double precision,
dimension(*) taup1, double precision, dimension(*) taup2, double
precision, dimension(*) tauq1, double precision, dimension(*) work,
integer lwork, integer info)
DORBDB1
๐ฆ Purpose ๐ฆ
DORBDB1 simultaneously bidiagonalizes the blocks of a tall and skinny matrix X with orthonormal columns. The whole energy is this:
[ B11 ]
[ X11 ] [ P1 | ] [ 0 ]
[-----] = [---------] [-----] Q1**T .
[ X21 ] [ | P2 ] [ B21 ]
[ 0 ]
X11 is P-by-Q, and X21 is (M-P)-by-Q. Q must be no larger than P, M-P, or M-Q. Routines DORBDB2, DORBDB3, and DORBDB4 handle cases in which Q is not the minimum dimension. ๐ซ
The orthogonal 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 Q-by-Q bidiagonal matrices represented implicitly by angles THETA, PHI. Obsessed. โจ
๐ธ Parameters ๐ธ
MโM is INTEGER. The number of rowsX11plus 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 <= MIN(P,M-P,M-Q).X11โX11 is DOUBLE PRECISION 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 DOUBLE PRECISION 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 DOUBLE PRECISION array, dimension (Q). The entries of the bidiagonal blocksB11,B21are defined byTHETAandPHI. See Further Details.PHIโPHI is DOUBLE PRECISION array, dimension (Q-1). The entries of the bidiagonal blocksB11,B21are defined byTHETAandPHI. See Further Details.TAUP1โTAUP1 is DOUBLE PRECISION array, dimension (P). The scalar factors of the elementary reflectors that defineP1.TAUP2โTAUP2 is DOUBLE PRECISION array, dimension (M-P). The scalar factors of the elementary reflectors that defineP2.TAUQ1โTAUQ1 is DOUBLE PRECISION array, dimension (Q). The scalar factors of the elementary reflectors that defineQ1.WORKโWORK is DOUBLE PRECISION array, dimension (LWORK).LWORKโLWORK is INTEGER. The dimension of the arrayWORK.LWORK >= M-Q. IfLWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of theWORKarray, returns this value as the first entry of theWORKarray, and no error message related toLWORKis issued byXERBLA. ๐ซกINFOโINFO is INTEGER.= 0: successful exit.< 0: ifINFO = -i, thei-th argument had an illegal value.
๐ซถ Author ๐ซถ
These legends wrote it:
- 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 DORCSD for details. ๐ง
P1, P2, and Q1 are represented as products of elementary reflectors. See DORCSD2BY1 for details on generating P1, P2, and Q1 using DORGQR and DORGLQ. ๐
๐ References ๐
[1] Brian D. Sutton. Computing the complete CS decomposition. Numer. Algorithms, 50(1):33-65, 2009. ๐
Definition at line 201 of file dorbdb1.f. โญ
๐ Author ๐
Generated automatically by Doxygen for LAPACK from the source code.
Thatโs the whole page, bestie! ๐ This footer is LAPACK Version 3.12.0, footer path /home/abui.../dorbdb1.f(3), and thereโs no date line in this copy โ so no invented date, periodt. Byeee! ๐
โจ
๐ฆ 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