Projects per year
Abstract
In this paper, we introduce a new position-dependent Smoothness-Increasing Accuracy-Conserving (SIAC) filter that retains the benefits of position dependence while ameliorating some of its shortcomings. As in the previous position-dependent filter, our new filter can be applied near domain boundaries, near a discontinuity in the solution, or at the interface of different mesh sizes; and as before, in general, it numerically enhances the accuracy and increases the smoothness of approximations obtained using the discontinuous Galerkin (dG) method. However, the previously proposed position-dependent one-sided filter had two significant disadvantages: (1) increased computational cost (in terms of function evaluations), brought about by the use of $4k+1$ central B-splines near a boundary (leading to increased kernel support) and (2) increased numerical conditioning issues that necessitated the use of quadruple precision for polynomial degrees of $k\ge 3$ for the reported accuracy benefits to be realizable numerically. Our new filter addresses both of these issues --- maintaining the same support size and with similar function evaluation characteristicsas the symmetric filter in a way that has better numerical conditioning --- making it, unlike
its predecessor, amenable for GPU computing. Our new filter was conceived by revisiting the original error analysis for superconvergence of SIAC filters and by examining the role of the B-splines and their weights in the SIAC filtering kernel. We demonstrate, in the uniform mesh case, that our new filter is globally superconvergent for $k=1$ and superconvergent in the interior (e.g., region excluding the boundary) for $k\ge2$. Furthermore, we present the first theoretical proof of superconvergence for postprocessing over smoothly varying meshes, and explain the accuracy-order conserving nature of this new filter when applied to certain non-uniform meshes cases. We provide numerical examples supporting our theoretical results and demonstrating that our new filter, in general, enhances the smoothness and accuracy of the solution. Numerical results are presented for solutions of both linear and nonlinear equation solved on both uniform and non-uniform one- and two-dimensional meshes.
its predecessor, amenable for GPU computing. Our new filter was conceived by revisiting the original error analysis for superconvergence of SIAC filters and by examining the role of the B-splines and their weights in the SIAC filtering kernel. We demonstrate, in the uniform mesh case, that our new filter is globally superconvergent for $k=1$ and superconvergent in the interior (e.g., region excluding the boundary) for $k\ge2$. Furthermore, we present the first theoretical proof of superconvergence for postprocessing over smoothly varying meshes, and explain the accuracy-order conserving nature of this new filter when applied to certain non-uniform meshes cases. We provide numerical examples supporting our theoretical results and demonstrating that our new filter, in general, enhances the smoothness and accuracy of the solution. Numerical results are presented for solutions of both linear and nonlinear equation solved on both uniform and non-uniform one- and two-dimensional meshes.
Original language | English |
---|---|
Pages (from-to) | 773-817 |
Number of pages | 45 |
Journal | Journal of Scientific Computing |
Volume | 64 |
Issue number | 3 |
Early online date | 11 Nov 2014 |
DOIs | |
Publication status | Published - Sep 2015 |
Keywords
- discontinuous Galerkin
- post-processing
- SIAC filtering
- superconvergence
- uniform meshes
- smoothly-varying meshes
- non-uniform meshes
Projects
- 1 Finished
-
Exploiting Superconvergence in Discontinuous Galerkin Methods for Improved Time-Stepping and Visualization
Ryan, J.
1/02/13 → 31/07/16
Project: Research