Design, analysis, and implementation of a multiprecision polynomial rootfinder
From MaRDI portal
Publication:1569736
DOI10.1023/A:1019199917103zbMath1018.65061OpenAlexW1832583097MaRDI QIDQ1569736
Giuseppe Fiorentino, Dario Andrea Bini
Publication date: 9 July 2000
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019199917103
systems of polynomial equationsmathematical softwareadaptive algorithmsinclusion theoremspolynomial rootssimultaneous iterationsroot neighborhoodsclustered rootspolynomial with complex coefficients
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Related Items (68)
Eigenvalue condition numbers and pseudospectra of Fiedler matrices ⋮ Complexity of real root isolation using continued fractions ⋮ A posteriori error bound methods for the inclusion of polynomial zeros ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ Computing curve intersection by means of simultaneous iterations ⋮ SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ A Fractal Eigenvector ⋮ The Brown-Colbourn conjecture on zeros of reliability polynomials is false ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method ⋮ Fast evaluation and root finding for polynomials with floating-point coefficients ⋮ Bounds on polynomial roots using intercyclic companion matrices ⋮ Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods ⋮ Matrix computations and polynomial root-finding with preprocessing ⋮ The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ The computation of multiple roots of a polynomial ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ Analyticity of the Ising susceptibility: an interpretation ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Computing curve intersection by homotopy methods ⋮ Is the five-flow conjecture almost false? ⋮ On the complexity of the Descartes method when using approximate arithmetic ⋮ Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems ⋮ Rational Krylov methods for functions of matrices with applications to fractional partial differential equations ⋮ New bounds for roots of polynomials based on Fiedler companion matrices ⋮ Transformations of matrix structures work again ⋮ On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ Inverse power and Durand-Kerner iterations for univariate polynomial root-finding ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Root-finding by expansion with independent constraints ⋮ A further analysis of backward error in polynomial deflation ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ Computing real roots of real polynomials ⋮ On new higher order families of simultaneous methods for finding polynomial zeros ⋮ Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ On the complexity of real root isolation using continued fractions ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ Solving secular and polynomial equations: a multiprecision algorithm ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ On the complexity of computing with planar algebraic curves ⋮ Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials ⋮ An iterated eigenvalue algorithm for approximating roots of univariate polynomials ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ New progress in real and complex polynomial root-finding ⋮ A higher order family for the simultaneous inclusion of multiple zeros of polynomials ⋮ Effective bounds for P-recursive sequences ⋮ Tracing index of rational curve parametrizations ⋮ Iteration functions re-visited ⋮ A generalized Beraha conjecture for non-planar graphs ⋮ Real root polynomials and real root preserving transformations ⋮ Sigmoid-like functions and root finding methods ⋮ On the stability of computing polynomial roots via confederate linearizations ⋮ na20 ⋮ An experimental investigation of the normality of irrational algebraic numbers ⋮ Cylinder partition function of the 6-vertex model from algebraic geometry ⋮ An effective implementation of a modified Laguerre method for the roots of a polynomial ⋮ Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\) ⋮ New Practical Advances in Polynomial Root Clustering ⋮ Fast and Backward Stable Computation of Roots of Polynomials ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ Real polynomial root-finding by means of matrix and polynomial iterations ⋮ Accelerated approximation of the complex roots and factors of a univariate polynomial
Uses Software
This page was built for publication: Design, analysis, and implementation of a multiprecision polynomial rootfinder
