A quasi-shrinking rectangle algorithm for complex zeros of a function

DOI10.1016/J.AMC.2006.07.012zbMath1107.65317OpenAlexW2081767508MaRDI QIDQ870141

Andrea Reese

Publication date: 12 March 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.07.012

zbMATH Keywords

performancealgorithmnumerical examplespolynomialtime complexityrelative errortranscendental functionpseudo-random numberquasi-random numberlow discrepancy sequencecomplex zero

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Random number generation in numerical analysis (65C10) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Computational error and complexity in science and engineering

This page was built for publication: A quasi-shrinking rectangle algorithm for complex zeros of a function