A Quasi Fourth Order Root-Finding Numerical Method (original) (raw)

2012, Huria: Journal of the Open University of Tanzania

Newton’s iteration formula  , 2 , 1 , 0 , ) ( ) ( / 1     n x f x f x x n n n n is a powerful numerical method for solving the root-finding problem 0 ) (  x f . Its simplicity and quadratic rate of convergence have significantly contributed to its popularity with numerical practitioners over its linearly convergent rival methods (bisection, secant and the regula-falsi). Masenge [1973: 51-53] derived a quasi third order convergent method   ) ( ) ( ) ( 2 ) ( ) ( 2

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact