ZGSVJ0(3)
π ZGSVJ0(3) π
okay bestie, this is the zgsvj0.f(3) page from the Library Functions Manual β¨ it's giving source-file realness, and we're keeping every detail cute and intact.
π NAME π
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zgsvj0.f
that's the NAME section, bestie β just the path, no extra lore π
π¦ SYNOPSIS π¦
π§ Functions/Subroutines π§
subroutine ZGSVJ0 (jobv, m, n, a, lda, d, sva, mv, v, ldv, eps, sfmin,
tol, nsweep, work, lwork, info)
ZGSVJ0 pre-processor for the routine zgesvj.
π Function/Subroutine Documentation π
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 is called from ZGESVJ as a pre-processor and that is its main purpose. It applies Jacobi rotations in the same way as ZGESVJ does, but it does not check convergence (stopping criterion). Few tuning parameters (marked by [TP]) are available for the implementer.
π Parameters π
JOBVβ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βINTEGER. The number of rows of the input matrix A.M >= 0.NβINTEGER. The number of columns of the input matrix A.M >= N >= 0.AβCOMPLEX*16array, dimension(LDA,N). On entry, M-by-N matrix A, such thatA*diag(D)represents the input matrix. On exit,A_onexit * diag(D_onexit)represents 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 of D, TOL and NSWEEP.)LDAβINTEGER. The leading dimension of the array A.LDA >= max(1,M).DβCOMPLEX*16array, 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 inTOLandNSWEEP, respectively. (See the descriptions of A, TOL and NSWEEP.)SVAβDOUBLE PRECISIONarray, dimension(N). On entry, SVA contains the Euclidean norms of the columns of the matrixA*diag(D). On exit, SVA contains the Euclidean norms of the columns of the matrixA_onexit*diag(D_onexit).MVβINTEGER. IfJOBV = 'A', then MV rows of V are post-multiplied by a sequence of Jacobi rotations. IfJOBV = 'N', then MV is not referenced.VβCOMPLEX*16array, dimension(LDV,N). IfJOBV = 'V'then N rows of V are post-multiplied by a sequence of Jacobi rotations. IfJOBV = 'A'then MV rows of V are post-multiplied by a sequence of Jacobi rotations. IfJOBV = 'N', then V is not referenced.LDVβINTEGER. The leading dimension of the array V,LDV >= 1. IfJOBV = 'V',LDV >= N. IfJOBV = 'A',LDV >= MV.EPSβDOUBLE PRECISION.EPS = DLAMCH('Epsilon').SFMINβDOUBLE PRECISION.SFMIN = DLAMCH('Safe Minimum').TOLβDOUBLE PRECISION. TOL is the threshold for Jacobi rotations. For a pairA(:,p),A(:,q)of pivot columns, the Jacobi rotation is applied only ifABS(COS(angle(A(:,p),A(:,q)))) > TOL.NSWEEPβINTEGER. NSWEEP is the number of sweeps of Jacobi rotations to be performed.WORKβCOMPLEX*16array, dimension(LWORK).LWORKβINTEGER. LWORK is the dimension of WORK.LWORK >= M.INFOβ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 that's the whole thing, bestie π«Ά footer tea: LAPACK, Version 3.12.0, page /home/abui...RC/zgsvj0.f(3). There's no extra date printed on this one, so I'm not inventing one β 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