Related papers: Why summation by parts is not enough
Summation-by-parts (SBP) operators allow us to systematically develop energy-stable and high-order accurate numerical methods for time-dependent differential equations. Until recently, the main idea behind existing SBP operators was that…
Summation-by-parts (SBP) operators are finite-difference operators that mimic integration by parts. This property can be useful in constructing energy-stable discretizations of partial differential vequations. SBP operators are defined by a…
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…
We introduce a novel construction procedure for one-dimensional summation-by-parts (SBP) operators. Existing construction procedures for FSBP operators of the form $D = P^{-1} Q$ proceed as follows: Given a boundary operator $B$, the norm…
Summation-By-Parts (SBP) methods provide a systematic way of constructing provably stable numerical schemes. However, many proofs of convergence and accuracy rely on the assumption that the SBP operator possesses a particular eigenvalue…
Many applications rely on solving time-dependent partial differential equations (PDEs) that include second derivatives. Summation-by-parts (SBP) operators are crucial for developing stable, high-order accurate numerical methodologies for…
We present an approach to construct efficient sparse summation-by-parts (SBP) operators on triangles and tetrahedra with a tensor-product structure. The operators are constructed by splitting the simplices into quadrilateral or hexahedral…
A generalised analytical notion of summation-by-parts (SBP) methods is proposed, extending the concept of SBP operators in the correction procedure via reconstruction (CPR), a framework of high-order methods for conservation laws. For the…
Summation-by-parts (SBP) finite-difference discretizations share many attractive properties with Galerkin finite-element methods (FEMs), including time stability and superconvergent functionals; however, unlike FEMs, SBP operators are not…
By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…
Non-conforming numerical approximations offer increased flexibility for applications that require high resolution in a localized area of the computational domain or near complex geometries. Two key properties for non-conforming methods to…
We examine stability of summation by parts (SBP) numerical schemes that use hyperboloidal slices to include future null infinity in the computational domain. This inclusion serves to mitigate outer boundary effects and, in the future, will…
The construction of stable, conservative, and accurate volume dissipation is extended to discretizations that possess a generalized summation-by-parts (SBP) property within a tensor-product framework. The dissipation operators can be…
High-order difference operators with the summation-by-parts (SBP) property can be used to build stable discretizations of hyperbolic conservation laws; however, most high-order SBP operators require a conforming, high-order mesh for the…
High-order methods for conservation laws can be highly efficient if their stability is ensured. A suitable means mimicking estimates of the continuous level is provided by summation-by-parts (SBP) operators and the weak enforcement of…
This paper explores a common class of diagonal-norm summation by parts (SBP) operators found in the literature, which can be parameterized by an integer triple $(s,t,r)$ representing the interior order of accuracy ($2s)$, the boundary order…
Overset grid methods handle complex geometries by overlapping simpler, geometry-fitted grids to cover the original, more complex domain. However, ensuring their stability -- particularly at high orders -- remains a practical and theoretical…
We develop summation by parts (SBP) approach for generating high-order finite-difference schemes on the interval and propose new sets of schemes up to the 12th order. The coefficients of the schemes are governed by values of grid spacing…
This paper is concerned with the accurate, conservative, and stable imposition of boundary conditions and inter-element coupling for multi-dimensional summation-by-parts (SBP) finite-difference operators. More precisely, the focus is on…
This work focuses on multidimensional summation-by-parts (SBP) discretizations of linear elliptic operators with variable coefficients. We consider a general SBP discretization with dense simultaneous approximation terms (SATs), which serve…