Abstract
One of the greatest problems in numerical methods is to provide high speed and stability at the same time. In this paper, we propose a new hybrid root finding algorithm, based on the appropriate combination of bisection, false position and the Anderson-Bjork’s method. In the general case, the achieved convergence is compatible to the fastest available methods, while stable performance in the worst case is provided. A comparative analysis versus popular root finding algorithms is performed as well. For that purpose, the respective procedures are implemented in the C# programming language. The proposed algorithm is included into the Calcpad engineering calculations platform.
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: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
