On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane
DOI10.1016/0377-0427(94)90292-5zbMATH Open0807.65054OpenAlexW2025969557MaRDI QIDQ1334754FDOQ1334754
Authors: Lilija C. Atanassova 
Publication date: 22 September 1994
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(94)90292-5
Recommendations
- On the simultaneous determination of zeros of analytic or sectionally analytic functions
- scientific article; zbMATH DE number 584519
- A class of simultaneous methods for the zeros of analytic functions
- scientific article; zbMATH DE number 641615
- On the zeros of a class of analytic functions
- scientific article; zbMATH DE number 3923481
- On zeros of analytic functions in half plane
- On zeros of certain analytic functions
- An automatic and guaranteed determination of the number of roots of an analytic function interior to a simple closed curve in the complex plane
- scientific article; zbMATH DE number 1524424
error boundsiterative methodszerosanalytic functionrounding errorsparallel iterative methodsinterval operators
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Iterative methods for simultaneous inclusion of polynomial zeros
- Title not available (Why is that?)
- Circular arithmetic and the determination of polynomial zeros
- Title not available (Why is that?)
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- A Numerical Method for Locating the Zeros of an Analytic Function
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the simultaneous determination of zeros of analytic or sectionally analytic functions
- A generalization of the Siewert–Burniston method for the determination of zeros of analytic functions
- On Locating All Zeros of an Analytic Function within a Bounded Domain by a Revised Delves/Lyness Method
- On a modification of the Koenig theorem
- Title not available (Why is that?)
Cited In (11)
- A circular splitting search algorithm for systems of complex equations
- On the simultaneous determination of zeros of analytic or sectionally analytic functions
- Numerical integration error method for zeros of analytic functions
- On a dual hybrid queueing system
- Family of iterative methods for computing the zeros of analytic functions
- Hybrid queueing systems with hysteretic bilevel control policies
- Title not available (Why is that?)
- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
- An automatic and guaranteed determination of the number of roots of an analytic function interior to a simple closed curve in the complex plane
- Random walk analysis of parallel queueing stations
- New simultaneous root-finding methods with accelerated convergence for analytic functions
This page was built for publication: On the simultaneous determination of the zeros of an analytic function inside a simple smooth closed contour in the complex plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334754)
