Searcharxiv⌕ Search

arXiv subjects

David Niemelä

Publications and source records attributed to David Niemelä.

2 recordsLinked to original sources

Boundary-optimized closures for diagonal-norm upwind SBP operators

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) framework, ensuring linear stability on piecewise curvilinear multiblock grids. For linear problems, this stability is inherited from the diagonal norm SBP framework provided the approximation satisfies the metric identities (i.e. it is free-stream preserving). For nonlinear problems, the flux-vector splitting should be linear in the metric terms to inherit these stability properties. Boundary and interface conditions are imposed using either weak enforcement through simultaneous approximation terms (SAT) or strong enforcement via the projection method. The proposed operators yield significantly improved accuracy compared with SBP operators constructed on equidistant grids. The resulting SBP--SAT and SBP--projection discretizations produce fully explicit systems of ordinary differential equations. The accuracy and stability properties of the proposed operators are demonstrated through numerical experiments for linear hyperbolic problems in one spatial dimension and for the compressible Euler equations in two spatial dimensions.

math.NA↗

Boundary and interface methods for energy stable finite difference discretizations of the dynamic beam equation

We consider energy stable summation by parts finite difference methods (SBP-FD) for the homogeneous and piecewise homogeneous dynamic beam equation (DBE). Previously the constant coefficient problem has been solved with SBP-FD together with penalty terms (SBP-SAT) to impose boundary conditions. In this work we revisit this problem and compare SBP-SAT to the projection method (SBP-P). We also consider the DBE with discontinuous coefficients and present novel SBP-SAT, SBP-P and hybrid SBP-SAT-P discretizations for imposing interface conditions. Numerical experiments show that all methods considered are similar in terms of accuracy, but that SBP-P can be more computationally efficient (less restrictive time step requirement for explicit time integration methods) for both the constant and piecewise constant coefficient problems.

math.NA↗