Fast and Stable Polynomial Root Finders - Part Three

Henrik Vestermark

Rate me:

5.00/5 (7 votes)

11 Nov 2023CPOL13 min read

4.3K

Practical implementation of a fast, robust and stable polynomial root finder using Halley's method

We elaborated in the part three paper on higher order method for finding Polynomial roots and devised a modified Halley method dealing efficiently with Polynomials with real coefficients. This paper is part of a multi-series of papers on how to use the same framework to implement different root finder methods.

Views

Daily Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Henrik Vestermark

Denmark

With a Master's degree in Electronic Engineering, I've further specialized in the intersection of Computer Science, Numerical Analysis, and Applied Mathematics. In my earlier career, I gained extensive experience in developing compilers, linkers, and interpreters. This foundational work has equipped me to later focus on designing high-performance algorithms for arbitrary precision arithmetic. My expertise lies in leveraging optimization techniques to solve complex problems within these domains.

Fast and Stable Polynomial Root Finders - Part Three

Views

License

Comments and Discussions