Hierarchical matrices are an efficient framework for large-scale fully populated matrices arising, e.g., from the finite element discretization of solution operators of elliptic boundary value problems. In addition to storing such matrices, approximations of the usual matrix operations can be computed with logarithmic-linear complexity, which can be exploited to setup approximate preconditioners in an efficient and convenient way. Besides the algorithmic aspects of hierarchical matrices, the main aim of this book is to present their theoretical background. The book contains the existing approximation theory for elliptic problems including partial differential operators with nonsmooth coefficients. Furthermore, it presents in full detail the adaptive cross approximation method for the efficient treatment of integral operators with non-local kernel functions. The theory is supported by many numerical experiments from real applications.
| Autorius: | Mario Bebendorf |
| Serija: | Lecture Notes in Computational Science and Engineering |
| Leidėjas: | Springer Berlin Heidelberg |
| Išleidimo metai: | 2008 |
| Knygos puslapių skaičius: | 312 |
| ISBN-10: | 3540771468 |
| ISBN-13: | 9783540771463 |
| Formatas: | Knyga minkštu viršeliu |
| Kalba: | Anglų |
| Žanras: | Differential calculus and equations |
Parašykite atsiliepimą apie „Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems“
