Adaptive aggregation on graphs
From MaRDI portal
Abstract: We generalize some of the functional (hyper-circle) a posteriori estimates from finite element settings to general graphs or Hilbert space settings. We provide several theoretical results in regard to the generalized a posteriori error estimators. We use these estimates to construct aggregation based coarse spaces for graph Laplacians. The estimator is used to assess the quality of an aggregation adaptively. Furthermore, a reshaping algorithm based is tested on several numerical examples.
Recommendations
- Graph aggregation
- Effective and efficient aggregation on uncertain graphs
- An efficient weighted graph aggregation algorithm
- Adaptive identification in graphs
- Aggregation models on hypergraphs
- Aggregation in dynamic networks
- On aggregation in multiset-based self-assembly of graphs
- Graph partitioning via adaptive spectral techniques
Cites work
- scientific article; zbMATH DE number 2129319 (Why is no real title available?)
- scientific article; zbMATH DE number 3529634 (Why is no real title available?)
- A Convergent Adaptive Algorithm for Poisson’s Equation
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A multigrid method based on graph matching for convection–diffusion equations
- A posteriori estimates for partial differential equations
- A posteriori estimators for obstacle problems by the hypercircle method
- Adaptive AMG with coarsening based on compatible weighted matching
- Algebraic multilevel iteration method for lowest order Raviart-Thomas space and applications
- An algebraic multigrid method with guaranteed convergence rate
- Approximations in elasticity based on the concept of function space
- Coarsening by compatible relaxation
- Commuting projections on graphs
- Compatible relaxation and coarsening in algebraic multigrid
- Convergence of algebraic multigrid based on smoothed aggregation
- Discrete \(p\)-robust \(\boldsymbol H(\mathrm{div})\)-liftings and a posteriori estimates for elliptic problems with \(H^{-1}\) source terms
- Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems
- Explicit error bounds in a conforming finite element method
- Functional a posteriori error estimates for discontinuous Galerkin approximations of elliptic problems
- General highly accurate algebraic coarsening
- Guaranteed and robust error bounds for nonconforming approximations of elliptic problems
- On Generalizing the Algebraic Multigrid Framework
- Polynomial-degree-robust a posteriori estimates in a unified setting for conforming, nonconforming, discontinuous Galerkin, and mixed discretizations
- Primer of adaptive finite element methods
- Theory of adaptive finite element methods: An introduction
Cited in
(5)- Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations
- An adaptive multigrid method based on path cover
- Adaptive identification in graphs
- An adaptive collect algorithm with applications
- A posteriori error estimates for multilevel methods for graph Laplacians
This page was built for publication: Adaptive aggregation on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1636824)
