Complexity of a root clustering algorithm for holomorphic functions

DOI10.1016/J.TCS.2024.114504MaRDI QIDQ6496875zbMATH OpenFDO

Authors Prashant Batra, Vikram Sharma

Publication date 6 May 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114504

zbMATH Keywords

approximating rootscontinuous amortizationde Branges's theoremholomorphic functionsroot clusteringsubdivision algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Complexity Analysis of Root Clustering for a Complex Polynomial
• New Practical Advances in Polynomial Root Clustering
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• A simple but exact and efficient algorithm for complex root isolation

Cites work

• A derivative-free algorithm for computing zeros of analytic functions
• A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
• A Numerical Method for Locating the Zeros of an Analytic Function
• A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
• A simple reliable solver for all the roots of a nonlinear function in a given domain
• Analytic root clustering: a complete algorithm using soft zero tests
• Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
• Complexity Analysis of Root Clustering for a Complex Polynomial
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Computing the zeros of analytic functions
• Continuous amortization and extensions: with applications to bisection-based root isolation
• Enclosing all zeros of an analytic function - a rigorous approach
• Error analysis of a derivative-free algorithm for computing zeros of holomorphic functions
• Evaluating Derivatives
• Finding zeros by multilevel subdivision techniques
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1746043 (Why is no real title available?)
• scientific article; zbMATH DE number 1820648 (Why is no real title available?)
• scientific article; zbMATH DE number 770106 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• Locating all the zeros of an analytic function in one complex variable
• Near optimal subdivision algorithms for real root isolation
• Numerical algorithms based on analytic function values at roots of unity
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• On locating clusters of zeros of analytic functions
• On location and approximation of clusters of zeros of analytic functions
• On the complexity of solving a bivariate polynomial system
• On the size of balls covered by analytic transformations
• Solving transcendental equations. The Chebyshev polynomial proxy and other numerical rootfinders, perturbation series, and oracles
• The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Zerofinding of analytic functions by structured matrix methods

This page was built for publication: Complexity of a root clustering algorithm for holomorphic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496875)