Complexity of a root clustering algorithm for holomorphic functions
From MaRDI portal
Publication:6496875
DOI10.1016/J.TCS.2024.114504MaRDI QIDQ6496875
Publication date: 6 May 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
holomorphic functionssubdivision algorithmscontinuous amortizationroot clusteringde Branges's theoremapproximating roots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Enclosing all zeros of an analytic function - a rigorous approach
- A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
- On the size of balls covered by analytic transformations
- A derivative-free algorithm for computing zeros of analytic functions
- Error analysis of a derivative-free algorithm for computing zeros of holomorphic functions
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- A simple reliable solver for all the roots of a nonlinear function in a given domain
- On locating clusters of zeros of analytic functions
- Computing the zeros of analytic functions
- On location and approximation of clusters of zeros of analytic functions
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Near optimal subdivision algorithms for real root isolation
- Numerical Algorithms Based on Analytic Function Values at Roots of Unity
- Solving Transcendental Equations
- Complexity Analysis of Root Clustering for a Complex Polynomial
- Zerofinding of analytic functions by structured matrix methods
- Evaluating Derivatives
- Finding zeros by multilevel subdivision techniques
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- On the complexity of solving a bivariate polynomial system
- Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests
- A Numerical Method for Locating the Zeros of an Analytic Function
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- Locating all the zeros of an analytic function in one complex variable
This page was built for publication: Complexity of a root clustering algorithm for holomorphic functions