diff --git a/src/Numerics.Tests/PolynomialTests.cs b/src/Numerics.Tests/PolynomialTests.cs index 0d559c15..79ab2d73 100644 --- a/src/Numerics.Tests/PolynomialTests.cs +++ b/src/Numerics.Tests/PolynomialTests.cs @@ -296,14 +296,14 @@ namespace MathNet.Numerics.UnitTests { var tol = 1e-14; var p1 = new Polynomial(1.0); - var r = p1.GetRoots(); + var r = p1.Roots(); Assert.AreEqual(1, r.Length, "length mismatch"); Assert.AreEqual(1.0, r.FirstOrDefault().Real); var p2 = new Polynomial(new double[] { 1, 2 }); - var r2 = p2.GetRoots(); + var r2 = p2.Roots(); Assert.AreEqual(1, r2.Length, "length mismatch"); Assert.AreEqual(-0.5, r2.FirstOrDefault().Real, tol); @@ -333,7 +333,7 @@ namespace MathNet.Numerics.UnitTests static void TestEqual(double[] x, List eIn) { var tol = 1e-10; - var r0 = new Polynomial(x).GetRoots().ToList(); + var r0 = new Polynomial(x).Roots().ToList(); var e = eIn.OrderBy(v => v.Real).ToArray(); var r = r0.OrderBy(v => v.Real).ToArray(); diff --git a/src/Numerics/FindRoots.cs b/src/Numerics/FindRoots.cs index d8dc8963..4d101d54 100644 --- a/src/Numerics/FindRoots.cs +++ b/src/Numerics/FindRoots.cs @@ -110,6 +110,7 @@ namespace MathNet.Numerics { return RootFinding.Cubic.Roots(d, c, b, a); } + /// /// Find all roots of a polynomial by calculating the characteristic polynomial of the companion matrix /// @@ -117,7 +118,7 @@ namespace MathNet.Numerics /// the roots of the polynomial public static Complex[] Polynomial(double[] poly) { - return new Polynomial(poly).GetRoots(); + return new Polynomial(poly).Roots(); } /// diff --git a/src/Numerics/Polynomial.cs b/src/Numerics/Polynomial.cs index d79056fd..edf79b6b 100644 --- a/src/Numerics/Polynomial.cs +++ b/src/Numerics/Polynomial.cs @@ -294,7 +294,7 @@ namespace MathNet.Numerics } /// - /// substraction of two Polynomials (piecewise) + /// Subtraction of two Polynomials (piecewise) /// /// left Polynomial /// right Polynomial @@ -308,9 +308,9 @@ namespace MathNet.Numerics /// Calculates the complex roots of the Polynomial by eigenvalue decomposition /// /// a vector of complex numbers with the roots - public Complex[] GetRoots() + public Complex[] Roots() { - DenseMatrix A = GetEigValMatrix(); + DenseMatrix A = EigenvalueMatrix(); Complex[] roots; if (A == null) @@ -337,7 +337,7 @@ namespace MathNet.Numerics /// /// Eigenvalue matrix A /// this matrix is similar to the companion matrix of this polynomial, in such a way, that it's transpose is the columnflip of the companion matrix - public DenseMatrix GetEigValMatrix() + public DenseMatrix EigenvalueMatrix() { Polynomial pLoc = new Polynomial(Coefficients); pLoc.Trim();