Abstract
We revisit the way the Chebyshev-Halley family of iteration func- tions of order 3 is obtained by considering a linear combination of two Newton's iteration functions. We also make some remarks on the iteration functions when they are applied to the n-th root computation problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pure and Apllied Mathematics
Paper Title
Journal
Date
