
- 560 pages
- English
- PDF
- Available on iOS & Android
Advances in the Efficiency of Computational Methods and Applications
About this book
This invaluable textbook creates a general framework for the study of optimal iterative procedures for problems that are solved approximately. Emphasis is given to the efficiency of numerical methods. For generality the setting is abstract, but the book presents many applications to practical problems, allowing the reader to take advantage of the most modern high speed calculating devices, and provides examples to illustrate concepts and major theorems. The examples are selected from astrophysics (radiative transfer and the kinetic theory of gases), mechanics (elasticity), economics (predator–prey problems), the n -dimensional Euclidean space and other applied areas. At the end of the textbook, contemporary numerical algorithms to be used for high speed computations have been included.
The book will benefit not only senior undergraduates, graduate students and researchers in the field but also those who wish to obtain information about specific results or techniques that take into account the particular nature of the equation.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Contents
- Preface
- Chapter 1 Divided Differences
- Chapter 2 Constants and Functions Appearing in Numerical Methods
- Chapter 3 Convergence and Error Analysis for Iterative Methods
- Chapter 4 Special Topics
- Chapter 5 Convergence in Generalized Banach Spaces
- Chapter 6 Discretization of Newton-Like Methods
- Chapter 7 Convergence Analysis Based on the Second Fréchet-Derivative
- Chapter 8 Forcing Sequences and the Second Fréchet-Derivative
- Appendix A Numerical Algorithms
- References
- Glossary of Symbols
- Index