Multigrid solvers for multipoint flux approximations of the Darcy problem on rough quadrilateral grids

Abstract

In this work, an efficient blackbox-type multigrid method is proposed for solving multipoint flux approximations of the Darcy problem on logically rectangular grids. The approach is based on a cell-centered multigrid algorithm, which combines a piecewise constant interpolation and the restriction operator by Wesseling/Khalil with a line-wise relaxation procedure. A local Fourier analysis is performed for the case of a Cartesian uniform grid. The method shows a robust convergence for different full tensor coefficient problems and several rough quadrilateral grids.

References in corpus (1)

• A p-multigrid method enhanced with an ILUT smoother and its comparison to h-multigrid methods within Isogeometric Analysis

Cited by in corpus (2)

• A Deep Learning algorithm to accelerate Algebraic Multigrid methods in Finite Element solvers of 3D elliptic PDEs
• Efficient Solvers for Nonstandard Models for Flow and Transport in Unsaturated Porous Media