|
|
@ -50,7 +50,7 @@ void Polynomial::init(){ |
|
|
|
|
|
|
|
void Polynomial::calculateNumberOfParameters(){ |
|
|
|
double n_coef = orde + 1; |
|
|
|
for (unsigned int i = 2; i <= dim; i++) { |
|
|
|
for (unsigned int i = 2; i <= dimension; i++) { |
|
|
|
n_coef = n_coef*(orde + i)/(i - 1); |
|
|
|
} |
|
|
|
|
|
|
@ -61,7 +61,7 @@ void Polynomial::iterate() { |
|
|
|
swap(vectorNew, vectorOld); |
|
|
|
|
|
|
|
unsigned int m = 0; |
|
|
|
for ( unsigned int i = 0; i < dim; i++ ) { |
|
|
|
for ( unsigned int i = 0; i < dimension; i++ ) { |
|
|
|
|
|
|
|
#ifdef HARDDEBUG |
|
|
|
cout << "Entering new dimension: " << i << " With m = " << m << endl; |
|
|
@ -76,7 +76,7 @@ void Polynomial::iterate() { |
|
|
|
|
|
|
|
void Polynomial::recur(unsigned int curr_dimension, unsigned int prev_i, unsigned int n, unsigned int& m, double prev_product) { |
|
|
|
double product; |
|
|
|
for (unsigned int i = prev_i; i < dim; i++) { |
|
|
|
for (unsigned int i = prev_i; i < dimension; i++) { |
|
|
|
|
|
|
|
#ifdef HARDDEBUG |
|
|
|
for ( unsigned int j = 0; j < n; j++ ) |
|
|
|