Studi Komparatif Efisiensi Komputasi antara Metode Newton-Raphson dan Metode Bierge-Vieta pada Pencarian akar Polinomial

Hafnani; Muna Irawan; T. Murdani Saputra; Taufiq Iskandar; Syarifah Meurah Yuni; Saiful Amri

doi:10.35472/indojam.v6i1.2450

Hafnani Syiah Kuala University
Muna Irawan Departemen Matematika Unversitas Syiah Kuala
T. Murdani Saputra
Taufiq Iskandar Departemen Matematika Unversitas Syiah Kuala
Syarifah Meurah Yuni
Saiful Amri

DOI: https://doi.org/10.35472/indojam.v6i1.2450

Keywords: polynomial roots, Newton-Raphson method, Birge-Vieta method, complexcity, computational time

Abstract

The Newton-Raphson method is a commonly used numerical method for finding polynomial roots, but its computational efficiency can be a concern. This paper compares the computational efficiency of the Newton-Raphson and Birge-Vieta methods by analyzing their computational time. Both methods have similar convergence rates and complexity. For low-degree polynomials ( ), the Newton-Raphson method shows faster computational time. This is likely due to the larger algorithmic overhead of the Birge-Vieta method.

Downloads

Download data is not yet available.

References

S. N. Hutagalung, “Pemahaman Metode Numerik (Studi Kasus Metode New-Rhapson) Menggunakan Pemprograman Matlab”, Jurnal Teknologi Informasi, Vol. 1, pp. 95-100, Juli 2017

V. B. Alekseev, Abel’s Theorem in Problems and Solutions, New York: Kluwer Academic Publishers, 2004.

S. D. Conte and Carl de Boor, Elementary Numerical Analysis, New York: McGraw-Hill Book Company, 1980.

S. C. Chapra and R. P. Canale, Numerical Methods for Engineers, New York: McGraw-Hill Education, 2015.

Deepika and P. Kumar, Solution Of Non-Linear Equations in One Variable, New Delhi: Indira Gandhi National Open University, 2021.

T. A. Nurman, “Analisis perbandingan metode Muller dan metode Birge-vieta dalam menyelesaikan persamaan polinomial”, Jurnal MSA (Matematika dan Statistika serta Aplikasinya), Vol. 9, pp. 81-88, Desember 2021.

T. A. Nurman, A. Mariani, dan R. Nurhidayat, “Perbandingan Metode Muller dan Metode Newton-Raphson dengan Dekomposisi Adomian yang Dimodifikasi dalam Menyelesaikan Persamaan Polinomial”, Journal of Mathematics: Theory and Applications, Vol. 6, pp. 42-54, April 2024.

N. Hafidz, M. Rofi, dan A. Priyanto, “Penggunaan Prosedur Regula-Falsi dan Interval Bagi Dua untuk Pencarian Akar pada Fungsi Polinomial Berderajat Tiga”, Journal Social, Science, and Education (Soscied), Vol. 6, pp. 6-12, Juli 2023.

Tian-Xiao He and P. Shiue, “A note on Horner’s method”, Journal of Concrete and Applicable Mathematics, Vol. 10, 2012

J. Kiusalaas, Numerical Methods in Engineering with Python 3, New York: Cambridge University Press, 2013.

R. K. Setyansah dan D. Apriandi, Analisis Numerik: Pemograman Matlab berbasis Simulasi e-Learning, Yogyakarta: Deepublish, 2018.