Class SVD
- java.lang.Object
-
- gov.nih.mipav.model.structures.jama.SVD
-
- All Implemented Interfaces:
java.io.Serializable
public class SVD extends java.lang.Object implements java.io.Serializable
- See Also:
- Serialized Form
-
-
Field Summary
Fields Modifier and Type Field Description (package private) GeneralizedEigenvalue
ge
(package private) GeneralizedInverse2
gi
private int[]
iparms
private ViewUserInterface
UI
Common variables in testing routines.
-
Constructor Summary
Constructors Constructor Description SVD()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description private void
ddrvbd(int nsizes, int[] mm, int[] nn, int ntypes, boolean[] dotype, int[] iseed, double thresh, double[][] A, int lda, double[][] U, int ldu, double[][] VT, int ldvt, double[][] ASAV, double[][] USAV, double[][] VTSAV, double[] s, double[] ssav, double[] e, double[] work, int lwork, int[] iwork, int[] info)
void
ddrvbd_test()
This routine is an extraction from the FORTRAN program version 3.4.1 DCHKEE of the code needed to drive ddrvbd in order to run ddrvbd in order to test the singular value decomposition driver dgesvd.private void
derred()
void
dgesvd(char jobu, char jobvt, int m, int n, double[][] A, int lda, double[] s, double[][] U, int ldu, double[][] VT, int ldvt, double[] work, int lwork, int[] info)
private void
dort03(char rc, int mu, int mv, int n, int k, double[][] U, int ldu, double[][] V, int ldv, double[] work, int lwork, double[] result, int[] info)
void
xlaenv(int ispec, int nvalue)
This is a port of version 3.1 LAPACK auxiliary routine XLAENV.
-
-
-
Field Detail
-
ge
GeneralizedEigenvalue ge
-
gi
GeneralizedInverse2 gi
-
UI
private ViewUserInterface UI
Common variables in testing routines.
-
iparms
private int[] iparms
-
-
Method Detail
-
ddrvbd_test
public void ddrvbd_test()
This routine is an extraction from the FORTRAN program version 3.4.1 DCHKEE of the code needed to drive ddrvbd in order to run ddrvbd in order to test the singular value decomposition driver dgesvd. Numerical values were obtained from the svd.in datafile. Original DCHKEE created by Univ. of Tennessee, Univ. of California Berkeley, University of Colorado Denver, and NAG Ltd., April, 2012
-
derred
private void derred()
-
ddrvbd
private void ddrvbd(int nsizes, int[] mm, int[] nn, int ntypes, boolean[] dotype, int[] iseed, double thresh, double[][] A, int lda, double[][] U, int ldu, double[][] VT, int ldvt, double[][] ASAV, double[][] USAV, double[][] VTSAV, double[] s, double[] ssav, double[] e, double[] work, int lwork, int[] iwork, int[] info)
-
dort03
private void dort03(char rc, int mu, int mv, int n, int k, double[][] U, int ldu, double[][] V, int ldv, double[] work, int lwork, double[] result, int[] info)
-
dgesvd
public void dgesvd(char jobu, char jobvt, int m, int n, double[][] A, int lda, double[] s, double[][] U, int ldu, double[][] VT, int ldvt, double[] work, int lwork, int[] info)
-
xlaenv
public void xlaenv(int ispec, int nvalue)
This is a port of version 3.1 LAPACK auxiliary routine XLAENV. Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. November 2006 .. Scalar Arguments .. INTEGER ISPEC, NVALUE .. Purpose ======= XLAENV sets certain machine- and problem-dependent quantities which will later be retrieved by ILAENV. Arguments ========= ISPEC (input) INTEGER Specifies the parameter to be set in the COMMON array IPARMS. = 1: the optimal blocksize; if this value is 1, an unblocked algorithm will give the best performance. = 2: the minimum block size for which the block routine should be used; if the usable block size is less than this value, an unblocked routine should be used. = 3: the crossover point (in a block routine, for N less than this value, an unblocked routine should be used) = 4: the number of shifts, used in the nonsymmetric eigenvalue routines = 5: the minimum column dimension for blocking to be used; rectangular blocks must have dimension at least k by m, where k is given by ILAENV(2,...) and m by ILAENV(5,...) = 6: the crossover point for the SVD (when reducing an m by n matrix to bidiagonal form, if max(m,n)/min(m,n) exceeds this value, a QR factorization is used first to reduce the matrix to a triangular form) = 7: the number of processors = 8: another crossover point, for the multishift QR and QZ methods for nonsymmetric eigenvalue problems. = 9: maximum size of the subproblems at the bottom of the computation tree in the divide-and-conquer algorithm (used by xGELSD and xGESDD) =10: ieee NaN arithmetic can be trusted not to trap =11: infinity arithmetic can be trusted not to trap NVALUE (input) INTEGER The value of the parameter specified by ISPEC.
-
-