From linear to nonlinear iterative methods
- 30 April 2003
- journal article
- Published by Elsevier BV in Applied Numerical Mathematics
- Vol. 45 (1), 59-77
- https://doi.org/10.1016/s0168-9274(02)00235-0
Abstract
This paper constitutes an effort towards the generalization of the most common classical iterative methods used for the solution of linear systems (like Gauss–Seidel, SOR, Jacobi, and others) to the solution of systems of nonlinear algebraic and/or transcendental equations, as well as to unconstrained optimization of nonlinear functions. Convergence and experimental results are presented. The proposed algorithms have also been implemented and tested on classical test problems and on real-life artificial neural network applications and the results to date appear to be very promising.Keywords
This publication has 22 references indexed in Scilit:
- Locating and computing in parallel all the simple roots of special functions using PVMJournal of Computational and Applied Mathematics, 2001
- Improving the Convergence of the Backpropagation Algorithm Using Learning Rate Adaptation MethodsNeural Computation, 1999
- Minimisation methods for training feedforward neural networksNeural Networks, 1994
- Speed up learning and network optimization with extended back propagationNeural Networks, 1993
- Global Convergence Properties of Conjugate Gradient Methods for OptimizationSIAM Journal on Optimization, 1992
- Solving systems of nonlinear equations using the nonzero value of the topological degreeACM Transactions on Mathematical Software, 1988
- Bisection is optimalNumerische Mathematik, 1982
- Testing Unconstrained Optimization SoftwareACM Transactions on Mathematical Software, 1981
- Textural Features for Image ClassificationIEEE Transactions on Systems, Man, and Cybernetics, 1973
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964