DORMQL(3)
π DORMQL β the LAPACK page, but make it make sense π
Okay bestie, so this is a page from LAPACK (yes, that LAPACK, the linear-algebra royalty π), and it lives at:
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dormql.f
And before you ask β yes, it's a .f file, it's Fortran, no we're not scared of it, we're built different. π
β¨ SYNOPSIS β¨
Functions/Subroutines
Here's the whole cast list, literally one subroutine and it's the main character:
subroutine DORMQL (side, trans, m, n, k, a, lda, tau, c, ldc, work, lwork, info)
DORMQL
That's it. That's the synopsis. She's lowkey mysterious like that. π
π¦ Function/Subroutine Documentation π¦
Okay so here's the full signature, look at all these arguments, she's thriving:
subroutine DORMQL (character side, character trans, integer m, integer n,
integer k, double precision, dimension( lda, * ) a, integer lda, double
precision, dimension( * ) tau, double precision, dimension( ldc, * ) c,
integer ldc, double precision, dimension( * ) work, integer lwork,
integer info)
DORMQL
πΈ Purpose πΈ
Bestie, gather round. DORMQL overwrites the general real M-by-N matrix C with:
SIDE = 'L' SIDE = 'R'
TRANS = 'N': Q * C C * Q
TRANS = 'T': Q**T * C C * Q**T
...where Q is a real orthogonal matrix defined as the product of k elementary reflectors:
Q = H(k) . . . H(2) H(1)
...as returned by DGEQLF. And Q is of order M if SIDE = 'L' and of order N if SIDE = 'R'. No cap, that's the whole vibe check. π¦
π Parameters π
Okay this is the part where you take notes, bestie, because every single one of these matters and I'm not letting you skip any.
SIDEβSIDEisCHARACTER*1. It's giving direction.= 'L': applyQorQ**Tfrom the Left;= 'R': applyQorQ**Tfrom the Right.
TRANSβTRANSisCHARACTER*1. This one's about flipping, not direction.= 'N': No transpose, applyQ;= 'T': Transpose, applyQ**T.
MβMisINTEGER. The number of rows of the matrixC. Requirement:M >= 0. (Zero is allowed, she's inclusive. β¨)NβNisINTEGER. The number of columns of the matrixC. Requirement:N >= 0. Same deal.KβKisINTEGER. The number of elementary reflectors whose product defines the matrixQ. So:- If
SIDE = 'L', thenM >= K >= 0; - if
SIDE = 'R', thenN >= K >= 0.
- If
Respect the bracket, it's non-negotiable. π«Ά
AβAisDOUBLE PRECISION array, dimension (LDA,K). The i-th column must contain the vector which defines the elementary reflectorH(i), fori = 1,2,...,k, as returned byDGEQLFin the lastkcolumns of its array argumentA. She comes pre-filled by her ex (DGEQLF), that's just how it is. πLDAβLDAisINTEGER. The leading dimension of the arrayA.- If
SIDE = 'L',LDA >= max(1,M); - if
SIDE = 'R',LDA >= max(1,N).
- If
TAUβTAUisDOUBLE PRECISION array, dimension (K).TAU(i)must contain the scalar factor of the elementary reflectorH(i), as returned byDGEQLF. Scalar factor = the little β¨magic numberβ¨ per reflector.CβCisDOUBLE PRECISION array, dimension (LDC,N).- On entry: the M-by-N matrix
C. - On exit:
Cis overwritten byQ*CorQ**T*CorC*Q**TorC*Q.
- On entry: the M-by-N matrix
Heads up: C does not survive this. She gets overwritten, that's the whole function of the function. Do not come crying to me about your original matrix later. π
LDCβLDCisINTEGER. The leading dimension of the arrayC. Requirement:LDC >= max(1,M).WORKβWORKisDOUBLE PRECISION array, dimension (MAX(1,LWORK)).- On exit, if
INFO = 0,WORK(1)returns the optimalLWORK. She's self-aware, she tells you what she wants. π
- On exit, if
LWORKβLWORKisINTEGER. The dimension of the arrayWORK.- If
SIDE = 'L',LWORK >= max(1,N); - if
SIDE = 'R',LWORK >= max(1,M). - For good performance,
LWORKshould generally be larger. (Bigger workspace = bigger slay. π₯) - > Special mode: if
LWORK = -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. So you get the answer without getting yelled at. Iconic.
- If
INFOβINFOisINTEGER. The receipts:= 0: successful exit π< 0: ifINFO = -i, the i-th argument had an illegal value π
π Author π
Take a bow, academic institutions:
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 165 of file dormql.f. (Yes, line 165, we counted, we're thorough like that. π
)
β Author β
This page was generated automatically by Doxygen for LAPACK from the source code. Not a human, just Doxygen doing her little autogenerated thing. π€β¨
And that's the whole page, bestie β a whole LAPACK function documented and understood. This one's from LAPACK, Version 3.12.0, and it lives at /home/abui...RC/dormql.f(3) if you ever need to find her again. Obsessed with us for getting through all thirteen parameters together. 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