Search NASA⌕ Search

SEARCH · Search NASA

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer

There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We introduce a new circuit optimizer called AQCEL, which aims to remove redundant controlled operations from controlled gates, depending on initial states of the circuit. Especially, the AQCEL can remove unnecessary qubit controls from multi-controlled gates in polynomial computational resources, even when all the relevant qubits are entangled, by identifying zero-amplitude computational basis states using a quantum computer. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. For this benchmark, we have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates. Moreover, when deploying AQCEL with a noisy intermediate scale quantum computer, it efficiently produces a quantum circuit that approximates the original circuit with high fidelity by truncating low-amplitude computational basis states below certain thresholds. Our technique is useful for a wide variety of quantum algorithms, opening up new possibilities to further simplify quantum circuits to be more effective for real devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Goal-oriented real-time Bayesian inference for linear autonomous dynamical systems with application to digital twins for tsunami early warning

We present a goal-oriented framework for constructing digital twins with the following properties: (1) they employ discretizations of high-fidelity partial differential equation (PDE) models governed by autonomous dynamical systems, leading to large-scale forward problems; (2) they solve a linear inverse problem to assimilate observational data to infer uncertain model components followed by a forward prediction of the evolving dynamics; and (3) the entire end-to-end, data-to-inference-to-prediction computation is carried out without approximation and in real time through a Bayesian framework that rigorously accounts for uncertainties. Several challenges must be overcome to realize this framework, including the large scale of the forward problem, the high dimensionality of the parameter space, and for a class of problems including those we target, the slow decay of the singular values of the parameter-to-observable map. Here we introduce a methodology to overcome these challenges by exploiting the autonomous structure of the forward model to decompose the solution of the inverse problem into a one-time-only offline phase in which the PDE model is solved a limited number of times (equal to the number of sensors), and an online phase that maps well onto GPUs and computes the parameter inference and prediction of quantities of interest in real time, given observational data. Our ultimate goal is to apply this framework to construct digital twins for subduction zones, including Cascadia, to provide early warning for tsunamis generated by megathrust earthquakes. To this end, we demonstrate how our methodology can be used to employ seafloor pressure observations, along with the coupled acoustic–gravity wave equations, to infer the earthquake-induced spatiotemporal seafloor motion (discretized with $\mathscr{O}$ (10 9 ) parameters) and forward predict the tsunami propagation. We present results of an end-to-end inference, prediction, and uncertainty quantification for a representative test problem with $\mathscr{O}$ (10 8 ) inversion parameters for which goal-oriented Bayesian inference is accomplished exactly and in real time, that is, in a matter of seconds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Generative diffusion model surrogates for mechanistic agent-based biological models

Mechanistic, multicellular, agent-based models are commonly used to investigate tissue, organ, and organism-scale biology at single-cell resolution. The Cellular-Potts Model (CPM) is a powerful and popular framework for developing and interrogating these models. CPMs become computationally expensive at large space- and time- scales making application and investigation of developed models difficult. Surrogate models may allow for the accelerated evaluation of CPMs of complex biological systems. However, the stochastic nature of these models means each set of parameters may give rise to different model configurations, complicating surrogate model development. In this work, we leverage denoising diffusion probabilistic models (DDPMs) to train a generative AI surrogate of a CPM used to investigate in vitro vasculogenesis. We describe the use of an image classifier to learn the characteristics that define unique areas of a 2-dimensional parameter space. We then apply this classifier to aid in surrogate model selection and verification. Our CPM model surrogate generates model configurations 20,000 timesteps ahead of a reference configuration and demonstrates approximately a 22x reduction in computational time as compared to native code execution. Our work represents a step towards the implementation of DDPMs to develop digital twins of stochastic biological systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗
DOE OSTI2022

Excited State Phenomena in Correlated Nanostructures: Transition Metal Oxide Clusters and Nanocrystals

