Design, analysis, and implementation of a multiprecision polynomial rootfinder
From MaRDI portal
Publication:1569736
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
Cited in
(83)- Improved computation of polynomial roots over number fields when using complex embeddings
- Diffraction measures and patterns of the complex dimensions of self-similar fractal strings. I: The lattice case
- A new fast root-finder for black box polynomials
- Real root polynomials and real root preserving transformations
- Root-Squaring for Root-Finding
- A fractal eigenvector
- A geometric approach to approximating the limit set of eigenvalues for banded Toeplitz matrices
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Ultimate complexity for numerical algorithms
- Rational Krylov methods for functions of matrices with applications to fractional partial differential equations
- 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
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- Runge-Kutta-Gegenbauer explicit methods for advection-diffusion problems
- scientific article; zbMATH DE number 3124291 (Why is no real title available?)
- Root refinement for real polynomials using quadratic interval refinement
- On the convergence condition of generalized root iterations for the inclusion of polynomial zeros
- Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
- Effective bounds for P-recursive sequences
- Root-finding by expansion with independent constraints
- Fast approximate computations with Cauchy matrices and polynomials
- Computing real roots of real polynomials
- Tracing index of rational curve parametrizations
- Transformations of matrix structures work again
- A Bayesian model for root computation
- A further analysis of backward error in polynomial deflation
- A deterministic algorithm for isolating real roots of a real polynomial
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Fast evaluation and root finding for polynomials with floating-point coefficients
- Eigenvalue condition numbers and pseudospectra of Fiedler matrices
- Architecture-aware classical Taylor shift by 1
- Bounds on polynomial roots using intercyclic companion matrices
- Cylinder partition function of the 6-vertex model from algebraic geometry
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Analyticity of the Ising susceptibility: an interpretation
- On the stability of computing polynomial roots via confederate linearizations
- The computation of multiple roots of a polynomial
- New progress in real and complex polynomial root-finding
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- Randomized preprocessing of homogeneous linear systems of equations
- On new higher order families of simultaneous methods for finding polynomial zeros
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Fast and Backward Stable Computation of Roots of Polynomials
- New Practical Advances in Polynomial Root Clustering
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- A generalized Beraha conjecture for non-planar graphs
- On the complexity of real root isolation using continued fractions
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- New bounds for roots of polynomials based on Fiedler companion matrices
- na20
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- Exact symbolic-numeric computation of planar algebraic curves
- Iteration functions re-visited
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- On the complexity of the Descartes method when using approximate arithmetic
- Complexity of real root isolation using continued fractions
- A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- Geometry of polynomials and root-finding via path-lifting
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
- Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
- Is the five-flow conjecture almost false?
- A posteriori error bound methods for the inclusion of polynomial zeros
- Real polynomial root-finding by means of matrix and polynomial iterations
- Fast matrix multiplication and its algebraic neighbourhood
- On the complexity of computing with planar algebraic curves
- Computing curve intersection by homotopy methods
- A higher order family for the simultaneous inclusion of multiple zeros of polynomials
- Sigmoid-like functions and root finding methods
- Matrix computations and polynomial root-finding with preprocessing
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS
- Solving secular and polynomial equations: a multiprecision algorithm
- Structured matrix methods for the computation of multiple roots of a polynomial
- Overdetermined Weierstrass iteration and the nearest consistent system
- Computing curve intersection by means of simultaneous iterations
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
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)
