Hierarchical matrix techniques for a domain decomposition algorithm
DOI10.1007/s00607-007-0235-1zbMath1172.65358OpenAlexW2098030502MaRDI QIDQ2457940
Publication date: 24 October 2007
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-007-0235-1
finite elementsnumerical examplesdomain decompositionalgebraic multigridnested dissectionhierarchical matricesperformance comparison
Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10)
Uses Software
Cites Work
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Construction and arithmetics of \(\mathcal H\)-matrices
- Introduction to hierarchical matrices with applications.
- A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- A New Paradigm for Parallel Adaptive Meshing Algorithms
- An Algebraic Multilevel Multigraph Algorithm
- Nested-Dissection Orderings for Sparse LU with Partial Pivoting
- A New Paradigm for Parallel Adaptive Meshing Algorithms
- A Domain Decomposition Solver for a Parallel Adaptive Meshing Paradigm
This page was built for publication: Hierarchical matrix techniques for a domain decomposition algorithm