Robust and efficient preconditioners for the discontinuous Galerkin time-stepping method

Abstract : The discontinuous Galerkin time-stepping method has many advantageous properties for solving parabolic equations. However, it requires the solution of a large nonsymmetric system at each time-step. This work develops a fully robust and efficient preconditioning strategy for solving these systems. Drawing on parabolic inf-sup theory, we first construct a left preconditioner that transforms the linear system to a symmetric positive definite problem to be solved by the preconditioned conjugate gradient algorithm. We then prove that the transformed system can be further preconditioned by an ideal block diagonal preconditioner, leading to a condition number bounded by 4 for any time-step size, any approximation order and any positive-definite self-adjoint spatial operators. Numerical experiments demonstrate the low condition numbers and fast convergence of the algorithm for both ideal and approximate preconditioners, and show the feasibility of the high-order solution of large problems.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01357497
Contributor : Iain Smears <>
Submitted on : Monday, August 29, 2016 - 8:43:39 PM
Last modification on : Thursday, April 26, 2018 - 10:27:53 AM
Document(s) archivé(s) le : Wednesday, November 30, 2016 - 3:06:29 PM

File

hal_precondition_dg_timesteppi...
Files produced by the author(s)

Identifiers

Collections

Citation

Iain Smears. Robust and efficient preconditioners for the discontinuous Galerkin time-stepping method. IMA Journal of Numerical Analysis, Oxford University Press (OUP), 2016, ⟨10.1093/imanum/drw050⟩. ⟨hal-01357497⟩

Share

Metrics

Record views

335

Files downloads

107