Comparative Study of Various Iterative Numerical Methods for Computation of Approximate Root of the Polynomials
Roopa K M1, Venkatesha P2
1Dr. Roopa K M*, Department of Mathematics, Bangalore Institute of Technology, Bengaluru, India.
2Venkatesha P, Department of Mathematics, Sri Sairam College of Engineering, Bengaluru, India.
Manuscript received on November 23, 2021. | Revised Manuscript received on November 29, 2021. | Manuscript published on December 30, 2021. | PP: 6-11 | Volume-11, Issue-2, December 2021 | Retrieval Number: 100.1/ijitee.B96351211221 | DOI: 10.35940/ijitee.B9635.1211221
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The aim of this article is to present a brief review and a numerical comparison of iterative methods applied to solve the polynomial equations with real coefficients. In this paper, four numerical methods are compared, namely: Horner’s method, Synthetic division with Chebyshev method (Proposed Method), Synthetic division with Modified Newton Raphson method and Birge-Vieta method which will helpful to the readers to understand the importance and usefulness of these methods.
Keywords: Horner’s method, Synthetic division, Chebyshev method, Modified Newton Raphson method and Birge-Vieta method.
Scope of the Article: Cloud Computing Various.