Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
DOI10.1007/s00607-002-1450-4zbMath1012.65023OpenAlexW1584657480MaRDI QIDQ1849565
Steffen Börm, Wolfgang Hackbusch
Publication date: 1 December 2002
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-002-1450-4
algorithmnumerical examplesboundary element methodsparse matricesfinite element discretizationselliptic boundary value problemslinear complexityhierarchical matricesfast iterationfast matrix-vector multiplicationnested bases
Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Data structures (68P05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Boundary element methods for boundary value problems involving PDEs (65N38)
Related Items (88)
This page was built for publication: Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices