Commit bd18ee0e authored by Uwe Schulzweida's avatar Uwe Schulzweida
Browse files

eigen_solution_of_symmetric_matrix: removed unused parameter n_eig

parent 0b9a6a44
......@@ -452,7 +452,7 @@ void *EOFs(void * argument)
// TODO: use return status (>0 okay, -1 did not converge at all)
parallel_eigen_solution_of_symmetric_matrix(cov, eigv, n, __func__);
else
eigen_solution_of_symmetric_matrix(cov, eigv, n, n, __func__);
eigen_solution_of_symmetric_matrix(cov, eigv, n, __func__);
if ( cdoTimer ) timer_stop(timer_eig);
/* NOW: cov contains the eigenvectors, eigv the eigenvalues */
......
......@@ -391,7 +391,7 @@ void *EOF3d(void * argument)
if ( eigen_mode == JACOBI )
parallel_eigen_solution_of_symmetric_matrix(cov, eigv, n, __func__);
else
eigen_solution_of_symmetric_matrix(cov, eigv, n, n, __func__);
eigen_solution_of_symmetric_matrix(cov, eigv, n, __func__);
/* NOW: cov contains the eigenvectors, eigv the eigenvalues */
if ( cdoVerbose )
......
......@@ -46,11 +46,9 @@ int max_jacobi_iter;
#endif
void make_symmetric_matrix_triangular (double **a, int n,
double *d, double *e, const char *prompt);
void make_symmetric_matrix_triangular (double **a, int n, double *d, double *e, const char *prompt);
double pythagoras (double a, double b);
void eigen_solution_of_triangular_matrix (double *d, double *e, int n,
double **a, int n_eig, const char *prompt);
void eigen_solution_of_triangular_matrix (double *d, double *e, int n, double **a, const char *prompt);
int lu_decomposition (double **a, int n, int *index, int *sign);
void lu_backsubstitution (double **a, int n, int *index, double *b);
......@@ -63,7 +61,7 @@ static double beta_help (double a, double b, double x, const char *prompt);
void eigen_solution_of_symmetric_matrix (double **a, double *eig_val,
int n, int n_eig, const char *prompt)
int n, const char *prompt)
/* After return the rows (!!!) of a are the eigenvectors */
{
double *e;
......@@ -74,7 +72,7 @@ void eigen_solution_of_symmetric_matrix (double **a, double *eig_val,
make_symmetric_matrix_triangular (a, n, eig_val, e, prompt);
eigen_solution_of_triangular_matrix (eig_val, e, n, a, n_eig, prompt);
eigen_solution_of_triangular_matrix (eig_val, e, n, a, prompt);
free (e);
......@@ -276,7 +274,7 @@ double pythagoras (double a, double b)
#define MAX_ITER 1000
void eigen_solution_of_triangular_matrix (double *d, double *e, int n,
double **a, int n_eig, const char *prompt)
double **a, const char *prompt)
{
int i, k, l, m, iter;
double b, c, f, g, p, r, s;
......@@ -286,7 +284,7 @@ void eigen_solution_of_triangular_matrix (double *d, double *e, int n,
e[i - 1] = e[i];
e[n - 1] = 0;
for (l = 0; l < n_eig; l++)
for (l = 0; l < n; l++)
{
iter = 0;
while (1)
......
......@@ -2,7 +2,7 @@
#define _STATISTIC_H
void eigen_solution_of_symmetric_matrix (double **a, double *eig_val, int n, int n_eig, const char *prompt);
void eigen_solution_of_symmetric_matrix (double **a, double *eig_val, int n, const char *prompt);
int solution_of_linear_equation (double **a, double *b, int n);
int inverse_of_matrix (double **a, double **b, int n);
void fft(double *real, double *imag, int n, int sign);
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment