Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximate computing”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Beam-water Interaction System for PFAS Treatment

Per- and polyfluoroalkyl substances (PFAS) are persistent environmental contaminants that resist conventional water treatment due to the strength of their carbon fluorine bonds. Electron-beam irradiation has shown potential for PFAS degradation; however, its effectiveness is limited by shallow energy penetration, restricting treatment to the upper region of the water surface. This project addresses this limitation through the design of a compact mixing chamber and recirculation system to enhance surface renewal and improve treatment efficiency. The system, constrained to approximately 10 cm 20 cm 20 cm, was developed using computer-aided design, computational fluid dynamics (CFD), and MATLAB-based hydraulic analysis to evaluate flow behavior, head loss, and pump compatibility. A perforated-baffle geometry and controlled flow range of 1 3 GPM were implemented to promote uniform mixing while maintaining a stable free surface for electron-beam exposure. Modeling results indicate improved flow distribution and reduced dead zones, supporting more consistent interaction between contaminated water and the beam. The final design enhances hydrodynamic performance within system constraints, contributing to scalable electron-beam water treatment technologies for improved PFAS degradation.

Ramos, Gerardo [Northern Illinois U.]↗
DOE OSTI2026

Evaluation of LLVM Flang for Production HPC Applications and Modern Fortran Features

In 2025, LLVM released its first Flang Fortran compiler version considered ready for widespread evaluation. We know of no published assessment of Flang compiling a workload- derived portfolio of high-performance computing (HPC) applications. We address this gap using workload data from the National Energy Research Scientific Computing Center (NERSC), which supports more than 10,000 scientists on approximately 1,000 projects. The NERSC workload analyses identify many Fortran components in heavily used applications. We selected 10 such packages with available source code. We compiled them with Flang 22.1.3 on NERSC’s Perlmutter system. Six compiled without code modifications, though some required build-system changes. Three compiled after minor source edits, mostly to address Fortran standard violations. One built only without OpenMP enabled. We evaluated seven additional packages selected for their use of, or enablement of, standard Fortran parallel features: multi-image execution and do concurrent. Six such codes compiled with most or all unit tests passing.

Rasmussen, Katherine↗
DOE OSTI2022

Fast, High-fidelity Lyα Forests with Convolutional Neural Networks

Full-physics cosmological simulations are powerful tools for studying the formation and evolution of structure in the universe but require extreme computational resources. Here, we train a convolutional neural network to use a cheaper N-body-only simulation to reconstruct the baryon hydrodynamic variables (density, temperature, and velocity) on scales relevant to the Lyα forest, using data from Nyx simulations. We show that our method enables rapid estimation of these fields at a resolution of ~20 kpc, and captures the statistics of the Lyα forest with much greater accuracy than existing approximations. Because our model is fully convolutional, we can train on smaller simulation boxes and deploy on much larger ones, enabling substantial computational savings. Furthermore, as our method produces an approximation for the hydrodynamic fields instead of Lyα flux directly, it is not limited to a particular choice of ionizing background or mean transmitted flux.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Updimensioning strategy derived from synthetic equiaxed grain structures for approximating 3D grain size distributions from 2D visualizations with 1D parameters

We generated synthetic equiaxed grain structures using computer graphics software to explore the relationship between various grain size determination methods and true three-dimensional (3D) grain diameters. Mirroring grain measurement techniques, the synthetic 3D grain structures are imaged as 2D micrographs which are measured to yield 1D grain size parameters. Synthetic grain structures provide data at a mass scale and permit exploration of both polished and fractured surface micrographs, revealing one-to-one correspondence between exposed 2D grain cross-sections and individual 3D grains. Analysis of this correspondence yielded a procedure to approximate 3D equiaxed grain size and volume distributions based on the mode of the 2D fractograph grain size distribution. The 3D approximation procedure is shown to be less susceptible to different imaging conditions that affect small, undiscernible grains compared to the standard planimetric and linear intercept methods, which by design also tend to underestimate the 3D grain diameter. The procedure requires larger sample sizes to lower variance and a deeper analysis which could become more practical with machine learning (ML) models for grain boundary segmentation, which synthetic grain structures can help train. This work lays the foundation for analyzing other grain distributions such as columnar and composite grains in similar depth.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Accurate frozen core approximation for all-electron density-functional theory

We implement and benchmark the frozen core approximation, a technique commonly adopted in electronic structure theory to reduce the computational cost by means of mathematically fixing the chemically inactive core electron states. The accuracy and efficiency of this approach are well controlled by a single parameter, the number of frozen orbitals. Explicit corrections for the frozen core orbitals and the unfrozen valence orbitals are introduced, safeguarding against seemingly minor numerical deviations from the assumed orthonormality conditions of the basis functions. A speedup of over twofold can be achieved for the diagonalization step in all-electron density-functional theory simulations containing heavy elements, without any accuracy degradation in terms of the electron density, total energy, and atomic forces. This is demonstrated in a benchmark study covering 103 materials across the Periodic Table and a large-scale simulation of CsPbBr3 with 2560 atoms. Our study provides a rigorous benchmark of the precision of the frozen core approximation (sub-meV per atom for frozen core orbitals below −200 eV) for a wide range of test cases and for chemical elements ranging from Li to Po. The algorithms discussed here are implemented in the open-source Electronic Structure Infrastructure software package.

Yu, Victor Wen-zhe↗
DOE OSTI2022

Approximation rates of DeepONets for learning operators arising from advection–diffusion equations

Here we present the analysis of approximation rates of operator learning in Chen and Chen (1995) and Lu et al. (2021), where continuous operators are approximated by a sum of products of branch and trunk networks. In this work, we consider the rates of learning solution operators from both linear and nonlinear advection–diffusion equations with or without reaction. We find that the approximation rates depend on the architecture of branch networks as well as the smoothness of inputs and outputs of solution operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Assessing entropy for catalytic processes at complex reactive interfaces

When chemical reactions are accelerated by a catalyst, entropy differences between reactants and their transient intermediates can be the driving force behind the promotion or inhibition of desired and parasitic chemical pathways. Understanding and controlling catalytic processes therefore requires both a fundamental and practicable understanding of entropy in addition to enthalpy. In unstructured media such as the vapor phase equilibrated with sparsely covered surfaces, entropy can be adequately accounted for by well-established approaches based on translational, rotational, and harmonic vibrational partition functions. However, these approximations become inadequate in more complex condensed phase environments, e.g., solid liquid interfaces of confined reaction spaces. In this chapter, we provide an overview of the state-of-art in the computational quantification of entropy and its known ramifications on catalysis. The fundamental roles of thermodynamics and kinetics in catalysis are covered in enough detail to appreciate and contextualize the computational methods employed to compute chemically accurate estimates of entropy. These methods are discussed in appropriate detail and range from the ubiquitous harmonic oscillator approximation where entropy unrelated to high frequency oscillations is typically underestimated, to enhanced free energy sampling with molecular dynamics where the desired accuracy must be weighed against the associated computational cost of obtaining it. The rising importance of machine learning and artificial intelligence in accelerating methodological progress in this field is touched upon, as well. Finally, applications, successes, and pitfalls of using these methods are provided to showcase past and present accomplishments while clarifying where improvements in both understanding and methodology are still needed.

Kollias, Loukas↗
DOE OSTI2021

Predicting Hugoniot equation of state in erythritol with ab initio and reactive molecular dynamics

