The full approximation storage multigrid scheme: A 1D finite element example

arXiv2101.05408MaRDI QIDQ6358253FDOQ6358253

Publication date: 13 January 2021

Abstract: This note describes the full approximation storage (FAS) multigrid scheme for an easy one-dimensional nonlinear boundary value problem. The problem is discretized by a simple finite element (FE) scheme. We apply both FAS V-cycles and F-cycles, with a nonlinear Gauss-Seidel smoother, to solve the resulting finite-dimensional problem. The mathematics of the FAS restriction and prolongation operators, in the FE case, are explained. A self-contained Python program implements the scheme. Optimal performance, i.e. work proportional to the number of unknowns, is demonstrated for both kinds of cycles, including convergence nearly to discretization error in a single F-cycle.

Has companion code repository: https://github.com/bueler/fas-intro

Mathematics Subject Classification ID

Nonlinear boundary value problems for ordinary differential equations (34B15) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)

This page was built for publication: The full approximation storage multigrid scheme: A 1D finite element example

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358253)