Robust Multigrid Methods for Discontinuous Galerkin Discretizations of an Elliptic Optimal Control Problem

Abstract

We consider discontinuous Galerkin methods for an elliptic distributed optimal control problem and we propose multigrid methods to solve the discretized system. We prove that the W-cycle algorithm is uniformly convergent in the energy norm and is robust with respect to a regularization parameter on convex domains. Numerical results are shown for both W -cycle and V-cycle algorithms.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…