Related papers: Tensor-Product Split-Simplex Summation-By-Parts Op…
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…
In this paper, we show that diagonal-norm summation by parts (SBP) discretizations of general non-conservative systems of hyperbolic balance laws can be rewritten as a finite-volume-type formula, also known as flux-differencing formula, if…
We develop a numerical method for solving the acoustic wave equation in covariant form on staggered curvilinear grids in an energy conserving manner. The use of a covariant basis decomposition leads to a rotationally invariant scheme that…
High-order Hadamard-form entropy stable multidimensional summation-by-parts discretizations of the Euler and compressible Navier-Stokes equations are considerably more expensive than the standard divergence-form discretization. In search of…
We consider the numerical simulation of the acoustic wave equations arising from seismic applications, for which staggered grid finite difference methods are popular choices due to their simplicity and efficiency. We relax the uniform grid…
This article extends the theory of classical finite-difference summation-by-parts (FD-SBP) time-marching methods to the generalized summation-by-parts (GSBP) framework. Dual-consistent GSBP time-marching methods are shown to retain: A and…
Tensor B-spline methods are a high-performance alternative to solve partial differential equations (PDEs). This paper gives an overview on the principles of Tensor B-spline methodology, shows their use and analyzes their performance in…
There is a significant expansion in both volume and range of applications along with the concomitant increase in the variety of data sources. These ever-expanding trends have highlighted the necessity for more versatile analysis tools that…
Tensor accelerators have gained popularity because they provide a cheap and efficient solution for speeding up computational-expensive tasks in Deep Learning and, more recently, in other Scientific Computing applications. However, since…
Several types of simultaneous approximation term (SAT) for diffusion problems discretized with diagonal-norm multidimensional summation-by-parts (SBP) operators are analyzed based on a common framework. Conditions under which the SBP-SAT…
High-order accurate summation-by-parts (SBP) finite difference (FD) methods constitute efficient numerical methods for simulating large-scale hyperbolic wave propagation problems. Traditional SBP FD operators that approximate first-order…
We use the framework of upwind summation-by-parts (SBP) operators developed by Mattsson (2017, doi:10.1016/j.jcp.2017.01.042) and study different flux vector splittings in this context. To do so, we introduce discontinuous-Galerkin-like…
This paper investigates the approximation of functions with finite smoothness defined on domains with a Cartesian product structure. The recently proposed tensor product multilevel method (TPML) combines Smolyak's sparse grid method with a…
This work introduces and analyzes B-spline approximation spaces defined on general geometric domains obtained through a mapping from a parameter domain. These spaces are constructed as sparse-grid tensor products of univariate spaces in the…
Recent years have seen considerable work on compiling sparse tensor algebra expressions. This paper addresses a shortcoming in that work, namely how to generate efficient code (in time and space) that scatters values into a sparse result…
This paper presents a code generator for sparse tensor contraction computations. It leverages a mathematical representation of loop nest computations in the sparse polyhedral framework (SPF), which extends the polyhedral model to support…
Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-$ \mathsf{E} $ operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However,…
The correction procedure via reconstruction (CPR, formerly known as flux reconstruction) is a framework of high order methods for conservation laws, unifying some discontinuous Galerkin, spectral difference and spectral volume methods.…
Symmetric tensor operations arise in a wide variety of computations. However, the benefits of exploiting symmetry in order to reduce storage and computation is in conflict with a desire to simplify memory access patterns. In this paper, we…
We present a stochastic optimization method that uses a fourth-order regularized model to find local minima of smooth and potentially non-convex objective functions with a finite-sum structure. This algorithm uses sub-sampled derivatives…