J. Rokne
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.
- 1 Adams, D.A. A stopping criterion for polynomial root finding. Comm. ACM 10, 10 (Oct. 1967), 655-658. Google Scholar
Digital Library
- 2 Allen, E.E. Analytical approximations. Math. Tables Aids Comp. 8 (1954), 240.Google Scholar
- 3 Allen, E.E. Polynomial approximations to some modified Bessel functions. Math. Tables Aids Comp. 10 (1956), 162.Google Scholar
- 4 Apostolatos, N., and Kulisch, V. Grundlagen einer MaschinenintervaUarithmetik, Comp. 2, 1 (1968), 89.Google Scholar
- 5 Apostolatos, N., and Kulisch, V. Approximation der erweiterten Intervallarithmetik durch die einfacbe Maschienenintervallarithmetik. Comp. 2,3 (1968), 181.Google Scholar
- 6 Dwyer, P. Linear Computations. John Wiley, New York, 1951.Google Scholar
- 7 Fischer, H. Eine methode fur Einschliessung der Nullstellen von Polynomen mit Komplexen Koeffizienten. Comp. 4 (1969), 125.Google ScholarCross Ref
- 8 Gibb, A. Algorithm 61, procedures for range arithmetic. Comm. ACM4, 7 (July 1961), 319-320. Google ScholarDigital Library
- 9 IBM System 360 scientific subroutine package. Form H20- 0205-3.Google Scholar
- 10 Lancaster, P. Error analysis for the Newton-Raphson Method Num. Math. 9 (1968), 55.Google Scholar
- 11 Moore, R.E. Interval Analysis. Prentice-Hall, Englewood Cliffs, N.J., 1966.Google Scholar
- 12 Ostrowski, A.M. Solution of Equations and Systems of Equations. Academic Press, New York, 1966.Google Scholar
- 13 Rokne, J., and Lancaster, P. Automatic errorbounds for the approximate solution of equations Computing 4 (1969), 294.Google Scholar
- 14 Rokne, J., and Lancaster, P. Complex interval arithmetic Comm. ACM 14, 2 (Feb. 1971). 111-112 Google ScholarDigital Library
- 15 Urabe, M. Error estimation in numerical solution of equations by iterations process. J. Sci. Hiroshima U. 26 (1962), 77.Google Scholar
- 16 Urabe, M. Convergence of numerical iteration in solution of equations. J. Sci. Hiroshima U., 19 (1956), 479.Google Scholar
- 17 Wilkinson, J.H. Rounding Errors fll Algebraic Processes Prentice-Hall, Englewood Cliffs, N.J., 1963. Google ScholarDigital Library
Recommendations
Complex interval arithmetic
Complex interval arithmetic is defined using real interval arithmetic. Complex interval division is defined so as to assure smallest possible resulting intervals.
Bernoulli–Dunkl and Apostol–Euler–Dunkl polynomials with applications to series involving zeros of Bessel functions
AbstractWe introduce Bernoulli–Dunkl and Apostol–Euler–Dunkl polynomials as generalizations of Bernoulli and Apostol–Euler polynomials, where the role of the derivative is now played by the Dunkl operator on the real line. We use them to find ...
Elementary approximations for zeros of Bessel functions
Let jvk, yvk and cvk denote the kth positive zeros of the Bessel functions Jv(x), Yv(x) and of the general cylinder function Cv(x) = cos Jv(x) sin Yv(x), 0 < , respectively. In this paper we extend to cvk, k = 2, 3,..., some linear inequalities ...
Comments