Skip to main content
Log in

An interval iteration for multiple roots of transcendental equations

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

An iteration method for roots of algebraic functions with roots of multiplicity greater than one is established using tools and techniques from interval arithmetic. The method is based on an interval iteration functions for multiple roots and it retains the convergence order of the underlying iteration method while preserving global convergence over an initial interval. A number of simple examples are provided to show that the method is feasible and that it produces reasonable results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. G. Alefeld,Intervallrechnung über den komplexen Zahlen und einige Anwendungen. Thesis, Universität Karlsruhe, 1968.

  2. M. N. Channabasappa,A note of the computation of multiple zeros of polynomials by Newton's method, BIT 19 (1979), pp. 134–135.

    Google Scholar 

  3. C. Dong,A family of multipoint iterative functions for finding multiple roots of equations, Int. J. Computer Math. 21 (1987), pp. 363–367.

    Google Scholar 

  4. E. R. Hansen and S. Sengupta,Global constrained optimization using interval analysis, In K. Nickel (ed.): Interval Mathematics 1980, Proceedings of the International Symposium, Freiburg 1980, Academic Press, New York, pp. 25–47, 1980.

    Google Scholar 

  5. IEEE,IEEE standard for binary floating-point arithmetic, IEEE Standard 754-1985, IEEE, New York, 1985.

    Google Scholar 

  6. J. B. Kioustelidis,A derivative-free transformation preserving the order of convergence of iteration methods in case of multiple zeros, Num. Math. 33 (1979), pp. 385–389.

    Google Scholar 

  7. A. Neumaier,An interval version of the secant method, BIT, 24 (1984), pp. 366–372.

    Google Scholar 

  8. A. Neumaier,An existence test for root clusters and multiple roots, ZAMM 68 (1988), pp. 256–257.

    Google Scholar 

  9. A. M. Ostrowski,Solution of Equations and System of Equations, Academic Press, New York, 1970.

    Google Scholar 

  10. H. Ratschek and J. Rokne,Computer Methods for the Range of Functions. Ellis Horwood, Chichester, 1984.

    Google Scholar 

  11. J. Rokne,Interval arithmetic, In Graphics Gems III, D. Kirk, ed. Academic Press, Boston, pp. 61–66, 1992.

    Google Scholar 

  12. J. Rokne,Interval arithmetic, (The C++ interval package). In Graphics Gems III, D. Kirk, ed. Academic Press, Boston, pp. 454–457, 1992.

    Google Scholar 

  13. J. F. Traub,Iterative Methods for Solution of Equations. Prentice Hall, Englewood Cliffs, New Jersey, 1964.

    Google Scholar 

  14. J. F. Traub,The solution of transcendental equations. In A. Ralston and H. Wilf: Numerical Methods for Digital Computers, Vol. II, John Wiley, New York, pp. 171–184 (1967).

    Google Scholar 

  15. T. J. Ypma,Finding a multiple zero by transformations and Newton-like methods, SIAM Review 25 (1983), pp. 365–378.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, Q., Rokne, J.G. An interval iteration for multiple roots of transcendental equations. Bit Numer Math 35, 561–571 (1995). https://doi.org/10.1007/BF01739827

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01739827

Key words

Navigation