Subdivision and Schröder's Polynomial Root-Finders Combined
Our root-finder at ACM-SIAM SODA 2024 accelerates classical subdivision iterations for approximation of all zeros of a polynomial as well as all its zeros lying in a fixed Region of Interest in the complex plane. The root-finder enhances the power of subdivision classical iterations and promises to compete for user's choice. At SODA 2024 we proved that that root-finder is near-optimal in some detail, except for its stage of near-maximal compression of a complex disc without losing its roots. Here we complete the proof and also propose to simplify that stage empirically by means of incorporation of Schröder's iterations.
Authors
- Victor Y. Pan (ORCID: https://orcid.org/0000-0002-9819-9358)
Institutions
- Lehman College (US)
- City University of New York (US)
Publication Details
- Published
- 2024-09-16
- DOI
- https://doi.org/10.1109/synasc65383.2024.00017
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00