Related papers: Local Multigrid in H(curl)
In this paper, we construct an adaptive multiscale method for solving H(curl)-elliptic problems in highly heterogeneous media. Our method is based on the generalized multiscale finite element method. We will first construct a suitable…
In this paper, we study the convergence of adaptive mixed interior penalty discontinuous Galerkin method for H(curl)-elliptic problems. We first get the mixed model of H(curl)-elliptic problem by introducing a new intermediate variable.…
We apply the local discontinuous Galerkin (LDG for short) method to solve a mixed boundary value problems for the Helmholtz equation in bounded polygonal domain in 2D. Under some assumptions on regularity of the solution of an adjoint…
When homogenizing elliptic partial differential equations, the so-called corrector problem is pivotal to compute the macroscale effective coefficients from the microscale information. To solve this corrector problem in the periodic setting,…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
This paper addresses the efficient solution of linear systems arising from curl-conforming finite element discretizations of $H(\mathrm{curl})$ elliptic problems with heterogeneous coefficients. We first employ the discrete form of a…
In this paper we analyze the convergence properties of two-level and W-cycle multigrid solvers for the numerical solution of the linear system of equations arising from hp-version symmetric interior penalty discontinuous Galerkin…
This article considers the extension of two-grid $hp$-version discontinuous Galerkin finite element methods for the numerical approximation of second-order quasilinear elliptic boundary value problems of monotone type to the case when…
The convergence of multigrid methods degrades significantly if a small number of low quality cells are present in a finite element mesh, and this can be a barrier to the efficient and robust application of multigrid on complicated geometric…
We prove that the minimizer in the N\'ed\'elec polynomial space of some degree p > 0 of a discrete minimization problem performs as well as the continuous minimizer in H(curl), up to a constant that is independent of the polynomial degree…
The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…
In this paper we analyze the error as well for the semi-discretization as the full discretization of a time-dependent convection-diffusion problem. We use for the discretization in space the local discontinuous Galerkin (LDG) method on a…
This note constructs a local generalized finite element basis for elliptic problems with heterogeneous and highly varying coefficients. The basis functions are solutions of local problems on vertex patches. The error of the corresponding…
We prove that for compactly perturbed elliptic problems, where the corresponding bilinear form satisfies a Garding inequality, adaptive mesh-refinement is capable of overcoming the preasymptotic behavior and eventually leads to convergence…
In this paper we study local higher regularity properties of a linear elliptic system that is coupled with a system of Maxwell-type. The regularity result is proved by means of a modified finite difference argument. These modified finite…
Robust mixed finite element methods are developed for a quad-curl singular perturbation problem. Lower order H(grad curl)-nonconforming but H(curl)-conforming finite elements are constructed, which are extended to nonconforming finite…
It is known that the solution of a conservative steady-state two-sided fractional diffusion problem can exhibit singularities near the boundaries. As consequence of this, and due to the conservative nature of the problem, we adopt a finite…
We propose two new strategies based on Machine Learning techniques to handle polyhedral grid refinement, to be possibly employed within an adaptive framework. The first one employs the k-means clustering algorithm to partition the points of…
We prove global and local versions of the so-called div-curl-lemma, a crucial result in the homogenization theory of partial differential equations, for mixed boundary conditions on bounded weak Lipschitz domains in 3D with weak Lipschitz…
We improve the performance of multigrid solvers on many-core architectures with cache hierarchies by reorganizing operations in the smoothing step to minimize memory transfers. We focus on patch smoothers, which offer robust convergence…