Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices
From MaRDI portal
Publication:1763002
DOI10.1007/s00607-004-0068-0zbMath1063.65031OpenAlexW2020062373MaRDI QIDQ1763002
Wolfgang Hackbusch, Sabine Le Borne, Lars Grasedyck
Publication date: 11 February 2005
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-004-0068-0
complexitynumerical examplesadaptive mesh refinementboundary elementshierarchical matricesmatrix-vector multiplicationdata-sparse approximation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices ⋮ Exponential meshes and \(\mathcal{H}\)-matrices ⋮ \(\mathcal{H}\)-inverses for RBF interpolation ⋮ A fast direct solver for elliptic problems on general meshes in 2D ⋮ Diffusion wavelets ⋮ A nearly optimal multigrid method for general unstructured grids ⋮ Approximating inverse FEM matrices on non-uniform meshes with \(\mathcal{H}\)-matrices ⋮ Fast Solvers for Two-Dimensional Fractional Diffusion Equations Using Rank Structured Matrices
This page was built for publication: Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices
