Fast Solvers for the Symmetric IPDG Discretization of Second Order Elliptic Problems

Fast Solvers for the Symmetric IPDG Discretization of Second Order Elliptic Problems

Year:    2015

International Journal of Numerical Analysis and Modeling, Vol. 12 (2015), Iss. 3 : pp. 455–475

Abstract

In this paper, we develop and analyze a preconditioning technique and an iterative solver for the linear systems resulting from the discretization of second order elliptic problems by the symmetric interior penalty discontinuous Galerkin methods. The main ingredient of our approach is a stable decomposition of the piecewise polynomial discontinuous finite element space of arbitrary order into a linear conforming space and a space containing high frequency components. To derive such decomposition, we introduce a novel interpolation operator which projects piecewise polynomials of arbitrary order to continuous piecewise linear functions. We prove that this operator is stable which allows us to derive the required space decomposition easily. Moreover, we prove that both the condition number of the preconditioned system and the convergent rate of the iterative method are independent of the mesh size. Numerical experiments are also shown to confirm these theoretical results.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2015-IJNAM-498

International Journal of Numerical Analysis and Modeling, Vol. 12 (2015), Iss. 3 : pp. 455–475

Published online:    2015-01

AMS Subject Headings:    Global Science Press

Copyright:    COPYRIGHT: © Global Science Press

Pages:    21

Keywords:    Discontinuous Galerkin methods iterative method preconditioner.