Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational methods”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗
DOE OSTI2026

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗
DOE OSTI2025

Fast HARDI Uncertainty Quantification and Visualization with Spherical Sampling

In this paper, we study uncertainty quantification and visualization of orientation distribution functions (ODF), which corresponds to the diffusion profile of high angular resolution diffusion imaging (HARDI) data. The shape inclusion probability (SIP) function is the state‐of‐the‐art method for capturing the uncertainty of ODF ensembles. The current method of computing the SIP function with a volumetric basis exhibits high computational and memory costs, which can be a bottleneck to integrating uncertainty into HARDI visualization techniques and tools. We propose a novel spherical sampling framework for faster computation of the SIP function with lower memory usage and increased accuracy. In particular, we propose direct extraction of SIP isosurfaces, which represent confidence intervals indicating spatial uncertainty of HARDI glyphs, by performing spherical sampling of ODFs. Our spherical sampling approach requires much less sampling than the state‐of‐the‐art volume sampling method, thus providing significantly enhanced performance, scalability, and the ability to perform implicit ray tracing. Our experiments demonstrate that the SIP isosurfaces extracted with our spherical sampling approach can achieve up to 8164× speedup, 37282× memory reduction, and 50.2% less SIP isosurface error compared to the classical volume sampling approach. We demonstrate the efficacy of our methods through experiments on synthetic and human‐brain HARDI datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
DOE OSTI2024

Impact of Reordering on the LU Factorization Performance of Bordered Block-Diagonal Sparse Matrix

Power engineers rely on computer-based simulation tools to assess grid performance and ensure security. At the core of these tools are solvers for sparse linear equations. When transformed into a bordered block-diagonal (BBD) structure, part of the sparse linear equation solving can be parallelized. This work focuses on using the Schur-complement-based method for LU factorization on BBD matrices, specifically, Jacobian matrices from large-scale systems. Our findings show that the natural ordering method outperforms the default ordering method in computational performance for each block of the BBD matrix. This observation is validated using synthetic 25k-bus and 70k-bus cases, showing a speedup of up to 38% when using natural ordering without permutation. Additionally, the impact of the number of partitions is studied, and the result shows that computational performance improves with more, smaller partitions in the BBD matrices.

BBD matrix↗
DOE OSTI2025

Uncertainty quantification for neural network potential foundation models

Abstract For neural network potentials (NNPs) to gain widespread use, researchers must be able to trust model outputs. However, the blackbox nature of neural networks and their inherent stochasticity are often deterrents, especially for foundation models trained over broad swaths of chemical space. Uncertainty information provided at the time of prediction can help reduce aversion to NNPs. In this work, we detail two uncertainty quantification (UQ) methods. Readout ensembling, by finetuning the readout layers of an ensemble of foundation models, provides information about model uncertainty, while quantile regression, by replacing point predictions with distributional predictions, provides information about uncertainty within the underlying training data. We demonstrate our approach with the MACE-MP-0 model, applying UQ to the foundation model and a series of finetuned models. The uncertainties produced by the readout ensemble and quantile methods are demonstrated to be distinct measures by which the quality of the NNP output can be judged.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Perturbative QCD contribution to transverse single spin asymmetries in the Drell-Yan process and SIDIS

In a previous publication [Benić , ], we have computed the perturbative QCD contribution to transverse single spin asymmetries (SSAs) in semi-inclusive deep inelastic scattering (SIDIS) involving the g T ( x ) distribution. In this paper, we first present a more efficient derivation of the asymmetries which is applicable to both transverse and longitudinal SSAs and correct some inconsistencies in our previous calculation. We then adapt the method to compute transverse SSAs in the Drell-Yan process proportional to g T ( x ) and its gluonic counterpart and discuss the crossing symmetry between the results for SIDIS and the Drell-Yan process. Finally, we present numerical results for various asymmetries measurable at the EIC, RHIC, COMPASS, and Fermilab (SpinQuest), including also part of the genuine twist-three corrections to g T ( x ) from a recent global analysis. We find that the asymmetries can reach percent-level magnitude, if the kinematics predominantly probes the large- x (valence) region of the polarized proton, but remain at subpercent levels otherwise. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Identifying Sample Provenance From SEM/EDS Automated Particle Analysis via Few-Shot Learning Coupled With Similarity Graph Clustering

