Related papers: Multigrid as an exact solver
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…
The Fourier analysis of the \emph{p}-multigrid acceleration technique is considered for a dual-time scheme applied to the advection-diffusion equation with various cycle configurations. It is found that improved convergence can be achieved…
We focus on the study of multigrid methods with aggressive coarsening and polynomial smoothers for the solution of the linear systems corresponding to finite difference/element discretizations of the Laplace equation. Using local Fourier…
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…
In this work, a local Fourier analysis is presented to study the convergence of multigrid methods based on additive Schwarz smoothers. This analysis is presented as a general framework which allows us to study these smoothers for any type…
The solution of parameter-dependent linear systems, by classical methods, leads to an arithmetic effort that grows exponentially in the number of parameters. This renders the multigrid method, which has a well understood convergence theory,…
Application of multigrid solvers in shifted linear systems is studied. We focus on accelerating the rational approximation needed for simulating single flavor operators. This is particularly useful, in the case of twisted mass fermions for…
In recent publications, the author and his coworkers have proposed a multigrid method for solving linear systems arizing from the discretization of partial differential equations in isogeometric analysis and have proven that the convergence…
The goal of this primer is to provide a relatively short exposition of the basics of multigrid methods, simplified by focusing on fundamental concepts in a variational setting. This is done by way of a quadratic energy minimization…
We propose a spectral solver for the Poisson equation on a square domain, achieving optimal complexity through the ultraspherical spectral method and the alternating direction implicit (ADI) method. Compared with the state-of-the-art…
We present an explicit solver of the three-dimensional screened and unscreened Poisson's equation which combines accuracy, computational efficiency and versatility. The solver, based on a mixed plane-wave / interpolating scaling function…
We present a polynomial multigrid method for the nodal interior penalty formulation of the Poisson equation on three-dimensional Cartesian grids. Its key ingredient is a weighted overlapping Schwarz smoother operating on element-centered…
Given a multigrid procedure for linear systems with coefficient matrices $A_n$, we discuss the optimality of a related multigrid procedure with the same smoother and the same projector, when applied to properly related algebraic problems…
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…
A fast multigrid solver is presented for high-order accurate Stokes problems discretised by local discontinuous Galerkin (LDG) methods. The multigrid algorithm consists of a simple V-cycle, using an element-wise block Gauss-Seidel smoother.…
We have developed an adaptive multigrid code for solving the Poisson equation in gravitational simulations. Finer rectangular subgrids are adaptively created in locations where the density exceeds a local level-dependent threshold. We…
This paper is to introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary…
In this manuscript, we present a collective multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty, and develop a novel convergence…
This paper introduces a novel geometric multigrid solver for unstructured curved surfaces. Multigrid methods are highly efficient iterative methods for solving systems of linear equations. Despite the success in solving problems defined on…
In this paper, a novel multigrid method based on Newton iteration is proposed to solve nonlinear eigenvalue problems. Instead of handling the eigenvalue $\lambda$ and eigenfunction $u$ separately, we treat the eigenpair $(\lambda, u)$ as…