Clustering complex zeros of triangular systems of polynomials
DOI10.1007/s11786-020-00482-0zbMath1492.65136arXiv1806.10164OpenAlexW3036763234MaRDI QIDQ2035625
Marc Pouget, Rémi Imbach, Chee-Keng Yap
Publication date: 25 June 2021
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.10164
subdivision algorithmcomplex root findingtriangular polynomial systemPellet's theoremcertified algorithmcomplex root isolationnear-optimal root isolationoracle multivariable polynomial
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)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- Globally convergent, iterative path-following for algebraic equations
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Implementation of a near-optimal complex root clustering algorithm
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Univariate real root isolation in an extension field and applications
- Solving polynomial equations. Foundations, algorithms, and applications
- On the theories of triangular sets
- Interval arithmetic in cylindrical algebraic decomposition
- On the distance between the roots of a polynomial
- Real Root Isolation of Regular Chains
- Certified Numerical Homotopy Tracking
- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems
- Complexity Analysis of Root Clustering for a Complex Polynomial
- Computing Real Roots of Real Polynomials ... and now For Real!
- Introduction to Interval Analysis
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- A Polyhedral Method for Solving Sparse Polynomial Systems
- An Approach for Certifying Homotopy Continuation Paths
- Lifting techniques for triangular decompositions
- Computing the multiplicity structure in solving polynomial systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
- Computer Algebra in Scientific Computing
