Fast evaluation and root finding for polynomials with floating-point coefficients
From MaRDI portal
Publication:6060390
DOI10.1145/3597066.3597112arXiv2302.06244OpenAlexW4362515264MaRDI QIDQ6060390
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.06244
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Fixed points, zeros and Newton's method
- Root radii and subdivision for polynomial root-finding
- Accurate simple zeros of polynomials in floating point arithmetic
- A fast numerical algorithm for the composition of power series with complex coefficients
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Solving secular and polynomial equations: a multiprecision algorithm
- Recherches sur la méthode de Graeffe et les zéros des polynômes et des séries de Laurent
- Modern Computer Arithmetic
- Evaluating parametric holonomic sequences using rectangular splitting
- Handbook of Floating-Point Arithmetic
- Accuracy and Stability of Numerical Algorithms
- On the Reduction of Number Range in the Use of the Graeffe Process
- Finding the convex hull of a simple polygon
- Algorithms in real algebraic geometry
- On the geometry of Graeffe iteration
- Tangent Graeffe iteration
This page was built for publication: Fast evaluation and root finding for polynomials with floating-point coefficients
