Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical errors”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

Understanding and Estimating Error Propagation in Neural Networks for Scientific Data Analysis

Neural networks are increasingly integrated into scientific discovery, where input data reduction and model quantization play a key role in accelerating inference. However, understanding and mitigating the impact of these techniques on output error is critical for ensuring reliable results, particularly in tasks demanding high numerical precision. This paper introduces a comprehensive framework for optimizing neural network inference in scientific computing by combining data reduction and weight quantization while maintaining error-controlled outcomes. We develop theoretical analyses to bound error propagation under these reductions and propose a framework that balances computational performance with error constraints. Evaluation on real-world learning-based combustion simulations and satellite image classification demonstrates that our derived error bounds accurately predict observed errors while enabling significant computational speedup under our framework. This work highlights the potential for further leveraging advancements in modern lossy compression algorithms and hardware accelerators that support lower-precision formats.

He, Weiming [New Jersey Institute of Technology]↗

Automated Symbolic Upscaling: 2. Model Generation for Extended Applicability Regimes

Abstract In this second part of the two paper series, we detail an algorithmic procedure for systematically implementing the generalized closure form strategy presented in Part 1. This strategy extends the applicability of homogenized models with respect to classical homogenization theory, as demonstrated in Part 1 where upscaled models are rigorously derived in moderately reactive physical regimes. After encoding the algorithm into Symbolica, an automated upscaling framework, we upscale two reactive mass transport problems and numerically validate the resulting nonlinear homogenized models by showing the absolute error estimates predicted by homogenization theory are satisfied. In both problems, nontrivial closure forms and closure problems are automatically formulated using the encoded strategy with no human interaction, nor prior knowledge regarding the closure required for the systems. We hope these demonstrations spark further interest in automated analytical frameworks for multiscale modeling, as such capabilities are invaluable for generating rigorous multiscale models of complex phenomena in porous media.

Pietrzyk, Kyle↗

Automated Symbolic Upscaling: 1. Model Generation for Extended Applicability Regimes

Abstract In porous media theory, upscaling techniques are fundamental to deriving rigorous Darcy‐scale models for flow and reactive transport in subsurface systems. Due to limitations in classical techniques, a number of ad hoc approaches have been proposed to address physical regimes in which reactive time scales are similar to, or faster than, diffusive time scales. In Part 1 of this two part series, we present a strategy for expanding the applicability of classical homogenization theory by generalizing the assumed closure form. We detail the implementation of this strategy on two reactive mass transport problems with moderately reactive physics. The strategy produces nontrivial homogenized models with emergent terms and effective parameters that couple reactive, diffusive, and advective transport. The differences in equation forms between the macroscopic and pore‐scale descriptions advise caution to further studies where the forms of macroscopic equations are assumed, as opposed to rigorously derived. Numerical validation is provided for each problem to show that the error estimates of homogenization theory are satisfied, and to justify the implemented strategy. In Part 2, the presented strategy is automated using symbolic computing to expedite its implementation.

Pietrzyk, Kyle↗

Higher-order particle representation for particle-in-cell simulations

In this paper we present an alternative approach to the representation of simulation particles for unstructured electrostatic and electromagnetic PIC simulations. In our modified PIC algorithm we represent particles as having a smooth shape function limited by some specified finite radius, r 0 . A unique feature of our approach is the representation of this shape by surrounding simulation particles with a set of virtual particles with delta shape, with fixed offsets and weights derived from Gaussian quadrature rules and the value of r 0 . As the virtual particles are purely computational, they provide the additional benefit of increasing the arithmetic intensity of traditionally memory bound particle kernels. The modified algorithm is implemented within Sandia National Laboratories' unstructured EMPIRE-PIC code, for electrostatic and electromagnetic simulations, using periodic boundary conditions. We show results for a representative set of benchmark problems, including electron orbit, a transverse electromagnetic wave propagating through a plasma, numerical heating, and a plasma slab expansion. In this work, good error reduction across all of the chosen problems is achieved as the particles are made progressively smoother, with the optimal particle radius appearing to be problem-dependent.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗

A Bayesian analysis of classical shadows

Abstract The method of classical shadows proposed by Huang, Kueng, and Preskill heralds remarkable opportunities for quantum estimation with limited measurements. Yet its relationship to established quantum tomographic approaches, particularly those based on likelihood models, remains unclear. In this article, we investigate classical shadows through the lens of Bayesian mean estimation (BME). In direct tests on numerical data, BME is found to attain significantly lower error on average, but classical shadows prove remarkably more accurate in specific situations—such as high-fidelity ground truth states—which are improbable in a fully uniform Hilbert space. We then introduce an observable-oriented pseudo-likelihood that successfully emulates the dimension-independence and state-specific optimality of classical shadows, but within a Bayesian framework that ensures only physical states. Our research reveals how classical shadows effect important departures from conventional thinking in quantum state estimation, as well as the utility of Bayesian methods for uncovering and formalizing statistical assumptions.

97 MATHEMATICS AND COMPUTING↗

Adamantine 1.0: A Thermomechanical Simulator for Additive Manufacturing

Adamantine is a thermomechanical simulation code that is written in C++ and built on top of deal.II (Arndt et al., 2023), p4est (Burstedde et al., 2011), ArborX (Lebrun-Grandié et al., 2020), Trilinos (The Trilinos Project Team, 2020), and Kokkos (Trott et al., 2022). Adamantine was developed with additive manufacturing in mind and it is particularly well adapted to simulate fused filament fabrication, directed energy deposition, and powder bed fusion. Adamantine employs the finite element method with adaptive mesh refinement to solve a nonlinear anisotropic heat equation, enabling support for various additive manufacturing processes. It can also perform elastoplastic and thermoelastoplastic simulations. It can handle materials in three distinct phases (solid, liquid, and powder) to accurately reflect the physical state during different stages of the manufacturing process. To enhance simulation accuracy, adamantine incorporates data assimilation techniques (Asch et al., 2016). This allows it to integrate experimental data from sensors like thermocouples and infrared (IR) cameras. This combined approach helps account for errors arising from input parameters, material properties, models, and numerical calculations, leading to more realistic simulations that reflect what occurs in a particular print.

36 MATERIALS SCIENCE↗

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗

Deep Neural Networks are Adaptive to Function Regularity and Data Distribution in Approximation and Estimation

Deep learning has exhibited remarkable results across diverse areas. To understand its success, substantial research has been directed towards its theoretical foundations. Nev- ertheless, the majority of these studies examine how well deep neural networks can model functions with uniform regularities. In this paper, we explore a different angle: how deep neural networks can adapt to varying degrees of smoothness in functions and nonuni- form data distributions across different locations and scales. More precisely, we focus on a broad class of functions defined by nonlinear tree-based approximation methods. This class encompasses a range of function types, such as functions with uniform regularities and discontinuous functions. We develop nonparametric approximation and estimation theories for this class using deep ReLU networks. Our results show that deep neural networks are adaptive to the nonuniform smoothness of functions and nonuniform data distributions at different locations and scales. We apply our results to several function classes, and derive the corresponding approximation and generalization errors. The validity of our results is demonstrated through numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?

Variational Quantum Algorithms (VQAs) are often viewed as the best hope for near-term quantum advantage. However, recent studies have shown that noise can severely limit the trainability of VQAs, e.g., by exponentially flattening the cost landscape and suppressing the magnitudes of cost gradients. Error Mitigation (EM) shows promise in reducing the impact of noise on near-term devices. Thus, it is natural to ask whether EM can improve the trainability of VQAs. In this work, we first show that, for a broad class of EM strategies, exponential cost concentration cannot be resolved without committing exponential resources elsewhere. This class of strategies includes as special cases Zero Noise Extrapolation, Virtual Distillation, Probabilistic Error Cancellation, and Clifford Data Regression. Second, we perform analytical and numerical analysis of these EM protocols, and we find that some of them (e.g., Virtual Distillation) can make it harder to resolve cost function values compared to running no EM at all. As a positive result, we do find numerical evidence that Clifford Data Regression (CDR) can aid the training process in certain settings where cost concentration is not too severe. Our results show that care should be taken in applying EM protocols as they can either worsen or not improve trainability. On the other hand, our positive results for CDR highlight the possibility of engineering error mitigation methods to improve trainability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating the WFIP2 updates to the HRRR model using scanning Doppler lidar measurements in the complex terrain of the Columbia River Basin

The wind-energy (WE) industry relies on numerical weather prediction (NWP) forecast models as foundational or base models for many purposes, including wind-resource assessment and wind-power forecasting. During the Second Wind Forecast Improvement Project (WFIP2) in the Columbia River Basin of Oregon and Washington, a significant effort was made to improve NWP forecasts through focused model development, to include experimental refinements to the High Resolution Rapid Refresh (HRRR) model physics and horizontal grid spacing. In this study, the performance of an experimental version of HRRR that includes these refinements is tested against a control version, which corresponds to that of the operational HRRR run by National Oceanic and Atmospheric Administration/National Centers for Environmental Protection at the outset of WFIP2. Furthermore, the effects of horizontal grid resolution were also tested by comparing wind forecasts from the HRRR (with 3-km grid spacing) with those from a finer-resolution HRRR nest with 750-m grid spacing. Model forecasts are validated against accurate wind-profile measurements by three scanning, pulsed Doppler lidars at sites separated by a total distance of 71 km. Model skill and improvements in model skill, attributable to physics refinements and improved horizontal grid resolution, varied by season, by site, and during periods of atmospheric phenomena relevant to WE. In general, model errors were the largest below 150 m above ground level (AGL). Experimental HRRR refinements tended to reduce the mean absolute error (MAE) and other error metrics for many conditions, but degradation in skill (increased MAE) was noted below 150 m AGL at the two lowest-elevation sites at night. Finer resolution was found to produce the most significant reductions in the error metrics.

17 WIND ENERGY↗

Improving Time Step Convergence in an Atmosphere Model With Simplified Physics: The Impacts of Closure Assumption and Process Coupling

Convergence testing is a common practice in the development of dynamical cores of atmospheric models but is not as often exercised for the parameterization of sub-grid physics. An earlier study revealed that the stratiform cloud parameterizations in several predecessors of the Energy Exascale Earth System Model (E3SM) showed strong time-step sensitivity and slower-than-expected convergence when the model's time step was systematically refined. In this work, a simplified atmosphere model is configured that consists of the spectral-element dynamical core of the E3SM atmosphere model coupled with a large-scale condensation parameterization based on commonly used assumptions. This simplified model also resembles E3SM and its predecessors in the numerical implementation of process coupling and shows poor time-step convergence in short ensemble tests. We present a formal error analysis to reveal the expected time-step convergence rate and the conditions for obtaining such convergence. Numerical experiments are conducted to investigate the root causes of convergence problems. We show that revisions in the process coupling and closure assumption help to improve convergence in short simulations using the simplified model; the same revisions applied to a full atmosphere model lead to significant changes in the simulated long-term climate. This work demonstrates that causes of convergence issues in atmospheric simulations can be understood by combining analyses from physical and mathematical perspectives. Addressing convergence issues can help to obtain a discrete model that is more consistent with the intended representation of the physical phenomena.

54 ENVIRONMENTAL SCIENCES↗

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗

Bayesian merging of numerical modeling and remote sensing for saltwater intrusion quantification in the Vietnamese Mekong Delta

Saltwater intrusion has become one of the most concerning issues in the Vietnamese Mekong Delta (VMD) due to its increasing impacts on agriculture and food security of Vietnam. Reliable estimation of salinity plays a crucial role to mitigate the impacts of saltwater intrusion. Here, this study developed a hybrid technique that merges satellite imagery with numerical simulations to improve the estimation of salinity in the VMD. The salinity derived from Landsat images and by numerical simulations was fused using the Bayesian inference technique. The results indicate that our technique significantly reduces the uncertainties and improves the accuracy of salinity estimates. The Nash–Sutcliffe coefficient is 0.74, which is much higher than that of numerical simulation (0.63) and Landsat estimation (0.6). The correlation coefficient between the ensemble and measured salinity is relatively high (0.88). The variance of the ensemble salinity errors (5.0 ppt 2 ) is lower than that of Landsat estimation (10.4 ppt 2 ) and numerical simulations (9.6 ppt 2 ). The proposed approach shows a great potential to combine multiple data sources of a variable of interest to improve its accuracy and reliability wherever these data are available.

54 ENVIRONMENTAL SCIENCES↗

Ultrafast Error-bounded Lossy Compression for Scientific Datasets

Today's scientific high-performance computing applications and advanced instruments are producing vast volumes of data across a wide range of domains, which impose a serious burden on data transfer and storage. Error-bounded lossy compression has been developed and widely used in the scientific community because it not only can significantly reduce the data volumes but also can strictly control the data distortion based on the user-specified error bound. Existing lossy compressors, however, cannot offer ultrafast compression speed, which is highly demanded by numerous applications or use cases (such as in-memory compression and online instrument data compression). In this paper, we propose a novel ultrafast error-bounded lossy compressor that can obtain fairly high compression performance on both CPUs and GPUs and with reasonably high compression ratios. The key contributions are threefold. (1) We propose a generic error-bounded lossy compression framework---called SZx---that achieves ultrafast performance through its novel design comprising only lightweight operations such as bitwise and addition/subtraction operations, while still keeping a high compression ratio. (2) We implement SZx on both CPUs and GPUs and optimize the performance according to their architectures. (3) We perform a comprehensive evaluation with six real-world production-level scientific datasets on both CPUs and GPUs. Experiments show that SZx is 2~16x faster than the second-fastest existing error-bounded lossy compressor (either SZ or ZFP) on CPUs and GPUs, with respect to both compression and decompression.

Yu, Xiaodong↗

Numerical simulations of noisy quantum circuits for computational chemistry

The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.

36 MATERIALS SCIENCE↗

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