Numerical simulation(s) of non-linear equations by the modified secant method

Inderjeet; Rashmi Bhardwaj

doi:10.5269/bspm.78976

Inderjeet Guru Gobind Singh Indraprastha University, Dwarka, Delhi-110078
Rashmi Bhardwaj Guru Gobind Singh Indraprastha University, Dwarka, Delhi-110078

Abstract

Non-linear equations arise in many fields of science and engineering. Solving these equations numerically is often challenging due to their complex nature. This paper presents a modified secant method for numerically simulating and approximating the roots of Non-linear equations. The proposed method enhances the convergence rate and efficiency compared to the traditional secant method by incorporating higher-order derivative information. Theoretical analysis and numerical experiments demonstrate the effectiveness and robustness of the modified secant method for solving a wide range of Non-linear problems. Comparisons with other established numerical methods highlight the advantages of the proposed approach in terms of accuracy, convergence speed, and computational cost. The modified secant method is a promising numerical tool for tackling Non-linear equations in various applications.

Downloads

Download data is not yet available.

References

J. M. Ortega and W. C. Rheinboldt, Iterative solution of nonlinear equations in several variables, SIAM (2000).

C. T. Kelley, Iterative methods for linear and nonlinear equations, SIAM (1995).

J. F. Traub, Iterative methods for the solution of equations, American Mathematical Society 312 (1982).

A. Ostowski, Solution of equations and system of equation, s(1960).

J. E. Dennis Jr and R. B. Schnabel, Numerical methods for unconstrained optimization and nonlinear equations, SIAM (1996).

M. Hernandez, M., A modification of the secant method for nonlinear equations. Bull. Malays. Math. Sci. Soc. 22, 135-141, (1999).

H. Homeier, H., A modified newton method for rootfinding with cubic convergence. J. Comput. Appl. Math. 157 1, 227-230, (2003).

A. A. Magrenan, A. A., Different anomalies in a jarratt family of iterative root-finding methods. Appl. Math. Comput. 233, 29-38, (2014).

S. Amat, S. Busquier, J. Gutierrez., Third-order iterative methods with applications to hammerstein equations: a unified approach. J. Comput. Appl. math. 235 9, 2936-2943, (2011).

L. Burden, J.D. Faires, Numerical Analysis, Boston: Brooks/Cole (2011).

A .A. Magrenan, I. K. Argyros., On the local convergence and the dynamics of chebyshev–halley methods with six and eight order of convergence. J. Comput. Appl. Math. 298, 236-251, (2016).

J. W. Schmidt., On the convergence of fixed-point iterations and related methods. Comput. 24 2, 141-148, (1980).

M. Hernandez, M. Salanov., A family of chebyshev-halley type methods. Int. J. Comput. Math. 47 (1-2), 59-63, (1993).

J. M. Gutierrez, M. A. Hernandez., A family of chebyshev-halley type methods in banach spaces. Bull. Aust. Math. Soc. 55 1, 113-130, (1997).

H. H. Homeier., On newton-type methods with cubic convergence. J. comput. appl. math. 176 2, 425-432, (2005).