Hierarchical Matrices A Means to Efficiently Solve Elliptic Boundary Value Problems /
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 comput...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2008.
|
| Edition: | 1st ed. 2008. |
| Series: | Lecture Notes in Computational Science and Engineering,
63 |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-540-77147-0 |
Table of Contents:
- Low-Rank Matrices and Matrix Partitioning
- Hierarchical Matrices
- Approximation of Discrete Integral Operators
- Application to Finite Element Discretizations.