SRC/dorgtsqr_row.f(3)
π NAME π
okay so bestie, you're looking at SRC/dorgtsqr_row.f(3) β that's the page title β from the Library Functions Manual (manual name folded in right here like a little name tag π«Ά). It's the whole SRC/dorgtsqr_row.f situation, and we're about to get into it.
β¨ SYNOPSIS β¨
π Functions/Subroutines π
subroutine dorgtsqr_row (m, n, mb, nb, a, lda, t, ldt, work, lwork, info)β the function call, exactly as it appears, no cap.DORGTSQR_ROWis the name on the group chat.
π Function/Subroutine Documentation π
π subroutine dorgtsqr_row π
subroutine dorgtsqr_row (integer m, integer n, integer mb, integer nb,
double precision, dimension( lda, * ) a, integer lda, double precision,
dimension( ldt, * ) t, integer ldt, double precision, dimension( * )
work, integer lwork, integer info)
DORGTSQR_ROW
πΈ Purpose πΈ
DORGTSQR_ROW generates an M-by-N real matrix Q_out with orthonormal columns from the output of DLATSQR. These N orthonormal columns are the first N columns of a product of complex unitary matrices Q(k)_in of order M, which are returned by DLATSQR in a special format.
It's giving:
Q_out = first_N_columns_of( Q(1)_in * Q(2)_in * ... * Q(k)_in ).
The input matrices Q(k)_in are stored in row and column blocks in A. See the documentation of DLATSQR for more details on the format of Q(k)_in, where each Q(k)_in is represented by block Householder transformations. This routine calls an auxiliary routine DLARFB_GETT, where the computation is performed on each individual block. The algorithm first sweeps NB-sized column blocks from the right to left starting in the bottom row block and continues to the top row block (hence _ROW in the routine name). This sweep is in reverse order of the order in which DLATSQR generates the output blocks.
π Parameters π
MβMisINTEGER. The number of rows of the matrixA.M >= 0. β¨NβNisINTEGER. The number of columns of the matrixA.M >= N >= 0. πMBβMBisINTEGER. The row block size used byDLATSQRto return arraysAandT.MB > N. (Note that ifMB > M, thenMis used instead ofMBas the row block size). π«ΆNBβNBisINTEGER. The column block size used byDLATSQRto return arraysAandT.NB >= 1. (Note that ifNB > N, thenNis used instead ofNBas the column block size). πΈAβAisDOUBLE PRECISIONarray, dimension(LDA,N).- On entry: The elements on and above the diagonal are not used as input. The elements below the diagonal represent the unit lower-trapezoidal blocked matrix
Vcomputed byDLATSQRthat defines the input matricesQ_in(k)(ones on the diagonal are not stored). SeeDLATSQRfor more details. - On exit: The array
Acontains anM-by-Northonormal matrixQ_out, i.e the columns ofAare orthogonal unit vectors.
- On entry: The elements on and above the diagonal are not used as input. The elements below the diagonal represent the unit lower-trapezoidal blocked matrix
LDAβLDAisINTEGER. The leading dimension of the arrayA.LDA >= max(1,M). πTβTisDOUBLE PRECISIONarray, dimension(LDT, N * NIRB)where:
NIRB = Number_of_input_row_blocks
= MAX( 1, CEIL((M-N)/(MB-N)) )
Let NICB = Number_of_input_col_blocks = CEIL(N/NB).
The upper-triangular block reflectors used to define the input matrices Q_in(k), k=(1:NIRB*NICB). The block reflectors are stored in compact form in NIRB block reflector sequences. Each of the NIRB block reflector sequences is stored in a larger NB-by-N column block of T and consists of NICB smaller NB-by-NB upper-triangular column blocks. See DLATSQR for more details on the format of T.
LDTβLDTisINTEGER. The leading dimension of the arrayT.LDT >= max(1,min(NB,N)). π¦WORKβ (workspace)DOUBLE PRECISIONarray, dimension(MAX(1,LWORK)). On exit, ifINFO = 0,WORK(1)returns the optimalLWORK. βLWORKβLWORKisINTEGER. The dimension of the arrayWORK.LWORK >= NBLOCAL * MAX(NBLOCAL,(N-NBLOCAL)), whereNBLOCAL=MIN(NB,N). 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βINFOisINTEGER.= 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.
π§ Contributors π§
November 2020, Igor Kozachenko, Computer Science Division, University of California, Berkeley.
Definition at line 187 of file dorgtsqr_row.f.
π«Ά Author π«Ά
Generated automatically by Doxygen for LAPACK from the source code.
and that's the vibe check, bestie. Footer sign-off tea: LAPACK β Version 3.12.0 β page SRC/dorgtsqr_row.f(3). No separate date was printed, so I'm not inventing one. Periodt. π
β¨
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms