About this book
This book is based on a one-year introductory course on numerical analysis given by the authors at several universities in Germany and the United States. The authors concentrate on methods which can be worked out on a digital computer. For important topics, algorithmic descriptions (given more or less formally in ALGOL 60), as well as thorough but concise treatments of their theoretical founda tions, are provided. Where several methods for solving a problem are presented, comparisons of their applicability and limitations are offered. Each comparison is based on operation counts, theoretical properties such as convergence rates, and, more importantly, the intrinsic numerical properties that account for the reliability or unreliability of an algorithm. Within this context, the introductory chapter on error analysis plays a special role because it precisely describes basic concepts, such as the numerical stability of algorithms, that are indispensable in the thorough treatment of numerical questions. The remaining seven chapters are devoted to describing numerical methods in various contexts. In addition to covering standard topics, these chapters encom pass some special subjects not usually found in introductions to numerical analysis. Chapter 2, which discusses interpolation, gives an account of modem fast Fourier transform methods. In Chapter 3, extrapolation techniques for spe~d ing up the convergence of discretization methods in connection with Romberg integration are explained at length.
Analysis Eigenvalue algorithms boundary element method calculus convergence differential equation integration interpolation mathematics minimum numerical analysis numerical method ordinary differential equation stability