Related papers: Multigrid Preconditioning for FD-DLM Method in Ell…
Numerical climate- and weather-prediction requires the fast solution of the equations of fluid dynamics. Discontinuous Galerkin (DG) discretisations have several advantageous properties. They can be used for arbitrary domains and support a…
We present multigrid methods for solving elliptic partial differential equations on arbitrary domains using the nodal ghost finite element method, an unfitted boundary approach where the domain is implicitly defined by a level-set function.…
Compatible finite element discretisations for the atmospheric equations of motion have recently attracted considerable interest. Semi-implicit timestepping methods require the repeated solution of a large saddle-point system of linear…
We present a preconditioning method for the linear systems arising from the boundary element discretization of the Laplace hypersingular equation on a $2$-dimensional triangulated surface $\Gamma$ in $\mathbb{R}^3$. We allow $\Gamma$ to…
In this note we present a multigrid preconditioning method for solving quadratic optimization problems constrained by a fractional diffusion equation. Multigrid methods within the all-at-once approach to solve the first order-order…
We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by…
We consider a mixed dimensional elliptic partial differential equation posed in a bulk domain with a large number of embedded interfaces. In particular, we study well-posedness of the problem and regularity of the solution. We also propose…
We consider discrete Poisson interface problems resulting from linear unfitted finite elements, also called cut finite elements (CutFEM). Three of these unfitted finite element methods known from the literature are studied. All three…
We propose an adaptive multigrid preconditioning technology for solving linear systems arising from Discontinuous Petrov-Galerkin (DPG) discretizations. Unlike standard multigrid techniques, this preconditioner involves only trace spaces…
In this paper we propose two variants of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the new preconditioners, we use the simplest coarse solver…
In this paper we consider second order elliptic partial differential equations with highly varying (heterogeneous) coefficients on a two-dimensional region. The problems are discretized by a composite finite element (FE) and discontinuous…
The implementation of efficient multigrid preconditioners for elliptic partial differential equations (PDEs) is a challenge due to the complexity of the resulting algorithms and corresponding computer code. For sophisticated finite element…
We propose some multigrid methods for solving the algebraic systems resulting from finite element approximations of space fractional partial differential equations (SFPDEs). It is shown that our multigrid methods are optimal, which means…
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial differential equations with highly varying coefficients. The method is based on a discontinuous Galerkin formulation. We present both a…
In this paper, the authors constructed an auxiliary space multigrid preconditioner for the weak Galerkin finite element method for second-order diffusion equations, discretized on simplicial 2D or 3D meshes. The idea of the auxiliary space…
In this article we construct and analyze multigrid preconditioners for discretizations of operators of the form D+K* K, where D is the multiplication with a relatively smooth positive function and K is a compact linear operator. These…
The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…
Novel applications of Numerical Relativity demand for more flexible algorithms and tools. In this paper, I develop and test a multigrid solver, based on the infrastructure provided by the Einstein Toolkit, for elliptic partial differential…
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and…
In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to…