Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximation algorithms”

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

Quantum-classical embedding via ghost Gutzwiller approximation for enhanced simulations of correlated electron systems

Simulating correlated materials on present-day quantum hardware remains challenging due to limited quantum resources. Quantum embedding methods offer a promising route by reducing computational complexity through the mapping of bulk systems onto effective impurity models, allowing more feasible simulations on pre- and early-fault-tolerant quantum devices. Here, this work develops a quantum-classical embedding framework based on the ghost Gutzwiller approximation to enable quantum-enhanced simulations of ground-state properties and spectral functions of correlated electron systems. Circuit complexity is analyzed using an adaptive variational quantum algorithm on a statevector simulator, applied to the infinite-dimensional Hubbard model with increasing ghost mode numbers from 3 to 5, resulting in circuit depths growing from 16 to 104. Noise effects are examined using a realistic error model, revealing significant impact on the spectral weight of the Hubbard bands. To mitigate these effects, the Iceberg quantum error detection code is employed, achieving up to 40% error reduction in simulations. Finally, the accuracy of the density matrix estimation and the derived spectral function is benchmarked on IBM and Quantinuum quantum hardware, featuring distinct qubit-connectivity and employing multiple levels of error mitigation techniques.

Chen, I-Chi [Ames Laboratory (AMES), Ames, IA (Uni↗
DOE OSTI2025

Bridging material models across scales: An integrated approach to equation of state and molecular dynamics modeling of copper

New uncertainty-aware equation of state (EOS) and electrical conductivity (EC) models for copper have been developed. The multiphase EOS/EC models are fit to experimental solid/liquid EC isobar measurements as well as density-functional theory molecular dynamics (DFT-MD) EC calculations in both expanded and compressed regimes (0.1–16 g/ cm 3 ⁠). The liquid and solid EOS phases were fit to available experimental data along with additional DFT-MD data over the same range as the EC. Leveraging the DFT-MD data, a corresponding machine-learned interatomic potential (MLIAP) for copper was trained using genetic-algorithm optimization. The copper MLIAP was constrained by EOS shock points at high compressions. The final EOS bounded MLIAP proves to be stable over a large density range (approximately 0.1–20 g/ cm 3 ) with good agreement to an isothermal compression curve, shock Hugoniot, and liquid speed of sound measurements at high pressures (100s of GPa).

Acoustic measurements and instrumentation↗
DOE OSTI2022

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Continuous momentum dependence in the dynamical cluster approximation

The dynamical cluster approximation (DCA) is a quantum cluster extension to the single-site dynamical mean-field theory that incorporates spatially nonlocal dynamic correlations systematically and nonperturbatively. The DCA + algorithm addresses the cluster shape dependence of the DCA and improves the convergence with cluster size by introducing a lattice self-energy with continuous momentum dependence. However, we show that the DCA + algorithm is plagued by a fundamental problem when its self-consistency equations are formulated using the bare Green's function of the cluster. This problem is most severe in the strongly correlated regime at low doping, where the DCA + self-energy becomes overly metallic and local, and persists to cluster sizes where the standard DCA has long converged. In view of the failure of the DCA + algorithm, we propose to complement DCA simulations with a post-interpolation procedure for single-particle and two-particle correlation functions to preserve continuous momentum dependence and the associated benefits in the DCA. We demonstrate the effectiveness of this practical approach with results for the half-filled and hole-doped two-dimensional Hubbard model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Parallax-corrected VISST-derived pixel-level products from satellite GOES-16

The NASA Langley group led by William Smith produced GOES-16 satellite cloud retrievals over an approximate 10 by 10 degree region over the CACTI field campaign location. These retrievals are described here: https://www.arm.gov/capabilities/vaps/visst and are available for download here . They use algorithms historically called VISST that are now referred to as SatCORPS. More information can be found in Trepte et al. (2019), Minnis et al. (2021), and Yost et al. (2021). If using this dataset, please cite these references, the CACTI VISST dataset DOI found at the download link above, and this dataset’s DOI. The CACTI VISST pixel-level retrievals are on a 2 km spatial grid and available every 15 minutes (every 10 minutes late in the campaign), producing 21,765 files for the entire field campaign between October 2018 and April 2019. They are not corrected for parallax error, which is an offset in the actual geographical location of a cloud above the surface due to the satellite viewing the cloud partly from the side off nadir. This dataset applies a correction for parallax using the location relative to the satellite and the retrieved cloud top height above the surface, which allows the dataset to be geo-located with surface-based observations. The parallax correction for each location depends on the longitude, latitude and cloud top height above ground level (AGL) for that longitude and latitude in the original VISST files. The cloud top height AGL requires first computing the surface elevation at each VISST grid point. Data from the Advanced Spaceborne Thermal Emission and Reflection (ASTER) Global Digital Elevation Map Version 3 at 30-m resolution is projected onto the VISST grid using conservative coarsening (conserving surface elevation) in the xESMF Python package. The surface elevation is then subtracted from the VISST-retrieved cloud top height above mean sea level. These cloud top heights AGL are then combined with longitude and latitude to estimate the latitude and longitude corrections. Due to variability in cloud top height, the parallax shifts produce an irregular grid of values since higher cloud tops are shifted further than lower cloud tops. A ball tree-based neighbor search with Haversine distance is performed using the Python-based scikit-learn library to find the nearest VISST grid point to each parallax correction-shifted point. The data value of the shifted point is then assigned to that VISST grid point. In this manner, the irregular geographical shifts to correct for parallax are projected back to the rectilinear VISST grid. Because relatively higher clouds should obscure lower clouds, the variable values for the highest cloud top are preferentially chosen if two or more values are assigned to a grid point. The parallax correction should be viewed as an improved but still imperfect estimation of the cloud top locations, largely because the cloud top height is an imperfect retrieval. Please see the attached README document for further information. Users are encouraged to contact the authors with any additional questions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗
DOE OSTI2026

SpaceNet 9—Cross-Sensor Alignment of Optical and SAR Imagery

Precise registration of high-resolution synthetic aperture radar (SAR) and optical imagery is necessary for realizing the full potential and benefits of multimodal image analysis. However, two significant challenges presently exist. First, there is a lack of annotated datasets and benchmarks available for high-resolution SAR–optical image registration. Second, an assessment of efficient and reliable image registration methods that can precisely align these modalities is lacking. Here, we present a holistic description of the SpaceNet 9 Challenge and its results. We present a description of the dataset and baseline algorithm along with the results of the challenge, including a description of the winning algorithms. We release the SpaceNet 9 dataset along with open-sourcing the winning algorithms and baseline. The objective of SpaceNet 9 was to compute a dense displacement map that indicates the shift needed to align pixels in an optical image to the pixels in a SAR image. The challenge launched in April 2025 and was active for approximately two months. The top five solutions reduced image alignment error from approximately 34 m to under 13 m for public and private test data, with the best results obtaining a registration error of only 8.5 and 6.7 m on the public testing and private testing dataset, respectively. Usage of pretrained image matching models, robust outlier rejection with RANSAC, and estimating local displacement were common among the top solutions. The results of this challenge provide insight into high-resolution SAR–optical image registration and offer opportunities for future benchmarking in this domain. The baseline algorithm, winning solutions, and datasets are available at https://spacenet.ai/sn9-challenge/.

benchmark datasets↗
DOE OSTI2021

Conditional Point Sampling: A Monte Carlo Method for Radiation Transport in Stochastic Media.

Current methods for stochastic media transport are either computationally expensive or, by nature, approximate. Moreover, none of the well-developed, benchmarked approximate methods can compute the variance caused by the stochastic mixing, a quantity especially important to safety calculations. Therefore, we derive and apply a new conditional probability function (CPF) for use in the recently developed stochastic media transport algorithm Conditional Point Sampling (CoPS), which 1) leverages the full intra-particle memory of CoPS to yield errorless computation of stochastic media outputs in 1D, binary, Markovian-mixed media, and 2) leverages the full inter-particle memory of CoPS and the recently developed Embedded Variance Deconvolution method to yield computation of the variance in transport outputs caused by stochastic material mixing. Numerical results demonstrate errorless stochastic media transport as compared to reference benchmark solutions with the new CPF for this class of stochastic mixing as well as the ability to compute the variance caused by the stochastic mixing via CoPS. Using previously derived, non-errorless CPFs, CoPS is further found to be more accurate than the atomic mix approximation, Chord Length Sampling (CLS), and most of memory-enhanced versions of CLS surveyed. In addition, we study the compounding behavior of CPF error as a function of cohort size (where a cohort is a group of histories that share intra-particle memory) and recommend that small cohorts be used when computing the variance in transport outputs caused by stochastic mixing.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2022

