Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
From MaRDI portal
Publication:5326390
DOI10.1007/978-3-642-39053-1_51zbMath1416.65068OpenAlexW1518471812MaRDI QIDQ5326390
Vikram Sharma, Michael Sagraloff, Chee-Keng Yap
Publication date: 5 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_51
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Computation over the reals, computable analysis (03D78)
Related Items
Near optimal subdivision algorithms for real root isolation ⋮ Finding the number of roots of a polynomial in a plane region using the winding number ⋮ A symbolic-numerical algorithm for isolating real roots of certain radical expressions ⋮ Positive root isolation for poly-powers by exclusion and differentiation ⋮ A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration ⋮ The complexity of subdivision for diameter-distance tests ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Clustering complex zeros of triangular systems of polynomials ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
Uses Software
