Locating all the zeros of an analytic function in one complex variable
By Michael Dellnitz, Oliver Schütze, Qinghua Zheng. 2002
70 citations recorded by the source corpus.
Based on the argument principle, we propose an adaptive multilevel subdivision algorithm for the computation of all the zeros of an analytic function f : C --> C within a bounded domain. We illustrate the reliability of this method by several numerical examples.
Subfields: Applied Mathematics, Computational Mechanics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/837bcd8e73aebb82dc26370425e24c360fb2774d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Robert Sedgewick
- Philippe Flajolet
- R. Stephenson
- Sergi Elizalde
- Richard P. Stanley
- Svante Janson
- Robin Pemantle
- Konstantinos Panagiotou
Citations in the corpus
- QPmR - Quasi-Polynomial Root-Finder: Algorithm Update and Examples (2014, unknown): “[7], [27].”
- Analytic Combinatorics (2009, background): “12 and refer for instance to [151] for a discussion.”