Quantifying the impact of temporal analysis of products reactor initial state uncertainties on kinetic parameters

The temporal analysis of products (TAP) reactor, a transient kinetic tool, provides users with information as the catalyst state evolves. However, the state of the art for TAP uncertainty quantification only considers the experimental noise present in the outlet flow signal. Additional sources of uncertainty, including, but not limited to, initial surface coverages, the catalyst zone location, the inert void fraction, and the gas pulse intensity and pulse delay, are not included. For this reason, a framework for quantifying all uncertainty sources present in TAP experiments is presented and applied to a carbon monoxide oxidation case study. Herein, two methods for quantifying these sources of uncertainty are introduced. The first utilizes initial state sensitivities to approximate the parameter variances, as well as to provide insights into the structural certainty of the model. The second generates parameter confidence distributions through an ensemble-based sampling algorithm. This initial state covariance matrix can ultimately be merged with the experimental noise covariance matrix, providing a unified description of the parameter uncertainties for a single TAP experiment.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A workflow for automatic generation and efficient refinement of individual pressure-dependent networks

Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.

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

The Illumination of Thunderclouds by Lightning: 4. Volumetric Thunderstorm Imagery

Optical instruments such as the Geostationary Lightning Mapper (GLM) detect lightning based on transient changes in cloud illumination. The horizontal location of lightning is determined from the coordinates of the pixels on the imaging array illuminated during the flash. However, the vertical position of the lightning pulses (approximated by GLM “groups”) below the cloud top cannot be routinely measured from a single space-based instrument. In our prior work, we have developed a machine learning algorithm that can infer optical source altitude for a given pulse based on how the optical energy is distributed across the group footprint and the local Advanced Baseline Imager Cloud-Top Height (CTH). In this fourth part of our thundercloud illumination study, we leverage these source altitudes to generate volumetric GLM imagery of a Colombia thunderstorm. We find that 3D versions of the current GLM meteorological imagery products (that describe thunderstorm kinematics) and thundercloud imagery products (that depict how the flashes appear from space) provide additional insights into lightning activity in the thunderstorm that are lost in the vertical integration used to generate the current 2D GLM gridded products. This new volumetric imaging capability provides a more comprehensive picture of where lightning occurs in the storm, how its physical characteristics vary across three-dimensional space, and how its optical emissions interact with surrounding the cloud medium.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Implicit full-F simulations of neoclassical ion transport