The primary goal of our research program was to apply advanced computational techniques to predict electronic properties of molecular species. These include transition metal monoxide and dioxide clusters and negatively charged copper oxide clusters which are important systems for their utilization in a variety of technological applications. The enhanced electron-electron interactions inherent in these systems make it challenging to model their excited state properties within a parameter-free approach. The excited state properties in question include the interaction of light with these molecules which results in ejection of electrons from the system, or the absorption of light by the molecular system resulting in a molecule in a higher-energy state. Our overall goal was to investigate the impact of various computational and theoretical approaches on such electronic and optical excitations in these systems. Comparing several variants of theoretical approaches with available experimental data, and high-level quantum chemistry computations helped us identify the level of theory and approximations that are needed to achieve a reasonable balance between accuracy and computational demand.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

An Investigation into the Approximations Used in Wave Packet Molecular Dynamics for the Study of Warm Dense Matter

Wave packet molecular dynamics (WPMD) has recently received a lot of attention as a computationally fast tool with which to study dynamical processes in warm dense matter beyond the Born–Oppenheimer approximation. These techniques, typically, employ many approximations to achieve computational efficiency while implementing semi-empirical scaling parameters to retain accuracy. We investigated three of the main approximations ubiquitous to WPMD: a restricted basis set, approximations to exchange, and the lack of correlation. We examined each of these approximations in regard to atomic and molecular hydrogen in addition to a dense hydrogen plasma. We found that the biggest improvement to WPMD comes from combining a two-Gaussian basis with a semi-empirical correction based on the valence-bond wave function. A single parameter scales this correction to match experimental pressures of dense hydrogen. Ultimately, we found that semi-empirical scaling parameters are necessary to correct for the main approximations in WPMD. However, reducing the scaling parameters for more ab-initio terms gives more accurate results and displays the underlying physics more readily.

Angermeier, William A. (ORCID:0000000177161564)↗
DOE OSTI2019

Fast and Scalable Implementations of Influence Maximization Algorithms

The Influence Maximization problem has been extensively studied in the past decade because of its practical applications in finding the key influencers in social networks. Due to the hardness of the underlying problem, existing algorithms have tried to trade off practical efficiency with approximation guarantees. However, even such approximate solutions take several hours of compute time on modest sized real world inputs. On the other hand, there is a lack of effective parallel and distributed algorithms to solve this problem. In this paper, we present efficient parallel algorithms for multithreaded and distributed systems to solve the influence maximization with approximation guarantee. Our algorithms extend state-of-the-art sequential approach based on computing reverse reachability sets. We present a detailed experimental evaluation, and analyze their performance and their sensitivity to input parameters, using real world inputs. Our experimental results demonstrate significant speedup on parallel architectures. We further show a speedup of up to 586X relative to the state-of-the-art sequential baseline using 1024 nodes of a supercomputer at far greater accuracy and twice the seed set size. To the best of our knowledge, this is the first effort in parallelizing the influence maximization operation at scale.

Minutoli, Marco↗
DOE OSTI2021

Flexible nonstationary spatiotemporal modeling of high-frequency monitoring data

Many physical datasets are generated by collections of instruments that make measurements at regular time intervals. For such regular monitoring data, we extend the framework of half-spectral covariance functions to the case of nonstationarity in space and time and demonstrate that this method provides a natural and tractable way to incorporate complex behaviors into a covariance model. Further, we use this method with fully time-domain computations to obtain bona fide maximum likelihood estimators—as opposed to using Whittle-type likelihood approximations, for example—that can still be computed conveniently. Additionally, we apply this method to very high-frequency Doppler LIDAR vertical wind velocity measurements, demonstrating that the model can expressively capture the extreme nonstationarity of dynamics above and below the atmospheric boundary layer and, more importantly, the interaction of the process dynamics across it.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Joint Optimization of Multimodal Transit Frequency and Shared Autonomous Vehicle Fleet Size with Hybrid Metaheuristic and Nonlinear Programming

