An anti-gaussian quadrature rule based iterative method for nonlinear equations

In this study, a groundbreaking third-order algorithm is unveiled for tackling nonlinear equations. This innovative algorithm builds upon Newton’s method, enhanced by an anti-Gaussian technique applied to the Haar wavelet-based quadrature rule. Through this advancement, the convergence order of Newton’s method has been improved significantly. The new iterative approach boasts a convergence order of three, surpassing its predecessor. Various functions are tested to showcase the remarkable efficiency of this new method. The number of iterations, approximate roots, convergence order, runtime, and absolute error of the roots are computed in the numerical computation section. The analysis reveals that the newly developed algorithm not only requires fewer iterations but also achieves shorter runtimes, lower absolute errors, and a higher convergence order for each function as compared to other existing methods. This stands as a testament to the power of innovation in mathematical solutions.

Authors

Institutions

Publication Details

Journal
Ceylon Journal of Science
Published
2026-11-19
DOI
https://doi.org/10.4038/cjs.v55i4.9149
Primary Topic
Iterative Methods for Nonlinear Equations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

An anti-gaussian quadrature rule based iterative method for nonlinear equations

Tusar Singh, Rostam Kareem Saeed, Rajani Ballav Dash
Ceylon Journal of Science
Iterative Methods for Nonlinear Equations
article

An anti-gaussian quadrature rule based iterative method for nonlinear equations

Tusar Singh, Rostam Kareem Saeed, Rajani Ballav Dash
article en

Abstract

In this study, a groundbreaking third-order algorithm is unveiled for tackling nonlinear equations. This innovative algorithm builds upon Newton’s method, enhanced by an anti-Gaussian technique applied to the Haar wavelet-based quadrature rule. Through this advancement, the convergence order of Newton’s method has been improved significantly. The new iterative approach boasts a convergence order of three, surpassing its predecessor. Various functions are tested to showcase the remarkable efficiency of this new method. The number of iterations, approximate roots, convergence order, runtime, and absolute error of the roots are computed in the numerical computation section. The analysis reveals that the newly developed algorithm not only requires fewer iterations but also achieves shorter runtimes, lower absolute errors, and a higher convergence order for each function as compared to other existing methods. This stands as a testament to the power of innovation in mathematical solutions.

Ceylon Journal of ScienceVol. 55(4)
Siksha O Anusandhan University (IN), Salahaddin University-Erbil (IQ), Ravenshaw University (IN)
Iterative Methods for Nonlinear Equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon