Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers
DOI10.1016/j.camwa.2023.11.015arXiv2210.17457OpenAlexW4388921160MaRDI QIDQ6144203
No author found.
Publication date: 5 January 2024
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.17457
multigrid solversagglomerationK-meanspolygonal gridsgraph neural networkspolygonal discontinuous Galerkin
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations
- Domain decomposition preconditioners for discontinuous Galerkin methods for elliptic problems on complicated domains
- An arbitrary-order and compact-stencil discretization of diffusion on general meshes based on local reconstruction operators
- The numerical solution of diffusion problems in strongly heterogeneous non-isotropic materials
- Non-intrusive reduced order modeling of nonlinear problems using neural networks
- A hybrid high-order locking-free method for linear elasticity on general meshes
- Multigrid algorithms for \(hp\)-version interior penalty discontinuous Galerkin methods on polygonal and polyhedral meshes
- Hidden physics models: machine learning of nonlinear partial differential equations
- \(V\)-cycle multigrid algorithms for discontinuous Galerkin methods on non-nested polytopic meshes
- Machine learning of multiscale active force generation models for the efficient simulation of cardiac electromechanics
- Refinement of polygonal grids using convolutional neural networks with applications to polygonal discontinuous Galerkin and virtual element methods
- Agglomeration-based geometric multigrid solvers for compact discontinuous Galerkin discretizations on unstructured meshes
- A machine learning method for real-time numerical simulations of cardiac electromechanics
- Machine learning for fast and reliable solution of time-dependent differential equations
- Hybrid high-order methods for variable-diffusion problems on general meshes
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
- Agglomeration based discontinuous Galerkin discretization of the Euler and Navier-Stokes equations
- An artificial neural network as a troubled-cell indicator
- The mimetic finite difference method for elliptic problems
- The virtual element method and its applications
- Machine learning based refinement strategies for polyhedral grids with applications to virtual element and polyhedral discontinuous Galerkin methods
- Accelerating algebraic multigrid methods via artificial neural networks
- Virtual Element Method for general second-order elliptic problems on polygonal meshes
- Mixed virtual element methods for general second order elliptic problems on polygonal meshes
- $hp$-Version Composite Discontinuous Galerkin Methods for Elliptic Problems on Complicated Domains
- A Review of Hybrid High-Order Methods: Formulations, Computational Aspects, Comparison with Other Methods
- Review of Discontinuous Galerkin Finite Element Methods for Partial Differential Equations on Complicated Domains
- A superconvergent LDG-hybridizable Galerkin method for second-order elliptic problems
- Superconvergent discontinuous Galerkin methods for second-order elliptic problems
- On the maximal error of spectral approximation of graph bisection
- Unified Hybridization of Discontinuous Galerkin, Mixed, and Continuous Galerkin Methods for Second Order Elliptic Problems
- A projection-based error analysis of HDG methods
- Schwarz domain decomposition preconditioners for discontinuous Galerkin approximations of elliptic problems: non-overlapping case
- Global convergence and empirical consistency of the generalized Lloyd algorithm
- Geometric Mesh Partitioning: Implementation and Experiments
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Constrained Centroidal Voronoi Tessellations for Surfaces
- Two-Level Additive Schwarz Methods for a Discontinuous Galerkin Approximation of Second Order Elliptic Problems
- Algebraic multigrid methods
- Anisotropic Centroidal Voronoi Tessellations and Their Applications
- Quantization
- Least squares quantization in PCM
- BASIC PRINCIPLES OF VIRTUAL ELEMENT METHODS
- Polyhedral Methods in Geosciences
- An agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids
- High–order Discontinuous Galerkin Methods on Polyhedral Grids for Geophysical Applications: Seismic Wave Propagation and Fractured Reservoir Simulations
- A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians
- The Hitchhiker's Guide to the Virtual Element Method
- Multigrid Algorithms for $hp$-Discontinuous Galerkin Discretizations of Elliptic Problems
- hp-Version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes
- Convergence of the Mimetic Finite Difference Method for Diffusion Problems on Polyhedral Meshes
- Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
- hp-Version discontinuous Galerkin methods on polygonal and polyhedral meshes
- Depth-First Search and Linear Graph Algorithms
- A FAMILY OF MIMETIC FINITE DIFFERENCE METHODS ON POLYGONAL AND POLYHEDRAL MESHES
This page was built for publication: Agglomeration of polygonal grids using graph neural networks with applications to multigrid solvers