scispace - formally typeset
Open AccessJournal ArticleDOI

Introduction to Hierarchical Matrices with Applications

TLDR
A short introduction to methods for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods, as the inverses of partial differential operators or as solutions of control problems.
Abstract
We give a short introduction to methods for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods, as the inverses of partial differential operators or as solutions of control problems. The result of the approximation will be so-called hierarchical matrices (or short H-matrices). These matrices form a subset of the set of all matrices and have a data-sparse representation. The essential operations for these matrices (matrix-vector and matrix – matrix multiplication, addition and inversion) can be performed in, up to logarithmic factors, optimal complexity. We give a review of specialised variants of H-matrices, especially of H 2 -matrices, and finally consider applications of the different methods to problems from integral equations, partial differential equations and control theory. q 2003 Elsevier Science Ltd. All rights reserved.

read more

Citations
More filters
Journal ArticleDOI

Construction and arithmetics of H -matrices

TL;DR: This paper presents a construction of the hierarchical matrix format for standard finite element and boundary element applications for which two criteria, the sparsity and idempotency, are sufficient to give the desired bounds.
Journal ArticleDOI

Fast algorithms for hierarchically semiseparable matrices

TL;DR: This paper generalizes the hierarchically semiseparable (HSS) matrix representations and proposes some fast algorithms for HSS matrices that are useful in developing fast‐structured numerical methods for large discretized PDEs, integral equations, eigenvalue problems, etc.
Journal ArticleDOI

Data-sparse approximation by adaptive H 2 -matrices

TL;DR: The basic ideas of ℋ- andℋ2-matrices are introduced and an algorithm that adaptively computes approximations of general matrices in the latter format is presented.
Journal ArticleDOI

Existence of ℋ-matrix approximants to the inverse FE-matrix of elliptic operators with L ∞ -coefficients

TL;DR: It will be shown that the corresponding Green functions can be approximated by degenerate functions giving rise to the existence of blockwise low-rank approximants of FEM inverses.
Journal ArticleDOI

Superfast Multifrontal Method for Large Structured Linear Systems of Equations

TL;DR: A fast direct solver for large discretized linear systems using the supernodal multifrontal method together with low-rank approximations, especially suitable for large sparse problems and also has natural adaptability to parallel computations and great potential to provide effective preconditioners.
References
More filters
Journal ArticleDOI

A sparse matrix arithmetic based on H -matrices. Part I: introduction to H -matrices

TL;DR: This paper is the first of a series and is devoted to the first introduction of the $\Cal H$-matrix concept, which allows the exact inversion of tridiagonal matrices.
Journal ArticleDOI

Approximation of boundary element matrices

TL;DR: From results an iterative algorithm for the low-rank approximation of blocks of large unstructured matrices generated by asymptotically smooth functions is developed.
Journal ArticleDOI

On the fast matrix multiplication in the boundary element method by panel clustering

TL;DR: A method for the approximate matrix-vector multiplication is described which requires much less arithmetical work and the storage requirements are strongly reduced.
Journal ArticleDOI

Adaptive low-rank approximation of collocation matrices

TL;DR: The proposed algorithm which uses the ℋ-matrix format is purely algebraic and relies on a small part of the collocation matrix for its blockwise approximation by low-rank matrices.
Journal ArticleDOI

Construction and arithmetics of H -matrices

TL;DR: This paper presents a construction of the hierarchical matrix format for standard finite element and boundary element applications for which two criteria, the sparsity and idempotency, are sufficient to give the desired bounds.
Frequently Asked Questions (1)
Q1. What contributions have the authors mentioned in the paper "Introduction to hierarchical matrices with applications" ?

The authors give a review of specialised variants of H-matrices, especially of H-matrices, and finally consider applications of the different methods to problems from integral equations, partial differential equations and control theory.