Automated particle analysis (APA) provides a vast amount of compositional data via energy-dispersive X-ray spectroscopy along with size and shape data via scanning electron microscopy for individual particles in a sample. In many instances, APA data are leveraged to support identification of the source of a sample based on the detection of particles of a specific composition. Often, the particles that provide context make up a minuscule portion of the sample. Additionally, the interpretation of complex samples can be difficult due to the diversity of compositions both in the mixture and within a particle. In this work, we demonstrate a method to compute and cluster similarity graphs that describe inter-particle relationships within a sample using a multi-modal few-shot learning neural network. Here, as a proof-of-concept, we show that samples known to have been exposed to gunshot residue can be distinguished from samples occasionally mistaken for gunshot residue. Our workflow builds upon standard APA techniques and data processing methods to unveil additional information in a readily interpretable and quantitatively comparable format.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Atomate2: modular workflows for materials science

High-throughput density functional theory (DFT) calculations have become a vital element of computational materials science, enabling materials screening, property database generation, and training of “universal” machine learning models. While several software frameworks have emerged to support these computational efforts, new developments such as machine learned force fields have increased demands for more flexible and programmable workflow solutions. This manuscript introduces atomate2, a comprehensive evolution of our original atomate framework, designed to address existing limitations in computational materials research infrastructure. Key features include the support for multiple electronic structure packages and interoperability between them, along with generalizable workflows that can be written in an abstract form irrespective of the DFT package or machine learning force field used within them. Our hope is that atomate2's improved usability and extensibility can reduce technical barriers for high-throughput research workflows and facilitate the rapid adoption of emerging methods in computational material science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Benchmarking third-order cluster perturbation theory for electronically excited states

In this study, we investigate the reliability of cluster perturbation (CP) theory applied to the calculation of electronically excited states through a comprehensive benchmark. In CP theory, perturbative corrections are added to the properties of a parent excitation space, which converge toward the properties of a target excitation space. For the CPS(D-n) model, perturbative corrections through order n are added to the coupled cluster singles (CCS) excitation energies to target the coupled cluster singles and doubles (CCSD) excitation energies. Through a comparative analysis of excitation energy calculations across a diverse set of molecules and wavefunction methods, we present a comprehensive evaluation of the accuracy of the third-order CPS(D) model, CPS(D-3), in calculating excitation energies. Further, our findings demonstrate that CPS(D-3) is a reliable alternative to established methods, particularly CCSD, while systematically overestimating the excitation energies compared to high-level coupled cluster methods such as CC3. These results highlight the strengths and limitations of CPS(D-3), as well as the promising directions for its future development.

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

Improved structure of calcium isotopes from ab initio calculations

The in-medium similarity renormalization group (IMSRG) is a powerful and flexible many-body method to compute the structure of nuclei starting from nuclear forces. Recent developments have extended the IMSRG from its standard truncation at the normal-ordered two-body level, the IMSRG(2), to a precision approximation including normal-ordered three-body operators, the IMSRG(3)-N 7 . This improvement provides a more precise solution to the many-body problem and makes it possible to quantify many-body uncertainties in IMSRG calculations. We explore the structure of 44,48,52 Ca using the IMSRG(3)-N 7 , focusing on understanding existing discrepancies of the IMSRG(2) to experimental results. We find a significantly better description of the first 2 + excitation energy of 48 Ca, improving the description of the shell closure at N=28. At the same time, we find that the IMSRG(3)-N 7 corrections to charge radii do not resolve the systematic underprediction of the puzzling large charge radius difference between 52 Ca and 48 Ca. We present estimates of many-body uncertainties of IMSRG(2) calculations applicable also to other systems based on the size extensivity of the method.

39 ≤ A ≤ 58↗
DOE OSTI2024

