Generation of root finding algorithms via perturbation theory and some formulas

Applied Mathematics and Computation

Volumn 184, Issue 2, 2007, Pages 783-788

  Pakdemirli, Mehmet ^a   Boyaci, Hakan ^a  

^a CELAL BAYAR UNIVERSITY   (Turkey)

Author keywords

Higher order iteration formulas; Householder's iteration; Newton Raphson method; Perturbation theory; Root finding algorithms

Indexed keywords

ALGORITHMS; NUMERICAL ANALYSIS; PERTURBATION TECHNIQUES;

HIGHER ORDER ITERATION FORMULAS; NEWTON-RAPHSON METHOD; ROOT FINDING ALGORITHMS;

COMPUTATION THEORY;

EID: 33846609124     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.05.207     Document Type: Article

References (4)

1. Abbasbandy S. Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method. Applied Mathematics and Computation 145 (2003) 887-893
2. Nayfeh A.H. Introduction to Perturbation Techniques (1981), John Wiley and Sons, New York
3. Hinch E.J. Perturbation Methods (1991), Cambridge University Press, New York
4. Householder A.S. The Numerical Treatment of a Single Nonlinear Equation (1970), McGraw-Hill, New York