Hierarchical matrices : a means to efficiently solve elliptic boundary value problems
Author(s)
Bibliographic Information
Hierarchical matrices : a means to efficiently solve elliptic boundary value problems
（Lecture notes in computational science and engineering, 63）
Springer, c2008
- : [pbk.]
Available at 4 libraries
Note
Includes bibliographical reference (p. 269-279) and index
"With 45 Figures and 53 Tables"
Description and Table of Contents
Description
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.
Table of Contents
Low-Rank Matrices and Matrix Partitioning.- Hierarchical Matrices.- Approximation of Discrete Integral Operators.- Application to Finite Element Discretizations.
by "Nielsen BookData"