Computational Theory of Iterative MethodsBy
- Ioannis Argyros
The book is designed for researchers, students and practitioners interested in using fast and efficient iterative methods to approximate solutions of nonlinear equations. The following four major problems are addressed. Problem 1: Show that the iterates are well defined. Problem 2: concerns the convergence of the sequences generated by a process and the question of whether the limit points are, in fact solutions of the equation. Problem 3: concerns the economy of the entire operations. Problem 4: concerns with how to best choose a method, algorithm or software program to solve a specific type of problem and its description of when a given algorithm succeeds or fails. The book contains applications in several areas of applied sciences including mathematical programming and mathematical economics. There is also a huge number of exercises complementing the theory.
Primary market(s):Researchers in the USASecondary market(s):Researchers in Western Europe, South Korea & Japan
Studies in Computational Mathematics
Hardbound, 504 Pages
Published: September 2007
- 1. Linear Spaces2. Monotone convergence3. Contractive Fixed Point Theory4. Solving Smooth Equations5. Newton-like methods6. More Results on Newton's Method7. Equations with Nonsmooth Operators8. Applications of the weaker version of the Newton-Kantorovich theorem9. The Newton-Kantorovich Theorem and Mathematical Programming10. Generalized equations11. Monotone convergence of point to set-mapping12. Fixed points of point-to-set mappings13. Special topicsBibliographyA Glossary of SymbolsIndex