Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- 1 April 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 10 (2) , 327-344
- https://doi.org/10.1137/0710031
Abstract
We compare the Ostrowski efficiency of some methods for solving systems of nonlinear equations without explicitly using derivatives. The methods considered include the discrete Newton method, Shamanskii’s method, the two-point secant method, and Brown’s methods. We introduce a class of secant methods and a class of methods related to Brown’s methods, but using orthogonal rather than stabilized elementary transformations. The idea of these methods is to avoid finding a new approximation to the Jacobian matrix of the system at each step, and thus increase the efficiency. Local convergence theorems are proved, and the efficiencies of the methods are calculated. Numerical results are given, and some possible extensions are mentioned.Keywords
This publication has 29 references indexed in Scilit:
- On the Davidenko-Branin Method for Solving Simultaneous Nonlinear EquationsIBM Journal of Research and Development, 1972
- The Computational Complexity of Iterative Methods for Systems of Nonlinear EquationsPublished by Springer Nature ,1972
- The convergence of single-rank quasi-Newton methodsMathematics of Computation, 1970
- A Quadratically Convergent Newton-Like Method Based Upon Gaussian EliminationSIAM Journal on Numerical Analysis, 1969
- A New Method of Solving Nonlinear Simultaneous EquationsThe Computer Journal, 1969
- On Newton-like iteration functions: General convergence theorems and a specific algorithmNumerische Mathematik, 1968
- Quasi-Newton methods and their application to function minimisationMathematics of Computation, 1967
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained ProblemsThe Computer Journal, 1966
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965
- A KDF9 ALGOL list-processing schemeThe Computer Journal, 1965