Adaptive geometrically balanced clustering of H-matrices

DOI10.1007/S00607-004-0068-0MaRDI QIDQ1763002zbMATH OpenOpenAlexFDO

Authors Wolfgang Hackbusch, Sabine Le Borne, L. 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

zbMATH Keywords

adaptive mesh refinementboundary elementscomplexitydata-sparse approximationhierarchical matricesmatrix-vector multiplicationnumerical examples

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Boundary element methods for boundary value problems involving PDEs (65N38) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• Geometric algorithms for agglomerative hierarchical clustering
• Faster balanced clusterings in high dimension
• On approximate geometric \(k\)-clustering
• Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
• Algorithm of Hierarchical Matrix Clusterization and Its Applications
• Geometric clustering in normed planes
• scientific article; zbMATH DE number 804595
• scientific article; zbMATH DE number 5287125

Cited in

(10)

• Approximating inverse FEM matrices on non-uniform meshes with \(\mathcal{H}\)-matrices
• Diffusion wavelets
• Exponential meshes and \(\mathcal{H}\)-matrices
• Efficient update of hierarchical matrices in the case of adaptive discretisation schemes.
• A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
• A fast direct solver for elliptic problems on general meshes in 2D
• scientific article; zbMATH DE number 1522838 (Why is no real title available?)
• Fast solvers for two-dimensional fractional diffusion equations using rank structured matrices
• \(\mathcal{H}\)-inverses for RBF interpolation
• A nearly optimal multigrid method for general unstructured grids

This page was built for publication: Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763002)