Uncertainty-aware particle segmentation for electron microscopy at varied length scales

Electron microscopy is indispensable for examining the morphology and composition of solid materials at the sub-micron scale. To study the powder samples that are widely used in materials development, scanning electron microscopes (SEMs) are increasingly used at the laboratory scale to generate large datasets with hundreds of images. Parsing these images to identify distinct particles and determine their morphology requires careful analysis, and automating this process remains challenging. In this work, we enhance the Mask R-CNN architecture to develop a method for automated segmentation of particles in SEM images. We address several challenges inherent to measurements, such as image blur and particle agglomeration. Moreover, our method accounts for prediction uncertainty when such issues prevent accurate segmentation of a particle. Recognizing that disparate length scales are often present in large datasets, we use this framework to create two models that are separately trained to handle images obtained at low or high magnification. By testing these models on a variety of inorganic samples, our approach to particle segmentation surpasses an established automated segmentation method and yields comparable results to the predictions of three domain experts, revealing comparable accuracy while requiring a fraction of the time. These findings highlight the potential of deep learning in advancing autonomous workflows for materials characterization.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Poster for 12th World Conference for Neutron Radiography (WCNR-12)

Complimentary Relationships Between Neutron Computed Radiography and Digital X-ray Radiography of Radioactive Specimens The Transient Reactor Test (TREAT) Facility is a 19,000 MW reactor located at the Idaho National Laboratory which is used for transient testing of materials and experiments. A neutron radiography facility is installed which allows for low resolution neutron imaging with a capability of items up to 20 cm wide and 400 cm long. Along with the neutron radiography facility, a 370 kV digital X-ray system is located onsite for when X-ray imaging is more practical or when rapid imaging is requested. The X-ray facility can accommodate specimens up to 61 cm wide and 1000 cm long. This poster discusses the complimentary relationship between transfer-method Neutron Computed Radiography (nCR) and Digital X-ray Radiography (DR) imaging of radioactive specimens along with practical applications for nuclear fuels and materials testing programs. Both nCR and DR images were acquired of inert gas and water filled apparatus containing differing materials at varying radiation levels. Highly radioactive items have no effect on nCR image quality whereas radioactivity has varying degrees of effect in DR. Radioactive items as high as 20 mSv/h have been successfully imaged using X-ray DR methods.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

symfind : Addressing the Fragility of Subhalo Finders and Revealing the Durability of Subhalos

Abstract A major question in ΛCDM is what this theory actually predicts for the properties of subhalo populations. Subhalos are difficult to accurately simulate and to find within simulations, and this propagates into uncertainty in theoretical predictions for satellite galaxies. We present Symfind , a new particle-tracking-based subhalo finder, and demonstrate that it can track subhalos to orders-of-magnitude lower masses than commonly used halo-finding tools, with a focus on Rockstar and consistent-trees . These longer survival times mean that at a fixed peak subhalo mass, we find ≈ 15%–40% more subhalos within the virial radius, R vir , and ≈35%–120% more subhalos within R vir /4 in the Symphony dark-matter-only simulation suite. More subhalos are found as the resolution is increased, in contrast to the Rockstar halo finder, which appears to be converged at smaller subhalo counts. We perform extensive numerical testing. In agreement with idealized simulations, we show that the v max , the maximum circular velocity, is systematically biased low until high resolutions ( n peak ≳ 3 × 10 4 ) are achieved, but that mass loss itself can be resolved at much more modest resolutions ( n peak ≳ 4 × 10 3 ). We show that Rockstar converges to false solutions for the mass function, radial distribution, and disruption masses of subhalos. We argue that our new method can trace resolved subhalos until the point of typical galaxy disruption without invoking post hoc orphan modeling. We outline a concrete set of steps for determining whether other subhalo finders meet the same criteria. We publicly release Symfind catalogs and particle data for the Symphony simulation suite at http://web.stanford.edu/group/gfc/symphony .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Prediction of hydration energies of adsorbates at Pt(111) and liquid water interfaces using machine learning

