.TH "cgsvj1.f" 3 "Tue Nov 14 2017" "Version 3.8.0" "LAPACK" \" -*- nroff -*- .ad l .nh .SH NAME cgsvj1.f .SH SYNOPSIS .br .PP .SS "Functions/Subroutines" .in +1c .ti -1c .RI "subroutine \fBcgsvj1\fP (JOBV, M, \fBN\fP, N1, A, \fBLDA\fP, D, SVA, MV, V, LDV, EPS, SFMIN, TOL, NSWEEP, WORK, LWORK, INFO)" .br .RI "\fBCGSVJ1\fP pre-processor for the routine cgesvj, applies Jacobi rotations targeting only particular pivots\&. " .in -1c .SH "Function/Subroutine Documentation" .PP .SS "subroutine cgsvj1 (character*1 JOBV, integer M, integer N, integer N1, complex, dimension( lda, * ) A, integer LDA, complex, dimension( n ) D, real, dimension( n ) SVA, integer MV, complex, dimension( ldv, * ) V, integer LDV, real EPS, real SFMIN, real TOL, integer NSWEEP, complex, dimension( lwork ) WORK, integer LWORK, integer INFO)" .PP \fBCGSVJ1\fP pre-processor for the routine cgesvj, applies Jacobi rotations targeting only particular pivots\&. .PP \fBPurpose: \fP .RS 4 .PP .nf CGSVJ1 is called from CGESVJ as a pre-processor and that is its main purpose. It applies Jacobi rotations in the same way as CGESVJ does, but it targets only particular pivots and it does not check convergence (stopping criterion). Few tunning parameters (marked by [TP]) are available for the implementer. Further Details ~~~~~~~~~~~~~~~ CGSVJ1 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 tunning parmeter. The number of sweeps is given in NSWEEP and the orthogonality threshold is given in TOL. .fi .PP .RE .PP \fBParameters:\fP .RS 4 \fIJOBV\fP .PP .nf 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 postmulyiplying the N-by-N array V. (See the description of V.) = 'A': the product of the Jacobi rotations is accumulated by postmulyiplying the MV-by-N array V. (See the descriptions of MV and V.) = 'N': the Jacobi rotations are not accumulated. .fi .PP .br \fIM\fP .PP .nf M is INTEGER The number of rows of the input matrix A. M >= 0. .fi .PP .br \fIN\fP .PP .nf N is INTEGER The number of columns of the input matrix A. M >= N >= 0. .fi .PP .br \fIN1\fP .PP .nf N1 is INTEGER N1 specifies the 2 x 2 block partition, the first N1 columns are rotated 'against' the remaining N-N1 columns of A. .fi .PP .br \fIA\fP .PP .nf A is COMPLEX array, dimension (LDA,N) On entry, M-by-N matrix A, such that A*diag(D) represents the input matrix. On exit, A_onexit * 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 N1, D, TOL and NSWEEP.) .fi .PP .br \fILDA\fP .PP .nf LDA is INTEGER The leading dimension of the array A. LDA >= max(1,M). .fi .PP .br \fID\fP .PP .nf D is COMPLEX array, dimension (N) The array D accumulates 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 in TOL and NSWEEP, respectively. (See the descriptions of N1, A, TOL and NSWEEP.) .fi .PP .br \fISVA\fP .PP .nf SVA is REAL 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 onexit*diag(D_onexit). .fi .PP .br \fIMV\fP .PP .nf MV is INTEGER If JOBV .EQ. 'A', then MV rows of V are post-multipled by a sequence of Jacobi rotations. If JOBV = 'N', then MV is not referenced. .fi .PP .br \fIV\fP .PP .nf V is COMPLEX array, dimension (LDV,N) If JOBV .EQ. 'V' then N rows of V are post-multipled by a sequence of Jacobi rotations. If JOBV .EQ. 'A' then MV rows of V are post-multipled by a sequence of Jacobi rotations. If JOBV = 'N', then V is not referenced. .fi .PP .br \fILDV\fP .PP .nf LDV is INTEGER The leading dimension of the array V, LDV >= 1. If JOBV = 'V', LDV .GE. N. If JOBV = 'A', LDV .GE. MV. .fi .PP .br \fIEPS\fP .PP .nf EPS is REAL EPS = SLAMCH('Epsilon') .fi .PP .br \fISFMIN\fP .PP .nf SFMIN is REAL SFMIN = SLAMCH('Safe Minimum') .fi .PP .br \fITOL\fP .PP .nf TOL is REAL 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)))) .GT. TOL. .fi .PP .br \fINSWEEP\fP .PP .nf NSWEEP is INTEGER NSWEEP is the number of sweeps of Jacobi rotations to be performed. .fi .PP .br \fIWORK\fP .PP .nf WORK is COMPLEX array, dimension (LWORK) .fi .PP .br \fILWORK\fP .PP .nf LWORK is INTEGER LWORK is the dimension of WORK. LWORK .GE. M. .fi .PP .br \fIINFO\fP .PP .nf INFO is INTEGER = 0 : successful exit. < 0 : if INFO = -i, then the i-th argument had an illegal value .fi .PP .RE .PP \fBAuthor:\fP .RS 4 Univ\&. of Tennessee .PP Univ\&. of California Berkeley .PP Univ\&. of Colorado Denver .PP NAG Ltd\&. .RE .PP \fBDate:\fP .RS 4 June 2016 .RE .PP \fBContributor: \fP .RS 4 Zlatko Drmac (Zagreb, Croatia) .RE .PP .PP Definition at line 238 of file cgsvj1\&.f\&. .SH "Author" .PP Generated automatically by Doxygen for LAPACK from the source code\&.