Design, analysis, and implementation of a multiprecision polynomial rootfinder
From MaRDI portal
Publication:1569736
DOI10.1023/A:1019199917103zbMATH Open1018.65061OpenAlexW1832583097MaRDI QIDQ1569736FDOQ1569736
Authors: Dario A. Bini, Giuseppe Fiorentino 
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
Recommendations
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
- scientific article; zbMATH DE number 1263299
- Numerical impluimentation of a new algorithm for polynomials with multiple roots
- scientific article; zbMATH DE number 1500715
- Publication:4503867
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- scientific article; zbMATH DE number 880381
- Coefficient-free adaptations of polynomial root-finders
- Old and new nearly optimal polynomial root-finders
adaptive algorithmsmathematical softwarepolynomial rootssimultaneous iterationssystems of polynomial equationsinclusion theoremsroot 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)
Cited In (79)
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- A geometric approach to approximating the limit set of eigenvalues for banded Toeplitz matrices
- A Fractal Eigenvector
- Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems
- Title not available (Why is that?)
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Rational Krylov methods for functions of matrices with applications to fractional partial differential equations
- Diffraction measures and patterns of the complex dimensions of self-similar fractal strings. I: The lattice case
- Connecting the unstable region of the entropy to the pattern of the Fisher zeros map
- An experimental investigation of the normality of irrational algebraic numbers
- A new fast root-finder for black box polynomials
- Root-Squaring for Root-Finding
- A deterministic algorithm for isolating real roots of a real polynomial
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
- A further analysis of backward error in polynomial deflation
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Fast matrix multiplication and its algebraic neighbourhood
- New progress in real and complex polynomial root-finding
- Root-finding by expansion with independent constraints
- The computation of multiple roots of a polynomial
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Tracing index of rational curve parametrizations
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- Geometry of polynomials and root-finding via path-lifting
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Iteration functions re-visited
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Complexity of real root isolation using continued fractions
- On the complexity of real root isolation using continued fractions
- Real root polynomials and real root preserving transformations
- On the stability of computing polynomial roots via confederate linearizations
- Real polynomial root-finding by means of matrix and polynomial iterations
- Sigmoid-like functions and root finding methods
- On new higher order families of simultaneous methods for finding polynomial zeros
- A posteriori error bound methods for the inclusion of polynomial zeros
- Root refinement for real polynomials using quadratic interval refinement
- Computing real roots of real polynomials
- Transformations of matrix structures work again
- na20
- A generalized Beraha conjecture for non-planar graphs
- On the complexity of computing with planar algebraic curves
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Is the five-flow conjecture almost false?
- Overdetermined Weierstrass iteration and the nearest consistent system
- A Bayesian model for root computation
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
- Matrix computations and polynomial root-finding with preprocessing
- Solving secular and polynomial equations: a multiprecision algorithm
- Structured matrix methods for the computation of multiple roots of a polynomial
- Fast approximate computations with Cauchy matrices and polynomials
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- On the complexity of the Descartes method when using approximate arithmetic
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials
- Computing curve intersection by means of simultaneous iterations
- Randomized preprocessing of homogeneous linear systems of equations
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- Bounds on polynomial roots using intercyclic companion matrices
- Cylinder partition function of the 6-vertex model from algebraic geometry
- Fast and Backward Stable Computation of Roots of Polynomials
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Computing curve intersection by homotopy methods
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
- Analyticity of the Ising susceptibility: an interpretation
- Effective bounds for P-recursive sequences
- New Practical Advances in Polynomial Root Clustering
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- New bounds for roots of polynomials based on Fiedler companion matrices
- Exact symbolic-numeric computation of planar algebraic curves
- SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
Uses Software
This page was built for publication: Design, analysis, and implementation of a multiprecision polynomial rootfinder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569736)