The development of implicit time integration capabilities for axisymmetric full-F continuum simulations of ion neoclassical transport is reported. The approach involves the implicit treatment of the gyrokinetic Vlasov equation coupled to the nonlinear Fokker–Planck collision model in the long-wavelength limit approximation. To facilitate implicit simulations, advanced preconditioning of individual physics operators is developed, and a global multi-physics preconditioner is constructed by adopting an operator splitting methodology. The algorithm is implemented in the finite-volume code COGENT and is applied to study neoclassical transport properties for both the main ion species and the lithium impurity species in the closed-field-line region of the LTX- β tokamak. The implicit COGENT simulations elucidate the role of non-local transport effects, while demonstrating substantial speedup over the corresponding explicit approach.

Dorf, Mikhail [Lawrence Livermore National Laborat↗
DOE OSTI2020

Flat-histogram extrapolation as a useful tool in the age of big data

In this work, we review recent work by the authors to revisit the concept of extrapolating thermodynamic properties of classical systems using statistical mechanical principles. Specifically, we discuss how the combination of these principles with biased sampling techniques enables the prediction of free energy landscapes and other detailed information, such as structural properties, of the system in question. Remarkably accurate estimates of physical properties across a broad range of conditions have been achieved using this approach, greatly reducing the number of simulations needed to explore a given system's behaviour. While approximate, these extrapolations significantly amplify the amount of reasonably accurate information that can be extracted from simulations enabling a small set of them to feed data-intensive regression algorithms such as neural networks. Thus, this extrapolation methodology represents a useful tool for performing tasks such as high-throughput screening of physical properties, optimising force field parameters, exploring equilibrium phase behaviour, and enabling theory-guided data science for these systems.

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

Ensuring Transient Stability With Guaranteed Region of Attraction in DC Microgrids

DC microgrids have promising applications in renewable integration due to their better energy efficiency when connecting DC components. However, they might be unstable since many loads in a DC microgrid are regulated as constant power loads (CPLs) that have a destabilizing negative impedance effect. As a result, the state trajectory displacement caused by abrupt load changes or contingencies can easily lead to instability. Many existing works have been devoted to studying the region of attraction (ROA) of a DC microgrid, in which the system is guaranteed to be asymptotically stable. Nevertheless, existing work either focuses on using numerical methods for ROA approximations that generally have no performance guarantees or cannot ensure a desired ROA for a general DC microgrid. To close this gap, this paper develops an innovative control synthesis algorithm to make a general DC microgrid have a theoretically guaranteed ROA, for example, to cover the entirety of its operating range regarding state trajectories. Here, we first study the nonlinear dynamics of a DC microgrid to derive a novel transient stability condition to rigorously certify whether a given operating range is a subset of the ROA; then, we formulate a control synthesis optimization problem to guarantee the condition’s satisfaction. This condition is a linear constraint, and the optimization problem resembles an optimal power flow problem and has a good computational behavior. Simulation case studies verify the validity of the proposed work.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Uncertainty Quantification of Geophysical Inversion Using Stochastic Partial Differential Equations (LDRD #218329)

This report summarizes work completed under the Laboratory Directed Research and Development (LDRD) project "Uncertainty Quantification of Geophysical Inversion Using Stochastic Differential Equations." Geophysical inversions often require computationally expensive algorithms to find even one solution, let alone propagating uncertainties through to the solution domain. The primary purpose of this project was to find more computationally efficient means to approximate solution uncertainty in geophysical inversions. We found multiple computationally efficient methods of propagating Earth model uncertainty into uncertainties in solutions of full waveform seismic moment tensor inversions. However, the optimum method of approximating the uncertainty in these seismic source solutions was to use the Karhunen-Love theorem with data misfit residuals. This method was orders of magnitude more computationally efficient than traditional Monte Carlo methods and yielded estimates of uncertainty that closely approximated those of Monte Carlo. We will summarize the various methods we evaluated for estimating uncertainty in seismic source inversions as well as work toward this goal in the realm of 3-D seismic tomographic inversion uncertainty.

58 GEOSCIENCES↗
DOE OSTI2020

Development of Real-Time System Identification to Detect Abnormal Operations in a Gas Turbine Cycle

Here, we present a novel online system identification methodology for monitoring the performance of power systems. This methodology was demonstrated in a gas turbine recuperated power plant designed for a hybrid configuration. A 120-kW Garrett microturbine modified to test dynamic control strategies for hybrid power systems designed at the National Energy Technology Laboratory (NETL) was used to implement and validate this online system identification methodology. The main component of this methodology consists of an empirical transfer function model implemented in parallel to the turbine speed operation and the fuel control valve, which can monitor the process response of the gas turbine system while it is operating. During fully closed-loop operations or automated control, the output of the controller, fuel valve position, and the turbine speed measurements were fed for a given period of time to a recursive algorithm that determined the transfer function parameters during the nominal condition. After the new parameters were calculated, they were fed into the transfer function model for online prediction. The turbine speed measurement was compared against the transfer function prediction, and a control logic was implemented to capture when the system operated at nominal or abnormal conditions. To validate the ability to detect abnormal conditions during dynamic operations, drifting in the performance of the gas turbine system was evaluated. A leak in the turbomachinery working fluid was emulated by bleeding 10% of the airflow from the compressor discharge to the atmosphere, and electrical load steps were performed before and after the leak. This tool could detect the leak 7 s after it had occurred, which accounted for a fuel flow increase of approximately 15.8% to maintain the same load and constant turbine speed operations.

algorithms↗