Related papers: Multigrid in H(div) on Axisymmetric Domains
We propose V--cycle multigrid methods for vector field problems arising from the lowest order hexahedral N\'{e}d\'{e}lec finite element. Since the conventional scalar smoothing techniques do not work well for the problems, a new type of…
This paper presents a numerical study on multigrid algorithms of $V$-cycle type for problems posed in the Hilbert space $H(\mathbf{curl})$ in three dimensions. The multigrid methods are designed for discrete problems originated from the…
We prove the uniform convergence of the geometric multigrid V-cycle for hybrid high-order (HHO) and other discontinuous skeletal methods. Our results generalize previously established results for HDG methods, and our multigrid method uses…
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 study the mixed formulation of the abstract Hodge Laplacian on axisymmetric domains with general data through Fourer-finite-element-methods in weighted functions spaces. Closed Hilbert complexes and commuting projectors are used through…
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…
The first order condition of the constrained minimization problem leads to a saddle point problem. A multigrid method using a multiplicative Schwarz smoother for saddle point problems can thus be interpreted as a successive subspace…
The aim of this paper is to design an efficient multigrid method for constrained convex optimization problems arising from discretization of some underlying infinite dimensional problems. Due to problem dependency of this approach, we only…
In this paper we study convergence estimates for a multigrid algorithm with smoothers of successive subspace correction (SSC) type, applied to symmetric elliptic PDEs. First, we revisit a general convergence analysis on a class of multigrid…
We present new supersymmetric domain wall and string solutions of five-dimensional N = 2 gauged supergravity coupled to an arbitrary number of vector multiplets. Using the techniques of very special geometry allows to obtain the most…
In this paper, we develop multigrid solvers for the biharmonic problem in the framework of isogeometric analysis (IgA). In this framework, one typically sets up B-splines on the unit square or cube and transforms them to the domain of…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…
In this paper we analyse the convergence properties of two-level, W-cycle and V-cycle agglomeration-based geometric multigrid schemes for the numerical solution of the linear system of equations stemming from the lowest order…
The design of fast solvers for isogeometric analysis is receiving a lot of attention due to the challenge that offers to find an algorithm with a robust convergence with respect to the spline degree. Here, we analyze the application of…
In this paper we present a new algorithm for multivariate interpolation of scattered data sets lying in convex domains $\Omega \subseteq \RR^N$, for any $N \geq 2$. To organize the points in a multidimensional space, we build a $kd$-tree…
A multigrid method for the Stokes system discretized with an Hdiv-conforming discontinuous Galerkin method is presented. It acts on the combined velocity and pressure spaces and thus does not need a Schur complement approximation. The…
We study curved domain wall solutions for gauged supergravity theories obtained by gauging some of the isometries of the manifold spanned by the scalars of vector and hypermultiplets. We first consider the case obtained by compactifying…
For domains that are easily represented by structured meshes, robust geometric multigrid solvers can quickly provide the numerical solution to many discretized elliptic PDEs. However, for complicated domains with unstructured meshes,…
Automatic segmentation of an image to identify all meaningful parts is one of the most challenging as well as useful tasks in a number of application areas. This is widely studied. Selective segmentation, less studied, aims to use limited…
We provide an alternative Fourier analysis for multigrid applied to the Poisson problem in 1D, based on explicit derivation of spectra of the iteration matrix. The new Fourier analysis has advantages over the existing one. It is easy to…