Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems

312 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Numerical solution of the Hartree-Fock equation by multilevel tensor-structured methods (2011, unknown): “6.1 Brief summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 6.2 Presentations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140”
ℋ︁‐LU factorization in preconditioners for augmented Lagrangian and grad‐div stabilized saddle point systems (2012, background): “The basic H-matrix construction and corresponding arithmetic have reached a relatively mature state and are documented in the comprehensive lecture notes [28] and books [20, 29].”
Efficient methods for large‐scale linear inversion using a geostatistical approach (2012, methodology): “[18] Hierarchical matrices [Börm et al., 2003; Grasedyck and Hackbusch, 2003; Rjasanow and Steinbach, 2007; Bebendorf, 2008] (or H-matrices, for short) are efficient data-sparse representations of certain densely populated matrices.”
Adaptive Cross Approximation of Multivariate Functions (2011, background): “The latter can be computed with O(k2 ln) operations; see [4].”