A parallel complex zero finder

DOI10.1007/BF02385261zbMath0840.65014OpenAlexW2315208001MaRDI QIDQ1904319

Mark J. Schaefer, Tilmann Bubeck

Publication date: 30 June 1996

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02385261

zbMATH Keywords

numerical exampleNewton's methodwinding numberinterval computationsbisectionzeros of analytic functions

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Approximation in the complex plane (30E10) 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) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Interval Methods for Systems of Equations
• Precise computation using range arithmetic, via C++

This page was built for publication: A parallel complex zero finder