Summation-by-parts operators for general function spaces

Abstract

Summation-by-parts (SBP) operators are popular building blocks for systematically developing stable and high-order accurate numerical methods for time-dependent differential equations. The main idea behind existing SBP operators is that the solution is assumed to be well approximated by polynomials up to a certain degree, and the SBP operator should therefore be exact for them. However, polynomials might not provide the best approximation for some problems, and other approximation spaces may be more appropriate. In this paper, a theory for SBP operators based on general function spaces is developed. We demonstrate that most of the established results for polynomial-based SBP operators carry over to this general class of SBP operators. Our findings imply that the concept of SBP operators can be applied to a significantly larger class of methods than currently known. We exemplify the general theory by considering trigonometric, exponential, and radial basis functions.

22 pages, 6 figures

References in corpus (2)

• Towards Stable Radial Basis Function Methods for Linear Advection Problems
• Stabilizing Radial Basis Function Methods for Conservation Laws Using Weakly Enforced Boundary Conditions

Cited by in corpus (6)

• A new variable shape parameter strategy for RBF approximation using neural networks
• Multi-dimensional summation-by-parts operators for general function spaces: Theory and construction
• Summation-by-parts operators for general function spaces: The second derivative
• Generalized upwind summation-by-parts operators and their application to nodal discontinuous Galerkin methods
• Exact symmetry conservation and automatic mesh refinement in discrete initial boundary value problems
• Towards provable energy-stable overset grid methods using sub-cell summation-by-parts operators