Automatic errorbounds for simple zeros of analytic functions-Reference-Cited by-同舟云学术

Automatic errorbounds for simple zeros of analytic functions

Published:1973-02 Issue:2 Volume:16 Page:101-104
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Rokne J.¹

Affiliation:

1. Univ. of Calgary, Calgary, Alberta, Canada

Abstract

The Cauchy-Ostrowski theorem on convergence of Newton iterates for an analytic function in one variable is extended to include computational errors using complex interval arithmetic. Several numerical examples are given for polynomials with real and complex roots and one example for the Bessel function of the first kind.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/361952.361962

Reference17 articles.

1. A stopping criterion for polynomial root finding

2. Analytical approximations;Allen E.E;Math. Tables Aids Comp.,1954

3. Polynomial approximations to some modified Bessel functions;Allen E.E;Math. Tables Aids Comp.,1956

4. Grundlagen einer MaschinenintervaUarithmetik;Apostolatos N.;Comp.,1968

5. Approximation der erweiterten Intervallarithmetik durch die einfacbe Maschienenintervallarithmetik;Apostolatos N.;Comp.,1968

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Closed-Form Solution to the Geometric Goat Problem;The Mathematical Intelligencer;2020-02-18

2. Enclosing all zeros of an analytic function — A rigorous approach;Journal of Computational and Applied Mathematics;2009-06

3. Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros;Applied Mathematics and Computation;1988-12

4. BIBLIOGRAPHY;Introduction to Interval Computation;1983

5. Computational methods of linear algebra;Journal of Soviet Mathematics;1981