We present iterative and preconditioning techniques for the solution of the linear systems resulting from several discontinuous Galerkin (DG) Interior Penalty (IP) discretizations of elliptic problems. We analyze the convergence properties of these algorithms for both symmetric and non-symmetric IP schemes. The iterative methods are based on a "natural" decomposition of the first order DG finite element space as a direct sum of the Crouzeix-Raviart non-conforming finite element space and a subspace that contains functions discontinuous at interior faces. We also present numerical examples confirming the theoretical results.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Numerical Analysis
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics