SRC/dgsvj1.f(3)
okay so this is SRC/dgsvj1.f(3) from the Library Functions Manual β no cap, we're diving into the DGSVJ1 pre-processor for dgesvj, and it's giving "Jacobi rotations but make it targeted" π
β¨
π NAME π
SRC/dgsvj1.f
dgsvj1 β DGSVJ1 pre-processor for the routine dgesvj, applies Jacobi rotations targeting only particular pivots. That's the whole vibe of this page, bestie π«Ά
β¨ SYNOPSIS β¨
Functions/Subroutines
subroutine dgsvj1 (jobv, m, n, n1, a, lda, d, sva, mv, v, ldv, eps,
sfmin, tol, nsweep, work, lwork, info)
DGSVJ1 pre-processor for the routine dgesvj, applies Jacobi rotations targeting only particular pivots. Yup, that's the one-line summary, and it ate π
π οΈ Function/Subroutine Documentation π οΈ
subroutine dgsvj1 (character*1 jobv, integer m, integer n, integer n1,
double precision, dimension( lda, * ) a, integer lda, double precision,
dimension( n ) d, double precision, dimension( n ) sva, integer mv,
double precision, dimension( ldv, * ) v, integer ldv, double precision
eps, double precision sfmin, double precision tol, integer nsweep,
double precision, dimension( lwork ) work, integer lwork, integer info)
DGSVJ1 pre-processor for the routine dgesvj, applies Jacobi rotations targeting only particular pivots. This is the full signature, periodt πΈ
π― Purpose
DGSVJ1 is called from DGESVJ as a pre-processor and that is its main purpose. It applies Jacobi rotations in the same way as DGESVJ does, but it targets only particular pivots and it does not check convergence (stopping criterion). Few tuning parameters (marked by [TP]) are available for the implementer π«Ά
π Further Details π
DGSVJ1 applies few sweeps of Jacobi rotations in the column space of the input M-by-N matrix A. The pivot pairs are taken from the (1,2) off-diagonal block in the corresponding N-by-N Gram matrix A^T * A. The block-entries (tiles) of the (1,2) off-diagonal block are marked by the [x]'s in the following scheme:
| * * * [x] [x] [x]|
| * * * [x] [x] [x]| Row-cycling in the nblr-by-nblc [x] blocks.
| * * * [x] [x] [x]| Row-cyclic pivoting inside each [x] block.
|[x] [x] [x] * * * |
|[x] [x] [x] * * * |
|[x] [x] [x] * * * |
In terms of the columns of A, the first N1 columns are rotated 'against' the remaining N-N1 columns, trying to increase the angle between the corresponding subspaces. The off-diagonal block is N1-by(N-N1) and it is tiled using quadratic tiles of side KBL. Here, KBL is a tuning parameter. The number of sweeps is given in NSWEEP and the orthogonality threshold is given in TOL π¦
π§ Parameters π§
JOBVβJOBV is CHARACTER*1. Specifies whether the output from this procedure is used to compute the matrixV:= 'V': the product of the Jacobi rotations is accumulated by postmultiplying the N-by-N arrayV. (See the description ofV.)= 'A': the product of the Jacobi rotations is accumulated by postmultiplying the MV-by-N arrayV. (See the descriptions ofMVandV.)= 'N': the Jacobi rotations are not accumulated.
MβM is INTEGER. The number of rows of the input matrixA.M >= 0.NβN is INTEGER. The number of columns of the input matrixA.M >= N >= 0.N1βN1 is INTEGER.N1specifies the 2 x 2 block partition, the firstN1columns are rotated 'against' the remainingN-N1columns ofA.AβA is DOUBLE PRECISION array, dimension (LDA,N). On entry, M-by-N matrixA, such thatA*diag(D)represents the input matrix. On exit,A_onexit * D_onexitrepresents the input matrixA*diag(D)post-multiplied by a sequence of Jacobi rotations, where the rotation threshold and the total number of sweeps are given inTOLandNSWEEP, respectively. (See the descriptions ofN1,D,TOLandNSWEEP.)LDAβLDA is INTEGER. The leading dimension of the arrayA.LDA >= max(1,M).DβD is DOUBLE PRECISION array, dimension (N). The arrayDaccumulates the scaling factors from the fast scaled Jacobi rotations. On entry,A*diag(D)represents the input matrix. On exit,A_onexit*diag(D_onexit)represents the input matrix post-multiplied by a sequence of Jacobi rotations, where the rotation threshold and the total number of sweeps are given inTOLandNSWEEP, respectively. (See the descriptions ofN1,A,TOLandNSWEEP.)SVAβSVA is DOUBLE PRECISION array, dimension (N). On entry,SVAcontains the Euclidean norms of the columns of the matrixA*diag(D). On exit,SVAcontains the Euclidean norms of the columns of the matrixonexit*diag(D_onexit).MVβMV is INTEGER. IfJOBV = 'A', thenMVrows ofVare post-multiplied by a sequence of Jacobi rotations. IfJOBV = 'N', thenMVis not referenced.VβV is DOUBLE PRECISION array, dimension (LDV,N). IfJOBV = 'V', thenNrows ofVare post-multiplied by a sequence of Jacobi rotations. IfJOBV = 'A', thenMVrows ofVare post-multiplied by a sequence of Jacobi rotations. IfJOBV = 'N', thenVis not referenced.LDVβLDV is INTEGER. The leading dimension of the arrayV,LDV >= 1. IfJOBV = 'V',LDV >= N. IfJOBV = 'A',LDV >= MV.EPSβEPS is DOUBLE PRECISION.EPS = DLAMCH('Epsilon').SFMINβSFMIN is DOUBLE PRECISION.SFMIN = DLAMCH('Safe Minimum').TOLβTOL is DOUBLE PRECISION.TOLis the threshold for Jacobi rotations. For a pairA(:,p),A(:,q)of pivot columns, the Jacobi rotation is applied only ifDABS(COS(angle(A(:,p),A(:,q)))) > TOL.NSWEEPβNSWEEP is INTEGER.NSWEEPis the number of sweeps of Jacobi rotations to be performed.WORKβWORK is DOUBLE PRECISION array, dimension (LWORK).LWORKβLWORK is INTEGER.LWORKis the dimension ofWORK.LWORK >= M.INFOβINFO is INTEGER.= 0: successful exit.< 0: ifINFO = -i, then the i-th argument had an illegal value.
π Author
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
πΈ Contributors
Zlatko Drmac (Zagreb, Croatia) and Kresimir Veselic (Hagen, Germany)
π§ Definition
Definition at line 234 of file dgsvj1.f.
π Author (meta edition) π
Generated automatically by Doxygen for LAPACK from the source code.
and that's the whole page, bestie! Cute little footer sign-off: LAPACK, Version 3.12.0, and the source file SRC/dgsvj1.f(3). (No date in the footer, so no invented date β just vibes.) Go forth and rotate those pivots π
β¨
π¦ 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