PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 28, 2026Applied and Computational Mathematics0 citationsOpen Access

Solution of Nonlinear Equations Using the Modified Steffensen’s Type Method

CNClement NnedinmaBEBazuaye Etin-Osa

Key Points

  • This work aims to modify and analyze high order derivative-free iterative methods for finding roots of nonlinear equations.
  • Developed a modification of Steffensen’s scheme for nonlinear equations.
  • Introduced a combination of forward difference formula with Simpson’s quadrature.
  • Validated the theoretical convergence with several numerical examples.
  • The modified method shows improved convergence for nonlinear functions with simple roots.
  • Numerical comparisons indicate advantages over traditional methods in terms of efficiency and effectiveness.

Abstract

The root-finding problem is one of the most important problems in Numerical Analyis. It arises in a wide variety of practical applications in physics, chemistry, biosciences, engineering, etc. As a matter of fact, determination of any unknown appearing implicitly led to the evolution of root-finding problem. Therefore, this paper focuses on the modification and analysis of a high order derivative-free iteration methods for finding roots of nonlinear algebraic equations of the form f (x) = 0. The methods require only one initial approximation. The proposed method is seen as an extension of the second-order Steffensen’s scheme, which is an Iterative method for approximating roots of non-linear equations which often breaks down when the derivative of the function value is zero or near zero at the point of iteration. This work therefore, seeks to introduce a method that overcomes such breakdown. The method herein is a combination of forward difference formula with Simpson’s quadrature in spirit of Steffensen. The idea is to modify the Steffensen’s method, which were recently developed to obtain derivative-free methods. The modified methods are shown to converge. We also describe how to obtain derivative-free methods to find solutions to multiple roots. Several numerical examples are provided to validate the theoretical order of convergence for nonlinear functions with simple roots and results obtained show the comparative advantage the proposed method has over well-known methods.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Nnedinma et al. (2026) studied this question.

synapsesocial.com/papers/6a17dc9d3fad632b0f9d94aahttps://doi.org/10.11648/j.acm.20261503.12
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1COMPARATIVE STUDY OF NONLINEAR ROOT FINDING USING IMPROVISED SECANT METHODS2023 · 1 citations
  2. 2Steffensen type methods for solving nonlinear equations2010 · 66 citations
  3. 3On the convergence of a class of generalized steffensen's iterative procedures and error analysis1990 · 11 citations
  4. 4A Comparative Study among New Hybrid Root Finding Algorithms and Traditional Methods2021 · 26 citations
  5. 5Comparison of Some Iterative Methods of Solving Nonlinear Equations2018 · 13 citations