.png){kind=icon}
.png){kind=icon}
Return
Progressive explicit formulae for root-finding problems based on reparameterization
.png){kind=icon}
PRE
AI
DOI：10.1007/s11766-025-4808-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an explicit formula based on reparameterization technique for progressively computing a simple root of a smooth function, which may have wide applications in robotics, geomagnetic navigation, geometric processing and computer graphics. Comparing with Newton-like method, it can achieve convergence rate 2 by adding one more functional evaluation, improve the computational stability and ensure the convergence, and also obtain higher convergence rate and higher efficiency index. Compared with clipping methods for polynomials, it doesn't need to bound the polynomials, directly bound the roots and can also work well for non-polynomial functions with much higher computational efficiency. Comparing with previous progressive methods, it achieves a much higher computational efficiency and is extended to solve bivariate equation system. Numerical examples show its much better performance on approximation error, computational efficiency and computational stability.
Keywords:
root-finding
re-parameterization-based method
clipping method
numerical iterative method
convergence order
non-linear equation system
progressive explicit formulae
Journal
A
IF:
1.3
Papers:
30
Citations:
0