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

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

Indonesian Journal of Applied Mathematics
Vol. 6 No. 1 (2026): Indonesian Journal of Applied Mathematics Vol. 6 No. 1 April Chapter

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.