diff --git a/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs b/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs
new file mode 100644
index 00000000..226c1874
--- /dev/null
+++ b/src/UnitTests/InterpolationTests/EquidistantPolynomialTest.cs
@@ -0,0 +1,91 @@
+// <copyright file="EquidistantPolynomialTest.cs" company="Math.NET">
+// Math.NET Numerics, part of the Math.NET Project
+// http://numerics.mathdotnet.com
+// http://github.com/mathnet/mathnet-numerics
+// http://mathnetnumerics.codeplex.com
+//
+// Copyright (c) 2002-2011 Math.NET
+//
+// Permission is hereby granted, free of charge, to any person
+// obtaining a copy of this software and associated documentation
+// files (the "Software"), to deal in the Software without
+// restriction, including without limitation the rights to use,
+// copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the
+// Software is furnished to do so, subject to the following
+// conditions:
+//
+// The above copyright notice and this permission notice shall be
+// included in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+// OTHER DEALINGS IN THE SOFTWARE.
+// </copyright>
+
+namespace MathNet.Numerics.UnitTests.InterpolationTests
+{
+    using Interpolation;
+    using Interpolation.Algorithms;
+    using NUnit.Framework;
+
+    [TestFixture]
+    public class EquidistantPolynomialTest
+    {
+        const double _tmin = 0.0, _tmax = 4.0;
+        readonly double[] _x = new[] { 0.0, 3.0, 2.5, 1.0, 3.0 };
+
+        /// <summary>
+        /// Verifies that the interpolation matches the given value at all the provided sample points.
+        /// </summary>
+        [Test]
+        public void FitsAtSamplePoints()
+        {
+            IInterpolation interpolation = new EquidistantPolynomialInterpolation(_tmin, _tmax, _x);
+
+            for (int i = 0; i < _x.Length; i++)
+            {
+                Assert.AreEqual(_x[i], interpolation.Interpolate(i), "A Exact Point " + i);
+            }
+        }
+
+        /// <summary>
+        /// Verifies that at points other than the provided sample points, the interpolation matches the one computed by Maple as a reference.
+        /// </summary>
+        /// <remarks>
+        /// Maple:
+        /// with(CurveFitting);
+        /// evalf(subs({x=0.1},PolynomialInterpolation([[0,0],[1,3],[2,2.5],[3,1],[4,3]], x)),20);
+        /// </remarks>
+        [Test, Sequential]
+        public void FitsAtArbitraryPointsWithMaple(
+            [Values(0.1, 0.4, 1.1, 3.2, 4.5, 10.0, -10.0)] double t,
+            [Values(.487425, 1.6968, 3.081925, .9408, 7.265625, 592.5, 657.5)] double x,
+            [Values(1e-15, 1e-15, 1e-15, 1e-15, 1e-14, 1e-10, 1e-9)] double maxAbsoluteError)
+        {
+            IInterpolation interpolation = new EquidistantPolynomialInterpolation(_tmin, _tmax, _x);
+
+            Assert.AreEqual(x, interpolation.Interpolate(t), maxAbsoluteError, "Interpolation at {0}", t);
+        }
+
+        /// <summary>
+        /// Verifies that the interpolation supports the linear case appropriately
+        /// </summary>
+        [Test]
+        public void SupportsLinearCase([Values(2, 4, 12)] int samples)
+        {
+            double[] x, y, xtest, ytest;
+            LinearInterpolationCase.Build(out x, out y, out xtest, out ytest, samples);
+            IInterpolation interpolation = new EquidistantPolynomialInterpolation(x, y);
+            for (int i = 0; i < xtest.Length; i++)
+            {
+                Assert.AreEqual(ytest[i], interpolation.Interpolate(xtest[i]), 1e-12, "Linear with {0} samples, sample {1}", samples, i);
+            }
+        }
+    }
+}
diff --git a/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs b/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs
index bb8ce994..1fa95190 100644
--- a/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs
+++ b/src/UnitTests/InterpolationTests/NevillePolynomialTest.cs
@@ -1,4 +1,4 @@
-// <copyright file="InterpolationTest.cs" company="Math.NET">
+// <copyright file="NevillePolynomialTest.cs" company="Math.NET">
 // Math.NET Numerics, part of the Math.NET Project
 // http://numerics.mathdotnet.com
 // http://github.com/mathnet/mathnet-numerics
@@ -48,9 +48,8 @@ namespace MathNet.Numerics.UnitTests.InterpolationTests
         {
             IInterpolation interpolation = new NevillePolynomialInterpolation(_t, _x);
 
-            for (int i = 0; i < _t.Length; i++)
+            for (int i = 0; i < _x.Length; i++)
             {
-                // verify the interpolated values exactly at the sample points.
                 Assert.AreEqual(_x[i], interpolation.Interpolate(_t[i]), "A Exact Point " + i);
 
                 double interpolatedValue;
diff --git a/src/UnitTests/UnitTests.csproj b/src/UnitTests/UnitTests.csproj
index 7ca5578b..33698d77 100644
--- a/src/UnitTests/UnitTests.csproj
+++ b/src/UnitTests/UnitTests.csproj
@@ -113,7 +113,8 @@
     <Compile Include="IntegralTransformsTests\MatchingNaiveTransformTest.cs" />
     <Compile Include="IntegralTransformsTests\ParsevalTheoremTest.cs" />
     <Compile Include="IntegrationTests\IntegrationTest.cs" />
-    <Compile Include="InterpolationTests\InterpolationTest.cs" />
+    <Compile Include="InterpolationTests\EquidistantPolynomialTest.cs" />
+    <Compile Include="InterpolationTests\NevillePolynomialTest.cs" />
     <Compile Include="InterpolationTests\LinearInterpolationCase.cs" />
     <Compile Include="LinearAlgebraProviderTests\Double\LinearAlgebraProviderTests.cs">
       <SubType>Code</SubType>