Polynomial equation is an equation of the form f(x) = a0+a1·x+a2·x2+...+an·xn = 0. Although encountered less frequently than systems of linear equations (or nonlinear systems), polynomial equations still arise in some situations and still need solvers.
ALGLIB has polynomial solver which utilizes companion matrix method (eigendecomposition of NxN matrix) and returns both real and complex roots of the polynomial. This functionality is implemented by polynomialsolve function of polynomialsolver subpackage.
Note #1
Polynomial equations are inherently unstable. It is very hard to find precise solutions even for moderate values of N (even N=10 can be problematic).
If your problem involves solution of high-degree polynomial equation, we recommend you to try reformulating it in a way which avoids polynomials.
This article is licensed for personal use only.
ALGLIB Project offers you two editions of ALGLIB:
ALGLIB Free Edition:
+delivered for free
+offers full set of numerical functionality
+extensive algorithmic optimizations
-no multithreading
-non-commercial license
ALGLIB Commercial Edition:
+flexible pricing
+offers full set of numerical functionality
+extensive algorithmic optimizations
+high performance (SMP, SIMD)
+commercial license with support plan
Links to download sections for Free and Commercial editions can be found below: