Polynomial Root Finder
Find all real and complex roots of any polynomial up to degree 20 instantly. Uses the Aberth-Ehrlich simultaneous root-finding method with Newton-Raphson polishing for 14+ decimal places of accuracy. Shows factored form, residual verification, and separates real from complex roots — free, private, and no signup required.
Enter the coefficients of any polynomial up to degree 20 and find all real and complex roots numerically using the Aberth-Ehrlich method with Newton-Raphson polishing. All calculations run locally in your browser — no signup required.
Why Use Our Polynomial Root Finder?
Instant Polynomial Root Finding
Enter coefficients for any polynomial up to degree 20 and find all real and complex roots instantly. The polynomial root finder uses the Aberth-Ehrlich method to find all roots simultaneously, then polishes each root with Newton-Raphson to 14+ decimal places of accuracy.
Secure Polynomial Root Finder Online
The polynomial root finder runs entirely client-side in your browser. Your coefficients and results are never sent to any server, stored, or tracked — complete privacy for academic, engineering, and research calculations.
Polynomial Root Finder — No Installation
Use the polynomial root finder directly in any modern browser with no downloads, apps, or plugins required. Load example polynomials with one click, see real and complex roots separately, and copy any root value — 100% free forever.
Real & Complex Roots with Residual Verification
The polynomial root finder separates real and complex roots, shows the factored form of the polynomial, and displays the residual |p(x)| for each root — so you can verify accuracy. Complex roots always appear in conjugate pairs for real-coefficient polynomials.
Common Use Cases for Polynomial Root Finder
Engineering & Control Systems
Control engineers find the poles and zeros of transfer functions by solving characteristic polynomials. The polynomial root finder handles high-degree polynomials from Laplace transforms and Z-transforms, returning both real and complex roots needed for stability analysis.
Physics & Signal Processing
Physicists and signal processing engineers solve characteristic equations of differential equations and filter design polynomials. The polynomial root finder finds all roots of Butterworth, Chebyshev, and Bessel filter polynomials instantly.
Mathematics Education
Students learning algebra, complex analysis, and numerical methods use the polynomial root finder to verify hand calculations and explore root behavior. The factored form output shows how roots relate to the polynomial structure.
Computer Graphics & Animation
Graphics programmers solve polynomial equations for ray-surface intersection tests (spheres, cylinders, tori) and Bézier curve computations. The polynomial root finder handles the degree-4 and degree-6 polynomials that arise in these calculations.
Financial Modeling
Financial analysts solve polynomial equations when computing internal rates of return (IRR) for complex cash flow series. The polynomial root finder finds all roots, helping identify multiple IRR solutions that can occur in non-conventional cash flows.
Numerical Methods Research
Researchers studying numerical algorithms use the polynomial root finder to test and compare root-finding methods. The residual display makes it easy to assess convergence quality and identify ill-conditioned polynomials.
Understanding Polynomial Root Finding
What is a Polynomial Root?
A polynomial root (or zero) is a value x such that p(x) = 0, where p(x) is a polynomial function. By the Fundamental Theorem of Algebra, every polynomial of degree n with complex coefficients has exactly n roots (counting multiplicity) in the complex numbers. For polynomials with real coefficients, complex roots always appear in conjugate pairs — if a + bi is a root, then a − bi is also a root. Our polynomial root finder finds all n roots of any polynomial up to degree 20, separating real roots from complex roots and displaying the factored form of the polynomial.
How Our Polynomial Root Finder Works
- Enter Coefficients: Select the polynomial degree and enter the coefficients from highest to lowest power. For example, for x³ − 6x² + 11x − 6, enter coefficients 1, −6, 11, −6. Use the quick example buttons to load common polynomials instantly. A live polynomial preview updates as you type.
- Aberth-Ehrlich Root Finding:Click “Find Roots” and the polynomial root finder uses the Aberth-Ehrlich method — a simultaneous root-finding algorithm that updates all root estimates in parallel, avoiding the sequential deflation errors of Newton-Raphson. Initial guesses are placed on a circle in the complex plane.
- Newton-Raphson Polishing: Each root found by Aberth-Ehrlich is refined using Newton-Raphson iterations to achieve 14+ decimal places of accuracy. The residual |p(x)| is computed for each root to verify accuracy — values near machine epsilon (10⁻¹⁵) indicate highly accurate roots.
What the Polynomial Root Finder Computes
- Real Roots: Values of x where p(x) = 0 and x is a real number. Displayed with up to 10 decimal places and a residual verification value.
- Complex Roots: Values of x = a + bi where p(x) = 0 and b ≠ 0. For real-coefficient polynomials, these always appear in conjugate pairs (a + bi and a − bi).
- Factored Form: The polynomial expressed as a product of linear factors (x − r₁)(x − r₂)...(x − rₙ), showing how the roots relate to the polynomial structure.
- Residual |p(x)|: The absolute value of the polynomial evaluated at each root — a measure of numerical accuracy. Values below 10⁻¹⁰ indicate highly accurate roots.
Limitations and Numerical Considerations
The polynomial root finder uses floating-point arithmetic, so results are numerical approximations rather than exact symbolic solutions. For polynomials with repeated roots (e.g. x² = 0 has a double root at 0), the algorithm may return roots that are very close but not identical — this is a known limitation of numerical methods. For ill-conditioned polynomials(where small changes in coefficients cause large changes in roots, such as Wilkinson's polynomial), accuracy may be reduced. The maximum supported degree is 20. For exact symbolic solutions to quadratic, cubic, and quartic polynomials, use the dedicated equation solvers.
Related Tools
Voice Recorder & Audio Extractor
Record high-quality audio from your microphone or extract audio from MP4 and WebM video files offline. 100% secure, browser-based utility.
Audio Slicer & Converter
Trim audio clips and convert between MP3, WAV format client-side - Free online audio cutter
ID3 Tag & Metadata Editor
Read and write ID3 tags, album art, artist, and track details directly to MP3 file headers - Free online ID3 tag editor
MP3 Metadata Viewer
View all ID3 tags — title, artist, album, artwork, BPM, and every embedded frame — from any MP3 file instantly in your browser - Free online MP3 metadata viewer
Frequently Asked Questions About Polynomial Root Finder
A polynomial root finder computes all values of x where p(x) = 0 for a given polynomial p(x). Our polynomial root finder supports polynomials up to degree 20, finds both real and complex roots using the Aberth-Ehrlich method with Newton-Raphson polishing, and runs entirely in your browser — no signup required.
Select the degree of your polynomial, then enter the coefficients from highest to lowest power. For example, for 2x³ + 3x² − 11x − 6, select degree 3 and enter coefficients 2, 3, −11, −6. A live preview shows the polynomial as you type. Use the quick example buttons to load common polynomials instantly.
By the Fundamental Theorem of Algebra, every polynomial of degree n with complex coefficients has exactly n roots in the complex numbers (counting multiplicity). This means a quadratic always has 2 roots, a cubic always has 3 roots, and so on — though some may be complex or repeated.
For polynomials with real coefficients, complex roots always appear in conjugate pairs. If a + bi is a root, then a − bi is also a root. This is because if you substitute a + bi into a real-coefficient polynomial and get 0, taking the complex conjugate of both sides shows that a − bi is also a root.
The Aberth-Ehrlich method is a simultaneous root-finding algorithm that updates all root estimates in parallel. Unlike sequential Newton-Raphson with deflation, it avoids error accumulation from deflation and converges faster for polynomials with multiple roots. It uses an initial guess of roots placed on a circle in the complex plane.
The residual |p(x)| is the absolute value of the polynomial evaluated at the computed root. For an exact root, this would be 0. In practice, floating-point arithmetic gives a small non-zero value. Residuals below 10⁻¹⁰ indicate highly accurate roots; residuals above 10⁻⁶ may indicate numerical difficulties.
Yes. The polynomial root finder runs 100% locally in your browser. Your coefficients and results are never sent to any server, stored in a database, or tracked in any way. Everything stays completely private on your device.
Yes — the polynomial root finder is 100% free with no signup, no account, and no usage limits. Find polynomial roots as many times as you need, completely free forever. There are no ads, no premium tiers, and no data collection.
The polynomial root finder supports polynomials up to degree 20 (21 coefficients). For higher-degree polynomials, numerical accuracy may decrease due to floating-point limitations. For exact symbolic solutions to quadratic (degree 2), cubic (degree 3), and quartic (degree 4) polynomials, use the dedicated equation solvers.