Shared autonomous vehicles (SAVs) bring competition to traditional transit services but redesigning multimodal transit network can utilize SAVs as feeders to enhance service efficiency and coverage. This paper presents an optimization framework for the joint multimodal transit frequency and SAV fleet size problem, a variant of the transit network frequency setting problem. The objective is to maximize total transit ridership (including SAV-fed trips and subtracting boarding rejections) across multiple time periods under budget constraints, considering endogenous mode choice (transit, point-to-point SAVs, driving) and route selection, while allowing for strategic route removal by setting frequencies to zero. Due to the problem’s non-linear, non-convex nature and the computational challenges of large-scale networks, we develop a hybrid solution approach that combines a metaheuristic approach (particle swarm optimization) with nonlinear programming for local solution refinement. To ensure computational tractability, the framework integrates analytical approximation models for SAV waiting times based on fleet utilization, multimodal network assignment for route choice, and multinomial logit mode choice behavior, bypassing the need for computationally intensive simulations within the main optimization loop. Applied to the Chicago metropolitan area’s multimodal network, our method illustrates a 33.3% increase in transit ridership through optimized transit route frequencies and SAV integration, particularly enhancing off-peak service accessibility and strategically reallocating resources.

Ng, Max↗
DOE OSTI2023

Benchmarks and results of the two-band Hubbard model from the Gutzwiller conjugate gradient minimization theory

Ground-state properties, such as energies and double occupancies, of a one-dimensional two-band Hubbard model are calculated using a first-principles Gutzwiller conjugate gradient minimization theory. The favorable agreement with the results from the density matrix renormalization group theory demonstrates the accuracy of our method. A rotationally invariant approach is further incorporated into the method to greatly reduce the computational complexity with a speedup of approximately 50 times. Moreover, we investigate the Mott transition between a metal and a Mott insulator by evaluating the charge gap. In conclusion, with greatly reduced computational effort, our method reproduces the phase diagram in reasonable agreement with the density matrix renormalization group theory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

An Analytic Benchmark for Neutron Boltzmann Transport with Downscattering—Part I: Flux and Eigenvalue Solutions

Computing in the energy dimension is one of the greatest challenges confronting present-day deterministic neutron transport solvers. Accurately resolving the neutron flux as neutrons downscatter across resonances in the nuclear cross sections currently requires considerable computing power and suffers from approximation errors. Flux uncertainty resulting from the uncertainty of the resonance structure is the single-largest cause of reactivity uncertainty. Any additional reference solution for the critical neutron downscattering problem with resonance phenomena would be a boon to verification and validation of neutronics codes. This paper establishes a benchmark to verify the accuracy of neutron transport criticality solvers along the energy dimension. For the first time, the analytic solution of the flux amplitude is derived in the particular case of an infinite homogeneous medium with isotropic scattering in the center of mass and an arbitrary number of no-threshold, neutral particle reaction resonances (e.g., radiative capture, fission, and resonance scattering). Furthermore, original analytic expressions are established to quantify the discrepancy between the ψ k (E) and ψ α (E) flux amplitudes, respective solutions of the multiplication factor k, or the exponential time-evolution frequency α eigenproblems. The physical study of these relations led to analysis of their first-order relative difference near the criticality condition α=0. Finally, numerical solutions are provided to a benchmark problem constituted of the first resonance of 239 Pu, the 6.67-eV resonance of 238 U, and a scattering isotope with a flat cross section, allowing for the computational verification of the energy resolution of current neutron transport criticality codes. Through these novel results, this analytic benchmark can serve as a reference to verify the energy resolution and sensitivity analysis of neutron transport criticality calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Better Buildings: Energy Savings and Usability of Zero-Client Computing in Office Settings

Plug loads account for approximately 30% of commercial whole-building energy use, and this percentage is growing. That means the United States spends about $60 billion per year on energy to keep our devices running. About 10% of this is attributed to computing resources, which includes both traditional laptop and desktop computers, as well as data centers that can host virtual machines (VMs) and enable teleworking trends. Teleworking and more flexible work environments are becoming increasingly popular options, and many business and building owners wonder whether hosting VMs on data center servers has the potential to save energy. To answer this question, researchers at the National Renewable Energy Laboratory (NREL) conducted a study comparing energy and usability of remote VMs (accessed through zero-client devices) with traditional laptop computers. The findings were published in the Journal of Sustainable Cities and Society in 2017.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2019

Approximating Joint Chance Constraints in Two-Stage Stochastic Programs

We present various approximations to joint chance constraints arising in two-stage stochastic programming models. Our approximations are derived from three classical inequalities: Markov's inequality, Chebysev's inequality, and Chernoff's bound. We provide preliminary computational results illustrating the quality of our approximation using a two-stage joint-chance-constrained stochastic program from the literature. We also briefly introduce other alternatives for constructing approximations for joint-chance-constrained two-stage programs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Multi-Function AAA Algorithm Applied to Frequency-Dependent Line Modeling: Preprint

