Related papers: Algebraic Multigrid Methods For Virtual Element Di…
We propose, analyze and implement a virtual element discretization for an interfacial poroelasticity-elasticity consolidation problem. The formulation of the time-dependent poroelasticity equations uses displacement, fluid pressure, and…
We present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is…
In this paper, we propose a $W$-cycle $p$-multigrid method for solving the $p$-version symmetric interior penalty discontinuous Galerkin (SIPDG) discretization of elliptic problems. This SIPDG discretization employs hierarchical Legendre…
We introduce the Virtual Element Method (VEM) for elliptic eigenvalue problems. The main result of the paper states that VEM provides an optimal order approximation of the eigenmodes. A wide set of numerical tests confirm the theoretical…
When modeling scientific and industrial problems, geometries are typically modeled by explicit boundary representations obtained from computer-aided design software. Unfitted (also known as embedded or immersed) finite element methods offer…
The Multiquadric Radial Basis Function (MQ) Method is a meshless collocation method with global basis functions. It is known to have exponentional convergence for interpolation problems. We descretize nonlinear elliptic PDEs by the MQ…
In this work we study arbitrary-order hybrid discretizations of Friedrichs systems. Friedrichs systems provide a framework that goes beyond the standard classification of partial differential equations into hyperbolic or elliptic, and are…
In many applications the accurate representation of the computational domain is a key factor to obtain reliable and effective numerical solutions. Curved interfaces, which might be internal, related to physical data, or portions of the…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
We propose a new and simple discretization, named the Modified Virtual Grid Difference (MVGD), for numerical approximation of the Laplace-Beltrami (LB) operator on manifolds sampled by point clouds. The key observation is that both the…
We present a monolithic $hp$ space-time multigrid method for tensor-product space-time finite element discretizations of the Stokes equations. Geometric and polynomial coarsening of the space-time mesh is performed, and the entire algorithm…
We present a Ritz-Galerkin discretization on sparse grids using pre-wavelets, which allows to solve elliptic differential equations with variable coefficients for dimension $d=2,3$ and higher dimensions $d>3$. The method applies multilinear…
Stochastic sampling methods are arguably the most direct and least intrusive means of incorporating parametric uncertainty into numerical simulations of partial differential equations with random inputs. However, to achieve an overall error…
We are interested in the numerical solution of nonsymmetric linear systems arising from the discretization of convection-diffusion partial differential equations with separable coefficients and dominant convection. Preconditioners based on…
We present a new numerical method for solving the elliptic homogenization problem. The main idea is that the missing effective matrix is reconstructed by solving the local least-squares in an offline stage, which shall be served as the…
We present an algorithm for the numerical solution of the equations governing combustion in porous inert media. The discretization of the flow problem is performed by the mixed finite element method, the transport problems are discretized…
As part of our development of a computer code to perform 3D `constrained evolution' of Einstein's equations in 3+1 form, we discuss issues regarding the efficient solution of elliptic equations on domains containing holes (i.e., excised…
We have developed an efficient algorithm for steady axisymmetrical 2D fluid equations. The algorithm employs multigrid method as well as standard implicit discretization schemes for systems of partial differential equations. Linearity of…
We analyze the performance of a state-of-the-art domain decomposition approach, the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) method, for the efficient solution of very large linear systems arising from elliptic…
We develop a new meshfree geometric multilevel (MGM) method for solving linear systems that arise from discretizing elliptic PDEs on surfaces represented by point clouds. The method uses a Poisson disk sampling-type technique for coarsening…