Construction of Data-Sparse $\mathcal{H}^2$-Matrices by Hierarchical Compression
From MaRDI portal
Publication:3567007
DOI10.1137/080720693zbMath1193.65043OpenAlexW1984430553MaRDI QIDQ3567007
Publication date: 10 June 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080720693
algorithmpreconditionersmatrix functionshierarchical matricesnonlocal operatordata-sparse approximationcompression schemessolutions of matrix equationsefficient matrix arithmetics
Related Items
A fast wavelet-multipole method for direct BEM ⋮ Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum ⋮ HODLR2D: A New Class of Hierarchical Matrices ⋮ Constructing nested bases approximations from the entries of non-local operators ⋮ Fast large-scale boundary element algorithms ⋮ Error Bounds for Low-Rank Approximations of the First Exponential Integral Kernel ⋮ Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices ⋮ An \(O(N)\) direct solver for integral equations on the plane ⋮ Recompression techniques for adaptive cross approximation ⋮ On the Stability of Some Hierarchical Rank Structured Matrix Algorithms ⋮ Fast approximate computations with Cauchy matrices and polynomials