We present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages respect to the popular Vector Fitting (VF) algorithm using examples of approximations of admittance matrices discussed in a very recent paper and by the creators of VF. We show that not only MIAAA outperforms VF in terms of achieving better accuracy using a smaller number of poles, but also has no numerical issues to achieve convergence. In contrast to VF, MIAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Uncertainty analysis of correlated parameters in automated reaction mechanism generation

Abstract Uncertainty analysis is a useful tool for inspecting and improving detailed kinetic mechanisms because it can identify the greatest sources of model output error. Owing to the very nonlinear relationship between kinetic and thermodynamic parameters and computed concentrations, model predictions can be extremely sensitive to uncertainties in some parameters while uncertainties in other parameters can be irrelevant. Error propagation becomes even more convoluted in automatically generated kinetic models, where input uncertainties are correlated through kinetic rate rules and thermodynamic group values. Local and global uncertainty analyses were implemented and used to analyze error propagation in Reaction Mechanism Generator (RMG), an open‐source software for generating kinetic models. A framework for automatically assigning parameter uncertainties to estimated thermodynamics and kinetics was created, enabling tracking of correlated uncertainties. Local first‐order uncertainty propagation was implemented using sensitivities computed natively within RMG. Global uncertainty analysis was implemented using adaptive Smolyak pseudospectral approximations as implemented in the MIT Uncertainty Quantification Library to efficiently compute and construct polynomial chaos expansions to approximate the dependence of outputs on a subset of uncertain inputs. Cantera was used as a backend for simulating the reactor system in the global analysis. Analyses were performed for a phenyldodecane pyrolysis model. Local and global methods demonstrated similar trends; however, many uncertainties were significantly overestimated by the local analysis. Both local and global analyses show that correlated uncertainties based on kinetic rate rules and thermochemical groups drastically reduce a model's degrees of freedom and have a large impact on the determination of the most influential input parameters. These results highlight the necessity of incorporating uncertainty analysis in the mechanism generation workflow.

Gao, Connie W.↗
DOE OSTI2025

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Density-related properties from self-interaction corrected density functional theory calculations

The Perdew–Zunger self-interaction correction (PZ-SIC) removes unphysical electron self-interaction from calculations employing standard density functional approximations. Doing so improves many computed properties, bringing them into better agreement with experimental observations or with results from high-level quantum chemistry calculations. However, while PZ-SIC generally corrects in the right direction relative to the corresponding reference values, in many cases, it over-corrects. For this reason, scaled-down versions of PZ-SIC have been proposed and investigated. These approaches have mostly employed exterior scaling in which SIC correction terms are scaled in the same way at every point in space. Recently, a new local, or interior, scaling SIC method was proposed on non-empirical grounds to restore a property of the exact, but unknown, density functional that is broken in PZ-SIC. Here, the scaling at each point depends on the character of the charge density at that point. However, the local scaling can be done in various ways while still restoring the behavior of the exact functional. In this work, we compare and contrast the performance of various interior scaling approaches for addressing over-corrections of calculated molecular dipole moments and atomic polarizabilities and properties that reflect the nature of the electronic charge density.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

A windowed mean trajectory approximation for condensed phase dynamics

We propose a trajectory-based quasi-classical method for approximating dynamics in condensed phase systems. Building upon the previously developed optimized mean trajectory approximation that has been used to compute linear and nonlinear spectra, we borrow some ideas from filtering trajectory methods to obtain a novel semiclassical method for the dynamical propagation of density matrices. This new approximation is tested rigorously against standard multistate electronic models, spin-boson models, and models of the Fenna–Matthews–Olson complex. For dissipative systems, the current method is significantly better or as good as many other semiclassical methods available, especially at low temperatures and for off-diagonal density matrix elements, whereas for scattering models, the current method bears similar limitations as mean-field propagation schemes. All results are tested against the numerically exact hierarchical equations of motion method. In conclusion, the new method shows excellent agreement across various parameter regimes with numerically exact results, highlighting the robustness and accuracy of our approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