About this book
During the last decade essential progress has been achieved in the analysis and implementation of multilevel/rnultigrid and domain decomposition methods to explore a variety of real world applications. An important trend in mod ern numerical simulations is the quick improvement of computer technology that leads to the well known paradigm (see, e. g. , [78,179]): high-performance computers make it indispensable to use numerical methods of almost linear complexity in the problem size N, to maintain an adequate scaling between the computing time and improved computer facilities as N increases. In the h-version of the finite element method (FEM), the multigrid iteration real izes an O(N) solver for elliptic differential equations in a domain n c IRd d with N = O(h- ) , where h is the mesh parameter. In the boundary ele ment method (BEM) , the traditional panel clustering, fast multi-pole and wavelet based methods as well as the modern hierarchical matrix techniques are known to provide the data-sparse approximations to the arising fully populated stiffness matrices with almost linear cost O(Nr log?Nr), where 1 d Nr = O(h - ) is the number of degrees of freedom associated with the boundary. The aim of this book is to introduce a wider audience to the use of a new class of efficient numerical methods of almost linear complexity for solving elliptic partial differential equations (PDEs) based on their reduction to the interface.
Operator Poincaré-Steklov operators data-sparse approximation differential equation elliptic equations finite element method finite element methods multilevel methods partial differential equation
Springer-Verlag Berlin Heidelberg 2004
Springer, Berlin, Heidelberg
Springer Book Archive
Series Print ISSN
About this book