Erythritol has been proposed as an inert surrogate for developing theoretical and computational models to study aging in energetic materials. In this work, we present a comparison of mechanical and shock properties of erythritol computed using the ReaxFF reactive force field and from ab initio calculations employing density functional theory (DFT). We screened eight different ReaxFF parameterizations, of which the CHO parameters developed for hydrocarbon oxidation provide the most accurate predictions of mechanical properties and the crystal structure of erythritol. Further validation of the applicability of this ReaxFF parameterization for modeling erythritol is demonstrated by comparing predictions of the elastic constants, crystal structure, vibrational density of states, and Hugoniot curves against DFT calculations. The ReaxFF predictions are in close agreement with the DFT simulations for the elastic constants and shock Hugoniot when the crystal is loaded along its c axis but show as much as 30% disagreement in the elastic constants in the ab plane and 12% difference in shock pressures when shocked along the a or b crystal axes. Last, we compare thermomechanical properties predicted from classical molecular dynamics with those calculated using the quasi-harmonic approximation and show that quantum mechanical effects produce large discrepancies in the computed values of heat capacity and thermal expansion coefficients compared with classical assumptions. Combining classical molecular dynamics predictions of mechanical behavior with phonon-based calculations of thermal behaviors, we show that predicted shock-induced temperatures for pressures up to 6.5 GPa do not exceed the pressure-dependent melting point of erythritol.

Hu, Jing↗
DOE OSTI2020

Deep learning of free boundary and Stefan problems

Free boundary problems appear naturally in numerous areas of mathematics, science and engineering. These problems present a great computational challenge because they necessitate numerical methods that can yield an accurate approximation of free boundaries and complex dynamic interfaces. In this work, we propose a multi-network model based on physics-informed neural networks to tackle a general class of forward and inverse free boundary problems called Stefan problems. Specifically, we approximate the unknown solution as well as any moving boundaries by two deep neural networks. Besides, we formulate a new type of inverse Stefan problems that aim to reconstruct the solution and free boundaries directly from sparse and noisy measurements. We demonstrate the effectiveness of our approach in a series of benchmarks spanning different types of Stefan problems, and illustrate how the proposed framework can accurately recover solutions of partial differential equations with moving boundaries and dynamic interfaces. All code and data accompanying this manuscript are publicly available at https://github.com/PredictiveIntelligenceLab/DeepStefan.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers are powerful tools for Bayesian inference but suffer from high computational costs due to their reliance on large particle ensembles for accurate estimates. We introduce persistent sampling (PS), an extension of SMC that systematically retains and reuses particles from all prior iterations to construct a growing, weighted ensemble. By leveraging multiple importance sampling and resampling from a mixture of historical distributions, PS mitigates the need for excessively large particle counts, directly addressing key limitations of SMC such as particle impoverishment and mode collapse. Crucially, PS achieves this without additional likelihood evaluations-weights for persistent particles are computed using cached likelihood values. This framework not only yields more accurate posterior approximations but also produces marginal likelihood estimates with significantly lower variance, enhancing reliability in model comparison. Furthermore, the persistent ensemble enables efficient adaptation of transition kernels by leveraging a larger, decorrelated particle pool. Experiments on high-dimensional Gaussian mixtures, hierarchical models, and non-convex targets demonstrate that PS consistently outperforms standard SMC and related variants, including recycled and waste-free SMC, achieving substantial reductions in mean squared error for posterior expectations and evidence estimates, all at reduced computational cost. PS thus establishes itself as a robust, scalable, and efficient alternative for complex Bayesian inference tasks.

Karamanis, Minas↗
DOE OSTI2022

Prehydrodynamic evolution and its impact on quark-gluon plasma signatures

State-of-the-art hydrodynamic models of heavy-ion collisions have considerable theoretical model uncertainties in the description of the very early prehydrodynamic stage. Here we add a new computational module, K T Iso, that describes the prehydrodynamic evolution kinetically, based on the relativistic Boltzmann equation with collisions treated in the isotropization time approximation. As a novelty, K T Iso allows for the inclusion and evolution of initial-state momentum anisotropies. To maintain computational efficiency K T Iso assumes strict longitudinal boost invariance and allows collisions to isotropize only the transverse momenta. We use it to explore the sensitivity of hadronic observables measured in relativistic heavy-ion collisions to initial-state momentum anisotropies and microscopic scattering during the prehydrodynamic stage.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗
DOE OSTI2024

Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations

Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Accuracy of the time-averaged ponderomotive approximation for laser-plasma accelerator modeling

Reliable modeling of laser-plasma accelerators, where a short and intense laser pulse propagates in an underdense plasma over long distances, is a computationally challenging task. This is due to the great disparity among the scales involved in the modeling, ranging from the micrometer scale of the laser wavelength to, for instance, the meter scale of the laser-plasma interaction length for a multi-GeV-class laser-plasma accelerator. To reduce such imbalance, the time-averaged ponderomotive approximation may be used, where the plasma particle dynamics is analytically averaged over the laser frequency, and only spatiotemporal scales associated with the laser envelope are retained in the calculations, resulting in significant computational savings. Here, we characterize the accuracy and robustness of the time-averaged ponderomotive approximation for a range of laser parameters of interest for present and future laser-plasma accelerators, and we show that the error introduced by the averaging process is small in all relevant cases.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

An extension of Thwaites’ method for turbulent boundary layers

Thwaites developed an approximate method for determining the evolution of laminar boundary layers. The approximation follows from an assumption that the growth of a laminar boundary layer in the presence of pressure gradients could be parameterized solely as a function of the Holstein–Bohlen flow parameter, thus reducing the von Kármán momentum integral to a first-order ordinary differential equation. This method is useful for the analysis of laminar flows, and in computational potential flow solvers to account for the viscous effects. In this work, an approximate method for determining the momentum thickness of a two-dimensional, turbulent boundary layer is proposed following Thwaites’ work. It is shown that the method provides good estimates of the momentum thickness for multiple boundary layers, including both favourable and adverse pressure gradient effects, up to the point of separation. In the limit of high Reynolds numbers, it is possible to derive a criterion for the onset of separation from the proposed model, which is shown to be in agreement with prior empirical observations. The sensitivity of the separation location with respect to upstream perturbations is also analysed through this model for the NASA/Boeing speed bump and the transonic Bachalo–Johnson bump.

17 WIND ENERGY↗
DOE OSTI2023

Beyond the 3rd moment: a practical study of using lensing convergence CDFs for cosmology with DES Y3

ABSTRACT Widefield surveys probe clustered scalar fields – such as galaxy counts, lensing potential, etc. – which are sensitive to different cosmological and astrophysical processes. Constraining such processes depends on the statistics that summarize the field. We explore the cumulative distribution function (CDF) as a summary of the galaxy lensing convergence field. Using a suite of N-body light-cone simulations, we show the CDFs’ constraining power is modestly better than the second and third moments, as CDFs approximately capture information from all moments. We study the practical aspects of applying CDFs to data, using the Dark Energy Survey (DES Y3) data as an example, and compute the impact of different systematics on the CDFs. The contributions from the point spread function and reduced shear approximation are $\lesssim 1~{{\ \rm per\ cent}}$ of the total signal. Source clustering effects and baryon imprints contribute 1–10 per cent. Enforcing scale cuts to limit systematics-driven biases in parameter constraints degrade these constraints a noticeable amount, and this degradation is similar for the CDFs and the moments. We detect correlations between the observed convergence field and the shape noise field at 13σ. The non-Gaussian correlations in the noise field must be modelled accurately to use the CDFs, or other statistics sensitive to all moments, as a rigorous cosmology tool.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Toward computing bounds for Ramsey numbers using quantum annealing

Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems, such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum annealing as a tool for use in exploring combinatorial mathematics research problems. We consider the monochromatic triangle problem and the Ramsey number problem, both examples of graph coloring. Conversion to quadratic unconstrained binary optimization (QUBO) form is required to run on quantum hardware. While the monochromatic triangle problem is quadratic by nature, the Ramsey number problem requires the use of order reduction methods for a quadratic formulation. The goal is to provide a method for producing special colorings of graphs which if successful would provide lower bounds for certain Ramsey numbers. We discuss implementations, limitations, and results when running on the D-Wave Advantage quantum annealer.

97 MATHEMATICS AND COMPUTING↗