arXiv Analytics

Sign in

arXiv:1908.08238 [math.NA]AbstractReferencesReviewsResources

Galerkin-collocation approximation in time for the wave equation and its post-processing

Mathias Anselmann, Markus Bause, Simon Becher, Gunar Matthies

Published 2019-08-22Version 1

We introduce and analyze a class of Galerkin-collocation discretization schemes in time for the wave equation. Its conceptual basis is the establishment of a direct connection between the Galerkin method for the time discretization and the classical collocation methods, with the perspective of achieving the accuracy of the former with reduced computational costs provided by the latter in terms of less complex linear algebraic systems. Continuously differentiable in time discrete solutions are obtained by the application of a special quadrature rule involving derivatives. Optimal order error estimates are proved for fully discrete approximations based on the Galerkin-collocation approach. Further, the concept of Galerkin-collocation approximation is extended to twice continuously differentiable in time discrete solutions. A direct connection between the two families by a computationally cheap post-processing is presented. The error estimates are illustrated by numerical experiments.

Related articles: Most relevant | Search more
arXiv:1505.00120 [math.NA] (Published 2015-05-01)
Trefftz discontinuous Galerkin methods on unstructured meshes for the wave equation
arXiv:1601.04812 [math.NA] (Published 2016-01-19)
Relaxing the CFL condition for the wave equation on adaptive meshes
arXiv:2011.05386 [math.NA] (Published 2020-11-10)
Explicit Time Stepping for the Wave Equation using CutFEM with Discrete Extension