public class SVDC extends Object
for (i = 0; i < n; i++)rather than
for (i = 1; i <= n; i++)To use the "_j" routines you will have to fill elements 0 through n - 1 rather than elements 1 through n. Versions of these programs that use FORTRAN style indexing are also available. They end with the suffix "_f77". This class was translated by a statistician from FORTRAN versions of the LINPACK routines. It is NOT an official translation. When public domain Java numerical analysis routines become available from the people who produce LAPACK, then THE CODE PRODUCED BY THE NUMERICAL ANALYSTS SHOULD BE USED. Meanwhile, if you have suggestions for improving this code, please contact Steve Verrill at email@example.com.
|Constructor and Description|
|Modifier and Type||Method and Description|
This method decomposes a n by p matrix X into a product UDV´ where ...
public static void dsvdc_j(double x, int n, int p, double s, double e, double u, double v, double work, int job) throws SVDCException
x- The matrix to be decomposed
n- The number of rows of X
p- The number of columns of X
s- The singular values of X
e- See the documentation in the code
u- The left singular vectors
v- The right singular vectors
work- A work array
job- See the documentation in the code
Copyright © 2015–2017 Fiji. All rights reserved.