Abstract: We give a short introduction to a method for the data-sparse approximation of matrices resulting from the discretisation of non-local operators occurring in boundary integral methods or as the inverses of partial differential operators. \endgraf The result of the approximation will be the so-called {hierarchical matrices} (or short \hbox {$\Cal {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.
Keywords: hierarchical matrices, data-sparse approximations, formatted matrix operations, fast solvers
Classification (MSC2000): 65F05, 65F30, 65F50, 65N50
Full text of the article: