Search NASA⌕ Search

Engineering topics

Banks, Jeffrey

Publications and source records attributed to Banks, Jeffrey.

ZFP: A compressed array representation for numerical computations

HPC trends favor algorithms and implementations that reduce data motion relative to FLOPS. We investigate the use of lossy compressed data arrays in place of traditional IEEE floating point arrays to store the primary data of calculations. Simulation is fundamentally an exercise in controlled approximation, and error introduced by finite-precision arithmetic (or lossy compression) is just one of several sources of error that need to be managed to ensure sufficient accuracy in a computed result. We describe ZFP, a compressed numerical format designed for in-memory storage of multidimensional arrays, and summarize theoretical results that demonstrate that the error of repeated lossy compression can be bounded and controlled. Furthermore, we establish a relationship between grid resolution and compression-induced errors and show that, contrary to conventional floating point, ZFP reduces finite-difference errors with finer grids. We present example calculations that demonstrate data reduction by 4x or more with negligible impact on solution accuracy. Our results further demonstrate several orders-of-magnitude increase in accuracy using ZFP over IEEE floating point and Posits for the same storage budget.

Lindstrom, Peter↗

Robust Approaches to Handling Complex Geometries with Galerkin Difference Methods

The Galerkin difference (GD) basis is a set of continuous, piecewise polynomials defined using a finite-difference-like grid of degrees of freedom. The one dimensional GD basis functions are naturally extended to multiple dimensions using a tensor product construction on quadrilateral elements. The GD basis can be used to define the solution space for a discontinuous Galerkin finite element discretization of partial differential equations. In this work we propose two approaches to handling complex geometries within this setting: (1) using nonconforming, curvilinear GD elements and (2) coupling affine GD elements with curvilinear simplicial elements. In both cases the (semidiscrete) discontinuous Galerkin method is provably energy stable even when variational crimes are committed. Additionally, for both element types a weight-adjusted mass matrix is used, which ensures that only the reference mass matrix must be inverted. We also present sufficient conditions on the treatment of metric terms for the curvilinear, nonconforming GD elements to ensure that the scheme is both constant preserving and conservative. Numerical experiments confirm the stability results and demonstrate the accuracy of the coupled schemes.

97 MATHEMATICS AND COMPUTING↗