Claim Missing Document
Check
Articles

Found 1 Documents
Search

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
Indonesian Journal of Applied Mathematics Vol. 6 No. 1 (2026): Indonesian Journal of Applied Mathematics Vol. 6 No. 1 April Chapter
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat (LPPM), Institut Teknologi Sumatera, Lampung Selatan, Lampung, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35472/indojam.v6i1.2450

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.