This is a major reworking of this interpolator.

The interpolation code in template.c is now split up into subfunctions
(in common/, Lagrange/, and Hermite/), so it should now compile in
finite cpu/memory even with optimization.


git-svn-id: http://svn.cactuscode.org/arrangements/CactusBase/LocalInterp/trunk@115 df1f8a13-aa1d-4dd4-9681-27ded5b42416

1 files changed, 0 insertions, 16 deletions

diff --git a/src/GeneralizedPolynomial-Uniform/Lagrange/1d.coeffs/1d.cube.order3.smooth0/coeff-I.compute.c b/src/GeneralizedPolynomial-Uniform/Lagrange/1d.coeffs/1d.cube.order3.smooth0/coeff-I.compute.c
deleted file mode 100644
index 2df6cd1..0000000
--- a/src/GeneralizedPolynomial-Uniform/Lagrange/1d.coeffs/1d.cube.order3.smooth0/coeff-I.compute.c
+++ /dev/null
@@ -1,16 +0,0 @@
-fp t10,
-   t9,
-   t8,
-   t7,
-   t6,
-   t5;
-      t10 = x*x;
-      t9 = x*t10;
-      t8 = RATIONAL(-1.0,2.0);
-      t7 = RATIONAL(1.0,2.0);
-      t6 = RATIONAL(-1.0,6.0);
-      t5 = t7*t10;
-      coeff_I_m1 = RATIONAL(-1.0,3.0)*x+t5+t6*t9;
-      coeff_I_0 = RATIONAL(1.0,1.0)+t8*x-t10+t7*t9;
-      coeff_I_p1 = x+t5+t8*t9;
-      coeff_I_p2 = t6*x+RATIONAL(1.0,6.0)*t9;