Aqueous phase heterogeneous catalysis is important to various industrial processes, including biomass conversion, Fischer–Tropsch synthesis, and electrocatalysis. Accurate calculation of solvation thermodynamic properties is essential for modeling the performance of catalysts for these processes. Explicit solvation methods employing multiscale modeling, e.g., involving density functional theory and molecular dynamics have emerged for this purpose. Although accurate, these methods are computationally intensive. This study introduces machine learning (ML) models to predict solvation thermodynamics for adsorbates on a Pt(111) surface, aiming to enhance computational efficiency without compromising accuracy. In particular, ML models are developed using a combination of molecular descriptors and fingerprints and trained on previously published water–adsorbate interaction energies, energies of solvation, and free energies of solvation of adsorbates bound to Pt(111). These models achieve root mean square error values of 0.09 eV for interaction energies, 0.04 eV for energies of solvation, and 0.06 eV for free energies of solvation, demonstrating accuracy within the standard error of multiscale modeling. Feature importance analysis reveals that hydrogen bonding, van der Waals interactions, and solvent density, together with the properties of the adsorbate, are critical factors influencing solvation thermodynamics. Furthermore, these findings suggest that ML models can provide rapid and reliable predictions of solvation properties. This approach not only reduces computational costs but also offers insights into the solvation characteristics of adsorbates at Pt(111)–water interfaces.

Adsorption↗
DOE OSTI2024

Neural network kinetics for exploring diffusion multiplicity and chemical ordering in compositionally complex materials

Diffusion involving atom transport from one location to another governs many important processes and behaviors such as precipitation and phase nucleation. The inherent chemical complexity in compositionally complex materials poses challenges for modeling atomic diffusion and the resulting formation of chemically ordered structures. Here, we introduce a neural network kinetics (NNK) scheme that predicts and simulates diffusion-induced chemical and structural evolution in complex concentrated chemical environments. The framework is grounded on efficient on-lattice structure and chemistry representation combined with artificial neural networks, enabling precise prediction of all path-dependent migration barriers and individual atom jumps. To demonstrate the method, we study the temperature-dependent local chemical ordering in a refractory NbMoTa alloy and reveal a critical temperature at which the B2 order reaches a maximum. The atomic jump randomness map exhibits the highest diffusion heterogeneity (multiplicity) in the vicinity of this characteristic temperature, which is closely related to chemical ordering and B2 structure formation. The scalable NNK framework provides a promising new avenue to exploring diffusion-related properties in the vast compositional space within which extraordinary properties are hidden.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Feynman diagrams for matter wave interferometry

We introduce a new theoretical framework based on Feynman diagrams to compute phase shifts in matter wave interferometry. The method allows for analytic computation of higher order quantum corrections, beyond the traditional semi-classical approximation. These additional terms depend on the finite size of the initial matter wavefunction and/or have higher order dependence on ℏ. We apply the method to compute the response of matter wave interferometers to power law potentials and potentials with an arbitrary spatial dependence. The analytic expressions are validated by comparing to numerical simulations, and estimates are provided for the scale of the quantum corrections to the phase shift response to the gravitational field of the earth, anharmonic trapping potentials, and gravitational fields from local proof masses. We also find that for certain experimentally feasible parameters, these corrections are large enough to be measured and could lead to systematic errors if they are not mitigated. We find that to first order in a spatially dependent potential, quantum corrections vanish when the initial matter wavepacket has spherical symmetry and the potential satisfies Laplace's equation. We anticipate these quantum corrections will be especially important for trapped matter wave interferometers and for free-space matter wave interferometers in the presence of proof masses. These interferometers are becoming increasingly sensitive tools for mobile inertial sensing, gravity surveying, tests of gravity and its interplay with quantum mechanics, and searches for dark energy.

Glick, Jonah [Northwestern U.; Fermilab] (ORCID:00↗
DOE OSTI2025

Programmable simulations of molecules and materials with reconfigurable quantum processors

Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials.

74 ATOMIC AND MOLECULAR PHYSICS↗