Related papers: Machine Learning based refinement strategies for p…
In this paper, we employ the linear virtual element spaces to discretize the semilinear sine-Gordon equation in two dimensions. The salient features of the virtual element method (VEM) are: (a) it does not require explicit form of the shape…
Numerical methods for random parametric PDEs can greatly benefit from adaptive refinement schemes, in particular when functional approximations are computed as in stochastic Galerkin and stochastic collocations methods. This work is…
We propose a quality-based optimization strategy to reduce the total number of degrees of freedom associated to a discrete problem defined over a polygonal tessellation with the Virtual Element Method. The presented Quality Agglomeration…
We present a multigrid algorithm for the solution of the linear systems of equations stemming from the $p-$version of the Virtual Element discretization of a two-dimensional Poisson problem. The sequence of coarse spaces are constructed…
Algebraic Multigrid (AMG) methods are state-of-the-art algebraic solvers for partial differential equations. Still, their efficiency depends heavily on the choice of suitable parameters and/or ingredients. Paradigmatic examples include the…
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
In this article, a new unified duality theory is developed for Petrov-Galerkin finite element methods. This novel theory is then used to motivate goal-oriented adaptive mesh refinement strategies for use with discontinuous Petrov-Galerkin…
We present the design and implementation details of a geometric multigrid method on adaptively refined meshes for massively parallel computations. The method uses local smoothing on the refined part of the mesh. Partitioning is achieved by…
A refined a priori error analysis of the lowest order (linear) Virtual Element Method (VEM) is developed for approximating a model two dimensional Poisson problem. A set of new geometric assumptions is proposed on shape regularity of…
In this present paper we consider a full divergence-free of high order virtual finite element algorithm to approximate the stationary inductionless magnetohydrodynamic model on polygonal meshes. More precisely, we choice appropriate virtual…
We explore the recently-proposed Virtual Element Method (VEM) for numerical solution of boundary value problems on arbitrary polyhedral meshes. More specifically, we focus on the elasticity equations in three-dimensions and elaborate upon…
Traditional k-means clustering underperforms on non-convex shapes and requires the number of clusters k to be specified in advance. We propose a simple geometric enhancement: after standard k-means, each cluster center is assigned a radius…
We investigate a macro-element variant of the hybridized discontinuous Galerkin (HDG) method, using patches of standard simplicial elements that can have non-matching interfaces. Coupled via the HDG technique, our method enables local…
We present a unified algorithmic framework for the numerical solution, constrained optimization, and physics-informed learning of PDEs with a variational structure. Our framework is based on a Galerkin discretization of the underlying…
The Galerkin difference (GD) basis is a set of continuous, piecewise polynomials defined using a finite difference like grid of degrees of freedom. The one dimensional GD basis functions are naturally extended to multiple dimensions using…
In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on…
This work studies three multigrid variants for matrix-free finite-element computations on locally refined meshes: geometric local smoothing, geometric global coarsening, and polynomial global coarsening. We have integrated the algorithms…
In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial…
We analyze and validate the virtual element method combined with a boundary correction similar to the one in [1,2], to solve problems on two dimensional domains with curved boundaries approximated by polygonal domains. We focus on the case…
Finite element discretizations of problems in computational physics often rely on adaptive mesh refinement (AMR) to preferentially resolve regions containing important features during simulation. However, these spatial refinement strategies…