New York: Springer, 2003. - 349 p.This introductory book directs the reader to a selection of useful elementary numerical algorithms on a reasonably sound theoretical basis, built up within the text. The primary aim is to develop algorithmic thinking-emphasizing long-living computational concepts over fast changing software issues. The guiding principle is to explain modern numerical analysis concepts applicable in complex scientific computing at much simpler model problems. For example, the two adaptive techniques in numerical quadrature elaborated here carry the germs for either exploration methods or multigrid methods in differential equations, which are not treated here. The presentation draws on geometrical intuition wherever appropriate, supported by large number of illustrations. Numerous exercises are included for further practice and improved understanding. This text will appeal to undergraduate and graduate students as well as researchers in mathematics, computer science, science, and engineering. At the same time, it is addressed to practical computational scientists who, via self-study, wish to become acquainted with modern concepts of numerical analysis and scientific computing on an elementary level. The sole prerequisite is undergraduate knowledge in linear algebra and calculus.Contents :Front Matter Linear Systems Error Analysis Linear Least-Squares Problems Nonlinear Systems and Least-Squares Problems Linear Eigenvalue Problems Three-Term Recurrence Relations Interpolation and Approximation Large Symmetric Systems of Equations and Eigenvalue Problems Definite Integrals Back Matter
Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.