Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Hierarchical Matrices: Algorithms and Analysis
This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists in computational mathematics, physics, chemistry and engineering.
Integral Equations
The theory of integral equations has been an active research field for many years and is based on analysis, function theory, and functional analysis. On the other hand, integral equations are of practical interest because of the «boundary integral equation method», which transforms partial differential equations on a domain into integral equations over its boundary. This book grew out of a series of lectures given by the author at the Ruhr-Universitat Bochum and the Christian-Albrecht-Universitat zu Kiel to students of mathematics. The contents of the first six chapters correspond to an intensive lecture course of four hours per week for a semester. Readers of the book require background f...
Iterative Solution of Large Sparse Systems of Equations
In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.
Tensor Spaces and Numerical Tensor Calculus
Special numerical techniques are already needed to deal with n × n matrices for large n. Tensor data are of size n × n ×...× n=nd, where nd exceeds the computer memory by far. They appear for problems of high spatial dimensions. Since standard methods fail, a particular tensor calculus is needed to treat such problems. This monograph describes the methods by which tensors can be practically treated and shows how numerical operations can be performed. Applications include problems from quantum chemistry, approximation of multivariate functions, solution of partial differential equations, for example with stochastic coefficients, and more. In addition to containing corrections of the unavoidable misprints, this revised second edition includes new parts ranging from single additional statements to new subchapters. The book is mainly addressed to numerical mathematicians and researchers working with high-dimensional data. It also touches problems related to Geometric Algebra.
The Concept of Stability in Numerical Mathematics
In this book, the author compares the meaning of stability in different subfields of numerical mathematics. Concept of Stability in numerical mathematics opens by examining the stability of finite algorithms. A more precise definition of stability holds for quadrature and interpolation methods, which the following chapters focus on. The discussion then progresses to the numerical treatment of ordinary differential equations (ODEs). While one-step methods for ODEs are always stable, this is not the case for hyperbolic or parabolic differential equations, which are investigated next. The final chapters discuss stability for discretisations of elliptic differential equations and integral equations. In comparison among the subfields we discuss the practical importance of stability and the possible conflict between higher consistency order and stability.
Multi-Grid Methods and Applications
Multi-grid methods are the most efficient tools for solving elliptic boundary value problems. The reader finds here an elementary introduction to multi-grid algorithms as well as a comprehensive convergence analysis. One section describes special applications (convection-diffusion equations, singular perturbation problems, eigenvalue problems, etc.). The book also contains a complete presentation of the multi-grid method of the second kind, which has important applications to integral equations (e.g. the "panel method") and to numerous other problems. Readers with a practical interest in multi-grid methods will benefit from this book as well as readers with a more theoretical interest.
Elliptic Differential Equations
Derived from a lecture series for college mathematics students, introduces the methods of dealing with elliptical boundary-value problems--both the theory and the numerical analysis. Includes exercises. Translated and somewhat expanded from the 1987 German version. Annotation copyright by Book News, Inc., Portland, OR
Elliptic Differential Equations
This book simultaneously presents the theory and the numerical treatment of elliptic boundary value problems, since an understanding of the theory is necessary for the numerical analysis of the discretisation. It first discusses the Laplace equation and its finite difference discretisation before addressing the general linear differential equation of second order. The variational formulation together with the necessary background from functional analysis provides the basis for the Galerkin and finite-element methods, which are explored in detail. A more advanced chapter leads the reader to the theory of regularity. Individual chapters are devoted to singularly perturbed as well as to elliptic eigenvalue problems. The book also presents the Stokes problem and its discretisation as an example of a saddle-point problem taking into account its relevance to applications in fluid dynamics.
