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

DOI10.1016/J.AMC.2006.07.012zbMATH Open1107.65317OpenAlexW2081767508MaRDI QIDQ870141FDOQ870141

Authors: 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

Recommendations

• Complex root finding algorithm based on Delaunay triangulation
• Method for the calculation of all non-multiple zeros of an analytic function
• A derivative-free algorithm for computing zeros of analytic functions
• On zeros of a complex polynomial
• Polynomial root finding by means of continuation

zbMATH Keywords

performancenumerical examplesalgorithmpolynomialrelative errortime complexitytranscendental functionpseudo-random numberquasi-random numberlow discrepancy sequencecomplex zero

Mathematics Subject Classification ID

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

Cites Work

• Computational error and complexity in science and engineering

Cited In (1)

• Complex root finding algorithm based on Delaunay triangulation

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

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