Skip to main content
Log in

A modification of Muller’s method

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

It is well-known that Muller’s method for the computation of the zeros of continuous functions has order ≈ 1.84 [10], and does not have the character of global convergence. Muller’s method is based on the interpolating polynomial built on the last three points of the iterative sequence. In this paper the authors take as nodes of the interpolating polynomial the last two points of the sequence and the middle point between them. The resulting method has order p=2 for regular functions. This method leads to a globally convergent algorithm because it uses dichotomic techniques. Many numerical examples are given to show how the proposed code improves on Muller’s method.

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. Alefeld, G.E., Potra, F.A.: Some efficient methods for enclosing simple zeros of nonlinear equations. BIT 32, 334–344 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • 2. Alefeld, G.E., Potra, F.A., Shi, Y.: On enclosing simple roots of nonlinear equations. Math. Comp. 61, 733–744 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  • 3. Alefeld, G.E., Potra, F.A., Shi, Y.: Algorithm 748: Enclosing zeros of continuous functions. ACM Trans. Math. Software 21, 327–344 (1995)

    Article  MATH  Google Scholar 

  • 4. Brent, R.P.: Algorithms for minimization without derivatives. Englewood Cliffs, NJ: Prentice-Hall 1973

  • 5. Costabile, F., Gualtieri, M.I., Luceri, R.: A new iterative method for the computation of the solutions of nonlinear equations. Numer. Algorithms 28, 87–100 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • 6. Costabile, F., Gualtieri, M.I., Serra Capizzano, S.: An iterative method for the computation of the solutions of nonlinear equations. Calcolo 36, 17–34 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • 7. Davis, P.J.: Interpolation and approximation. New York: Blaisdell 1963

  • 8. Dekker, T.J.: Finding a zero by means of successive linear interpolation. In: Dejon, B., Henrici, P. (eds.): Constructive aspects of the fundamental theorem of algebra. New York: Wiley-Interscience 1969, pp. 37–48

  • 9. Ostrowski, A.M.: Solution of equations and systems of equations. New York: Academic Press 1960

  • 10. Traub, J.F.: Iterative methods for the solution of equations. Englewood-Cliffs: Prentice-Hall 1964

  • 11. Wait, R.: The numerical solution of algebraic equations. New York: Wiley 1979

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Costabile, F., Gualtieri, M. & Luceri, R. A modification of Muller’s method. Calcolo 43, 39–50 (2006). https://doi.org/10.1007/s10092-006-0113-9

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10092-006-0113-9

Navigation