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, 18 deletions

diff --git a/src/GeneralizedPolynomial-Uniform/Lagrange/2d.coeffs/2d.cube.order1.smooth0/coeff-I.compute.c b/src/GeneralizedPolynomial-Uniform/Lagrange/2d.coeffs/2d.cube.order1.smooth0/coeff-I.compute.c
deleted file mode 100644
index 221b33b..0000000
--- a/src/GeneralizedPolynomial-Uniform/Lagrange/2d.coeffs/2d.cube.order1.smooth0/coeff-I.compute.c
+++ /dev/null
@@ -1,18 +0,0 @@
-fp t7,
-   t6,
-   t5,
-   t4,
-   t3,
-   t2,
-   t1;
-      t7 = RATIONAL(-1.0,2.0);
-      t6 = RATIONAL(1.0,4.0);
-      t5 = RATIONAL(1.0,2.0);
-      t4 = t7*y;
-      t3 = t7*x;
-      t2 = t5*x;
-      t1 = t5*y;
-      coeff_I_0_0 = RATIONAL(3.0,4.0)+t4+t3;
-      coeff_I_p1_0 = t6+t4+t2;
-      coeff_I_0_p1 = t3+t6+t1;
-      coeff_I_p1_p1 = t1+RATIONAL(-1.0,4.0)+t2;