SRC/zgsvj0.f(3)
π NAME π
Bestie, this is the page for SRC/zgsvj0.f, served fresh from the Library Functions Manual. It's the home of the zgsvj0 subroutine β aka the pre-processor bestie for zgesvj. π
β¨ SYNOPSIS β¨
π§ Functions/Subroutines π§
subroutine zgsvj0 (...)β ZGSVJ0 pre-processor for the routinezgesvj.
subroutine zgsvj0 (jobv, m, n, a, lda, d, sva, mv, v, ldv, eps, sfmin, tol, nsweep, work, lwork, info)
π Function/Subroutine Documentation π
π«Ά subroutine zgsvj0 π«Ά
subroutine zgsvj0 (character*1 jobv, integer m, integer n, complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension( n ) d, double precision, dimension( n ) sva, integer mv, complex*16, dimension( ldv, * ) v, integer ldv, double precision eps, double precision sfmin, double precision tol, integer nsweep, complex*16, dimension( lwork ) work, integer lwork, integer info)
ZGSVJ0 pre-processor for the routine zgesvj.
πΈ Purpose: πΈ
ZGSVJ0 gets called from ZGESVJ as a pre-processor β that's literally its main character purpose. It applies Jacobi rotations the same way ZGESVJ does, except it does not check convergence (the stopping criterion). A few tuning parameters (marked [TP]) are available for the implementer.
π Parameters π
π JOBV π
JOBV is CHARACTER*1
Specifies whether the output from this procedure is used to compute the matrix V:
= 'V': the product of the Jacobi rotations is accumulated by postmultiplying the N-by-N array V. (See the description of V.)= 'A': the product of the Jacobi rotations is accumulated by postmultiplying the MV-by-N array V. (See the descriptions of MV and V.)= 'N': the Jacobi rotations are not accumulated.
π M π
M is INTEGER
The number of rows of the input matrix A. M >= 0.
π N π
N is INTEGER
The number of columns of the input matrix A. M >= N >= 0.
π¦ A π¦
A is COMPLEX*16 array, dimension (LDA,N)
On entry, M-by-N matrix A, such that A*diag(D) represents the input matrix.
On exit, A_onexit * diag(D_onexit) represents the input matrix A*diag(D) post-multiplied by a sequence of Jacobi rotations, where the rotation threshold and the total number of sweeps are given in TOL and NSWEEP, respectively. (See the descriptions of D, TOL and NSWEEP.)
π¦ LDA π¦
LDA is INTEGER
The leading dimension of the array A. LDA >= max(1,M).
π§ D π§
D is COMPLEX*16 array, dimension (N)
The array D accumulates the scaling factors from the complex 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 in TOL and NSWEEP, respectively. (See the descriptions of A, TOL and NSWEEP.)
π§ SVA π§
SVA is DOUBLE PRECISION array, dimension (N)
On entry, SVA contains the Euclidean norms of the columns of the matrix A*diag(D).
On exit, SVA contains the Euclidean norms of the columns of the matrix A_onexit*diag(D_onexit).
π MV π
MV is INTEGER
- If
JOBV = 'A', then MV rows of V are post-multiplied by a sequence of Jacobi rotations. - If
JOBV = 'N', then MV is not referenced.
π V π
V is COMPLEX*16 array, dimension (LDV,N)
- If
JOBV = 'V'then N rows of V are post-multiplied by a sequence of Jacobi rotations. - If
JOBV = 'A'then MV rows of V are post-multiplied by a sequence of Jacobi rotations. - If
JOBV = 'N', then V is not referenced.
πΈ LDV πΈ
LDV is INTEGER
The leading dimension of the array V, LDV >= 1.
- If
JOBV = 'V',LDV >= N. - If
JOBV = '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
TOL is the threshold for Jacobi rotations. For a pair A(:,p), A(:,q) of pivot columns, the Jacobi rotation is applied only if ABS(COS(angle(A(:,p),A(:,q)))) > TOL.
π₯ NSWEEP π₯
NSWEEP is INTEGER
NSWEEP is the number of sweeps of Jacobi rotations to be performed.
π WORK π
WORK is COMPLEX*16 array, dimension (LWORK)
π LWORK π
LWORK is INTEGER
LWORK is the dimension of WORK. 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.
π₯ Further Details: π₯
ZGSVJ0 is used just to enable ZGESVJ to call a simplified version of itself to work on a submatrix of the original matrix.
π«Ά Contributor: π«Ά
Zlatko Drmac (Zagreb, Croatia)
π Bugs, Examples and Comments: π
Please report all bugs and send interesting test examples and comments to drmac@math.hr. Thank you.
Definition at line 216 of file zgsvj0.f.
π Author π
Generated automatically by Doxygen for LAPACK from the source code.
Okay bestie, footer check: this is LAPACK Version 3.12.0, source SRC/zgsvj0.f(3). No separate date on the footer β that's the whole tea. π
β¨
π¦ 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