A new cubic method for computing a root

International Journal of Computer Mathematics

Volumn 73, Issue 2, 1999, Pages 243-251

  Shaw, R E ^a   Garey, L E ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Asymptotic convergence; Newton cubic order method; Simple root

Indexed keywords

FUNCTION EVALUATION; NUMERICAL METHODS; ALGORITHMS; ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; NUMERICAL ANALYSIS;

ASYMPTOTIC CONVERGENCE; CUBIC ORDER; FIRST DERIVATIVE; HYBRID PROCEDURE; NUMERICAL RESULTS; ROOT-FINDING METHODS; SECOND DERIVATIVES; SIMPLE ROOT;

ITERATIVE METHODS; COMPUTATIONAL METHODS;

CUBIC METHOD; NEWTON QUADRATIC FINDING METHOD; SECANT METHOD; STEFFENSEN METHOD; SUPERLINEAR METHOD;

EID: 0033282032     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169908804892     Document Type: Article

References (4)

1. Baptist, P. (1982). Monotone enclosings of solutions of the Steffensen-type, Int. J. Math. Educ. Sei. Technol., 12, 273-280.
2. Cheney, W. and Kincaid, D. (1994). Numerical Mathematics and Computing, third edition, Brooks/Cole.
3. Dowell, M. and Jarratt, P. (1972). The "Pegasus" method for computing the root of an equation, BIT 12, pp. 503-508.
4. Garey, L. E. and Shaw, R. E. (1985). A SteHensen-type method for computing a root, Intern. J. Computer Math., 18, 185-190.