2010Journal of Mathematics and StatisticsOpen access

The Exact Root Algorithm for Computing the Real Roots of an Nth Degree Polynomial

Adebile

Open full text 0 citations

Abstract

Problem statement: The need to find an efficient and reliable algorithm for computing the exact real roots of the steady-state polynomial encountered in the investigation of temperature profiles in biological tissues during Microwave heating and other similar cases as found in the literature gave rise to this study.Approach: The algorithm (simply called ERA-Exact Root Algorithm) adopted polynomial deflation technique and uses Newton-Raphson iterative procedure though with a modified termination rule.A general formula was specified for finding the initial approximation so as to overcome the limitation of local convergence which is inherent in Newton's method.Results: A new algorithm for finding the real roots of an nth degree polynomial at a practically low computational cost was obtained.Conclusion/Recommendations: ERA is simple, flexible, easy to use and has clear benefits and preferences to a number of existing methods.

Open-access reader

About this research paper

What this paper is about

Problem statement: The need to find an efficient and reliable algorithm for computing the exact real roots of the steady-state polynomial encountered in the investigation of temperature profiles in biological tissues during Microwave heating and other similar cases as found in the literature gave rise to this study.Approach: The algorithm (simply called ERA-Exact Root Algorithm) adopted polynomial deflation technique and uses Newton-Raphson iterative procedure though with a modified termination rule.A general formula was specified for finding the initial approximation so as to overcome the limitation of local convergence which is inherent in Newton's method.Results: A new algorithm for finding the real roots of an nth degree polynomial at a practically low computational cost was obtained.Conclusion/Recommendations: ERA is simple, flexible, easy to use and has clear benefits and preferences to a number of existing methods.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Problem statement: The need to find an efficient and reliable algorithm for computing the exact real roots of the steady-state polynomial encountered in the investigation of temperature profiles in biological tissues during Microwave heating and other similar cases as found in the literature gave rise to this study.Approach: The algorithm (simply called ERA-Exact Root Algorithm) adopted polynomial deflation technique and uses Newton-Raphson iterative procedure though with a modified termination rule.A general formula was specified for finding the initial approximation so as to overcome the limitation of local convergence which is inherent in Newton's method.Results: A new algorithm for finding the real roots of an nth degree polynomial at a practically low computational cost was obtained.Conclusion/Recommendations: ERA is simple, flexible, easy to use and has clear benefits and preferences to a number of existing methods.

Key concepts: Mathematics, Degree (music), Convergence (economics), Properties of polynomial roots, Polynomial, Root (linguistics), Newton's method, Root-finding algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
The Exact Root Algorithm for Computing the Real Roots of an Nth Degree Polynomial — Research Paper | ScholarLens