An improvement of the Euler-Chebyshev iterative method

Journal of Mathematical Analysis and Applications

Volumn 315, Issue 1, 2006, Pages 1-7

  Grau, Miquel ^a   Díaz Barrero, José Luis ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Computational efficiency; Euler Chebyshev's formula; Iterative methods; Nonlinear equations; Order of convergence

Indexed keywords

EID: 29544450533     PISSN: 0022247X     EISSN: 10960813     Source Type: Journal    
DOI: 10.1016/j.jmaa.2005.09.086     Document Type: Article

References (11)

1. G.E. Alfeld F.A. Potra Some efficient methods for enclosing simple zeros of nonlinear equations BIT 32 1992 334-344
2. P. Butzer F. Jongmans P.L. Chebyshev. A guide to his life and work J. Approx. Theory 96 1999 111-138
3. P.L. Chebyshev Complete Collected Works, vol. V 1951 Izd. Akad. Nauk SSSR 474 pp
4. F. Costabile M.I. Gualtieri R. Luceri A new iterative method for the computation of the solutions of nonlinear equations Numer. Algorithms 28 2001 87-100
5. L. Euler Opera Omnia, Ser. 1, vol. 10 1913 B.G. Teubner pp. 422-455
6. M. Grau M. Noguera A variant of Cauchy's method with accelerated fifth-order convergence Appl. Math. Lett. 17 2004 509-517
7. A. Ralston P. Rabinowitz A First Course in Numerical Analysis 1983 McGraw-Hill
8. E. Schröder Über unendlich viele Algorithmen zur Auflösung der Gleichungen Math. Ann. 2 1870 317-365
9. J. Stoer R. Bulirsch Introduction to Numerical Analysis 1983 Springer-Verlag
10. J.F. Traub Iterative Methods for the Solution of Equations 1964 Prentice Hall
11. F. Wright Computing with Maple 2001 Chapman & Hall