Fast and Stable Polynomial Root Finders - Part Two

Henrik Vestermark

Rate me:

4.60/5 (3 votes)

17 Oct 2023CPOL10 min read

4.4K

Fast and Stable Polynomial root finder for Polynomial with real coefficients

In Part 1, we elaborated how to find Polynomial roots and devised a modified Newton method dealing efficiently with Polynomials with complex coefficients. This part is all about finding Polynomial roots when the polynomial coefficients are real.

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 Two

Views

License

Comments and Discussions