Efficient and stable derivative-free Steffensen algorithm for root finding

2025/03/13 by Wagemakers, Alexandre, Periwal, Vipul
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2503.10402

Abstract

We explore a family of numerical methods, based on the Steffensen divided difference iterative algorithm, that do not evaluate the derivative of the objective functions. The family of methods achieves second-order convergence with two function evaluations per iteration with marginal additional computational cost. An important side benefit of the method is the improvement in stability for different initial conditions compared to the vanilla Steffensen method. We present numerical results for scalar functions, fields, and scalar fields. This family of methods outperforms the Steffensen method with respect to standard quantitative metrics in most cases.

Related

• A novel Newton-Raphson style root finding algorithm
• A slight generalization of Steffensen Method for Solving Non Linear Equations
• New Efficient Steffensen Type method for Solving Nonlinear Equations
• Full linear multistep methods as root-finders
• Self-accelerating root search and optimisation methods based on rational\n interpolation