NEWTON - KRYLOV - NEDZHIBOV METHOD SOLUTIONS TO A SYSTEM OF NONLINEAR EQUATIONS WITH QUADRATIC CONVERGENCE RATE

Lại Văn Trung; Quách Thị Mai Liên

doi:10.34238/tnu-jst.7592

NEWTON - KRYLOV - NEDZHIBOV METHOD SOLUTIONS TO A SYSTEM OF NONLINEAR EQUATIONS WITH QUADRATIC CONVERGENCE RATE

About this article

Received: 22/03/23 Revised: 05/05/23 Published: 05/05/23

Authors

1. Lai Van Trung, TNU - University of Information and Communication Technology
2. Quach Thi Mai Lien , TNU - University of Information and Communication Technology

Abstract

Many problems in practical and engineering applications lead to finding solutions to a system of nonlinear equations with large numbers of variables and equations. The problem of finding the exact solution to a system of nonlinear equations is not always feasible, especially for large-scale systems. Therefore, finding approximate solutions to this class of equations is great importance. Since the appearance of the Newton's method, there have been many methods proposed by scientists to address this issue with the support of computer software. Research and development of improved methods for this algorithm are always of interest and focus for scientists. In this paper, we investigate the problem of finding approximate solutions to a system of nonlinear equations using the Newton-Krylov-Nedzhibov method. The convergence of the iterative method can only be confirmed through practical experiments. Using the properties of Krylov space and the properties of the mapping that satisfies the Lipschitz condition, we prove the convergence of the method. Moreover, we present the solution to a nonlinear equation system using Mathlab software.

Keywords

Iterative formula; Quaternary convergence; Nonlinear equations system; Third-order; Newton-Krylov method; Newton-Krylov-Nedzhibov method

Full Text:

PDF (Tiếng Việt)

References

[1] M. Drexler, “Newton method as a global solver for non-linear problems,” Ph.D. Thesis, University of Oxford, 1997.

[2] S. Amat, S. Busquier, and J. M. Gutierrez, “Geometric constructions of iterative methods to solve nonlinear equations,” Comp. Appl. Math, vol. 157, pp. 197-205, 2003.

[3] J. M. Gutierrez and M. A. Hernandez, “A family of Chebyshev-Halley type methods in Banach spaces,” Bull. Austral. Math. Soc., vol. 55, pp. 113-130, 1997.

[4] D. K. R. Babajee, M. Z. Dauhoo, M. T. Darvishi, and A. Barati, “A note on the local convergence of iterative methods based on Adomian decomposition method and 3-node quadrature rule,” Appl. Math. Comput., vol. 200, pp. 452–458, 2008.

[5] D. K. R. Babajee and M. Z. Dauhoo, “An analysis of the properties of the variants of Newton’s method with third order convergence,” Appl. Math. Comput., vol. 183, pp. 659-684, 2006.

[6] D. K. R. Babajee and M. Z. Dauhoo, “Analysis of a family of two-point iterative methods with third order convergence,” in International Conference on Numerical Analysis and Applied Mathematics, T. E. Simos, G. Psihoyios, Ch. Tsitouras, (eds.), WILEY-VCH Verlag GmbH & Co.KGaA, Greece, 2006, pp. 658-661.

[7] A. Cordero and J. R. Torregrosa, “Variants of Newton’s method for functions of several variables,” Appl. Math. Comput., vol. 183, pp. 199-208, 2006.

[8] M. T. Darvishi and A. Barati, “A third-order Newton-type method to solve systems of nonlinear equations,” Appl.Math. Comput., vol. 187, pp. 630-635, 2007.

[9] M. T. Darvishi and A. Barati, “Super cubic iterative methods to solve systems of nonlinear equations,” Appl. Math. Comput., vol. 188, pp. 1678-1685, 2007.

[10] G. H. Nedzhibov, “A family of multi-point iterative methods for solving systems of nonlinear equations,” J. Comput. Appl. Math., vol. 222, pp. 244–250, 2008.

[11] J. E. Dennis and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinears, Prentice Hall, Inc., Englewood Cliffs, NJ, 1983.

DOI: https://doi.org/10.34238/tnu-jst.7592

Refbacks

There are currently no refbacks.



Remember me