Abstract

This chapter discusses the processes that may be viewed as generalizations of methods for the solution of one equation in one unknown, such as the n-dimensional counterparts of Newton's method, the secant method, Steffensen's method, and their variations. The chapter discusses generalizations of iterative methods for linear systems of equations, with particular emphasis on successive over-relaxation methods. A number of other processes are also discussed in the chapter, which are attempts to provide a technique for overcoming the problem of finding a suitable initial approximation. In many applications, the system of equations to be solved arises in the attempt to find a minimizer or a critical point of a related nonlinear functional. The Newton and secant methods represent generalizations of one-dimensional iteration methods. The chapter discusses a class of processes that arise from iterative methods used for linear systems of equations. A characteristic of the generalized linear methods is that they all exhibit only a linear rate of convergence except under special circumstances.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.