Abstract
This paper presents a new algorithm to approximate the nth root of a given real number z. The proposed algorithm is a hybrid algorithm between the Bisection method and the combination of the inverse of sine series and Newton’s method. The proposed algorithm will be tested to find the numerical results on Matlab programming. The results showed that if z > 1, the proposed method converges with the initial interval [1, z] and if 0 < z < 1, it converges with initial interval [0,4]. The comparison of the obtained result with Newton’s method and AS-Newton’s method shown that the efficiency of the proposed algorithm may better than both of them concerning the initial value.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
