Search NASA⌕ Search

SEARCH · Search NASA

Results for “Acceleration 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 1,603 records · Page 89
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Correlating Surface Processing of Nb Superconducting RF Cavities with the Evolution of Surface Electronic States

Superconducting-radio frequency (RF) cavities provide an efficient way to accelerate particle beams with extremely high acceleration gradients while generating very small power dissipation. The few nanometers of the surface play a critical role in defining the RF performance of superconducting Nb based cavities. Over the past two decades, several pioneering surface treatment and processing methods have emerged, enabling remarkable improvements in superconducting cavity performance by simultaneously achieving high quality factors with increasing maximum acceleration gradients. These processing approaches include chemical polishing, distinct multi-step thermal treatments under ultra-high vacuum (UHV) conditions over low to high temperature regimes, as well as high-temperature treatments under controlled nitrogen atmospheres. Beyond their macroscopic impact on RF performance, these methods produce distinct surface oxide configurations characterized by different valence states, oxide thicknesses, chemical uniformity, and oxygen concentration profiles extending into the near-surface bulk of niobium. In this work, we are trying to understand how the surface-processing methods and the resulting oxide/oxygen profiles affect the electronic structure of surface and the mechanism of superconductivity. Using a combination of X-ray photoemission and X-ray absorption spectroscopies, we investigate how the valence-band structure and the electronic density of states (DoS) near the Fermi level evolve under different surface treatments. By employing tunable photon energies across multiple elemental absorption edges, we use resonant photoemission to disentangle and identify the elemental contributions to specific valence-band features. Our observations show that different surface-processing methods lead to distinct temperature evolutions of the DoS and valence-band states near the Fermi level. Our results suggest variations in different Nb-O orbital hybridizations in distinct processes and point towards the possibility of different underlying mechanisms of superconductivity governed by surface chemistry and oxide configuration. We also correlate these distinct superconducting mechanisms with RF cavity performance, specifically focusing on measured surface resistance, the nature of the Q-slope, and quench fields observed in superconducting RF measurements. These results will enable us to identify the potential limiting factors and relevant controllable parameters that can be further optimized to improve the performance of superconducting RF cavities.

Tripathi, Malvika [Fermilab] (ORCID:00000001989251↗
DOE OSTI2025

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Reduced‐Order Modeling of Energetic Materials Using Physics‐Aware Recurrent Convolutional Neural Networks in a Latent Space (LatentPARC)

Physics-aware deep learning (PADL) has gained popularity for use in spatiotemporal dynamics simulations, such as those in computational modeling of energetic materials (EM). We show that the challenge PADL methods face while learning complex field evolution problems can be simplified and accelerated by decoupling it into two tasks: learning complex geometric features in evolving fields and modeling dynamics over these features in a lower-dimensional feature space. We build upon our previous work on physics-aware recurrent convolutional neural networks (PARC). PARC embeds knowledge of underlying physics into its neural network architecture for more robust and accurate prediction of evolving physical fields. PARC was shown to effectively learn complex nonlinear features such as the formation of hotspots and coupled shock fronts in various initiation scenarios of EMs, as a function of microstructures, serving effectively as a microstructure-aware burn model. Here, we further accelerate PARC and reduce its computational cost by projecting the original dynamics onto a lower-dimensional invariant manifold, or “latent space.” The projected latent representation encodes the complex geometry of evolving fields (e.g., temperature and pressure) in a set of data-driven features. The reduced dimension of this latent space allows us to learn the dynamics during the initiation of EM with a lighter and more efficient model. We observe a significant decrease in training and inference time while maintaining results comparable to PARC at inference. This work takes steps towards enabling rapid prediction of EM thermomechanics at larger scales and characterization of EM structure–property–performance linkages at a full application scale.

Mathematics and Computing↗
DOE OSTI2024

Advances in in situ/operando techniques for catalysis research: enhancing insights and discoveries

Abstract Catalysis research has witnessed remarkable progress with the advent of in situ and operando techniques. These methods enable the study of catalysts under actual operating conditions, providing unprecedented insights into catalytic mechanisms and dynamic catalyst behavior. This review discusses key in situ techniques and their applications in catalysis research. Advances in in situ electron microscopy allow direct visualization of catalysts at the atomic scale under reaction conditions. In situ spectroscopy techniques like X-ray absorption spectroscopy and nuclear magnetic resonance spectroscopy can track chemical states and reveal transient intermediates. Synchrotron-based techniques offer enhanced capabilities for in situ studies. The integration of in situ methods with machine learning and computational modeling provides a powerful approach to accelerate catalyst optimization. However, challenges remain regarding radiation damage, instrumentation limitations, and data interpretation. Overall, continued development of multi-modal in situ techniques is pivotal for addressing emerging challenges and opportunities in catalysis research and technology.

Chen, Linfeng↗
DOE OSTI2021

Analysis of the ratio of ℓ 1 and ℓ 2 norms in compressed sensing

We study the ratio of ℓ 1 and ℓ 2 norms ( ℓ 1 / ℓ 2 ) as a sparsity-promoting objective in compressed sensing. We first propose a novel criterion that guarantees that an s-sparse signal is the local minimizer of the ℓ 1 / ℓ 2 objective; our criterion is interpretable and useful in practice. We also give the first uniform recovery condition using a geometric characterization of the null space of the measurement matrix, and show that this condition is satisfied for a class of random matrices. We also present analysis on the robustness of the procedure when noise pollutes data. Numerical experiments are provided that compare ℓ 1 / ℓ 2 with some other popular non-convex methods in compressed sensing. Finally, we propose a novel initialization approach to accelerate the numerical optimization procedure. We call this initialization approach support selection, and we demonstrate that it empirically improves the performance of existing ℓ 1 / ℓ 2 algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Isochronous and period-doubling diagrams for symplectic maps of the plane

Symplectic mappings of the plane serve as key models for exploring the fundamental nature of complex behavior in nonlinear systems. Central to this exploration is the effective visualization of stability regimes, which enables the interpretation of how systems evolve under varying conditions. While the area-preserving quadratic Hénon map has received significant theoretical attention, a comprehensive description of its mixed parameter-space dynamics remain lacking. This limitation arises from early attempts to reduce the full two-dimensional phase space to a one-dimensional projection, a simplification that resulted in the loss of important dynamical features. Consequently, there is a clear need for a more thorough understanding of the underlying qualitative aspects. This paper aims to address this gap by revisiting the foundational concepts of reversibility and associated symmetries, first explored in the early works of G.D. Birkhoff. We extend the original framework proposed by Hénon by adding a period-doubling diagram to his isochronous diagram, which allows to represents the system’s bifurcations and the groups of symmetric periodic orbits that emerge in typical bifurcations of the fixed point. A qualitative and quantitative explanation of the main features of the region of parameters with bounded motion is provided, along with the application of this technique to other symplectic mappings, including cases of multiple reversibility. Modern chaos indicators, such as the Reversibility Error Method (REM) and the Generalized Alignment Index (GALI), are employed to distinguish between various dynamical regimes in the mixed space of variables and parameters. These tools prove effective in differentiating regular and chaotic dynamics, as well as in identifying twistless orbits and their associated bifurcations. Additionally, we discuss the application of these methods to real-world problems, such as visualizing dynamic aperture in accelerator physics, where our findings have direct relevance.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Interpretable, extensible linear and symbolic regression models for charge density prediction using a hierarchy of many-body correlation descriptors

Here, density functional theory (DFT) is routinely used to make electronic structure predictions for high-throughput screening of materials and molecules for technologically relevant areas, like the identification of better catalysts, electronic materials, and drug discovery. However, the DFT formalism is limited by (a) its poor (quadratic-to-quartic) scaling, and (b) the need to perform repeated eigenvalue computations of the electronic Hamiltonian as part of its self-consistent field (SCF) iteration procedure to obtain the converged ground state electron density, ρ (r). Approaches that directly predict ρ (r) of a structure with high accuracy can accelerate conventional SCF calculations and can also be used in linearly scaling methods such as orbital-free DFT. To this end, we present a procedure to predict the ground state electron density of molecular and periodic three-dimensional systems directly from the atomic structure with a particular emphasis on physical interpretability. In our framework, ρ (r) is modeled using many-body correlation descriptors that accurately capture the effects of local atomic arrangements in the neighborhood of a grid point. Our use of a linear regression scheme to fit to charge density data enables transparent analysis of the relative contributions of various types of local atomic correlations. By systematically including increasingly complex correlations, our model is shown to accurately predict ρ (r) for a variety of chemically and electronically diverse systems — amorphous Ge, Al(001) slab, crystalline Ga 2 O 3 , molecular benzene, and polyethylene. We then demonstrate a symbolic regression-based protocol to construct easily computable, interpretable features from lower-order correlations that significantly improves our electron density predictions with effectively no increase in the computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Acceleration of Graph Neural Network-Based Prediction Models in Chemistry via Co-Design Optimization on Intelligence Processing Units

Atomic structure prediction and associated property calculations are the bedrock of chemical physics. Since high-fidelity ab initio modeling techniques for computing the structure and properties can be prohibitively expensive, this motivates the development of machine-learning (ML) models that make these predictions more efficiently. Training graph neural networks over large atomistic databases introduces unique computational challenges such as the need to process millions of small graphs with variable size and support communication patterns that are distinct from learning over large graphs such as social networks. We demonstrate a novel hardware-software co-design approach to scale up the training of atomistic graph neural networks (GNN) for structure and property prediction. First, to eliminate redundant computation and memory associated with alternative padding techniques and to improve throughput via minimizing communication, we formulate the effective coalescing of the batches of variable-size atomistic graphs as the bin packing problem and introduce a hardware-agnostic algorithm to pack these batches. In addition, we propose hardware-specific optimizations including a planner and vectorization for the gather-scatter operations targeted for Graphcore’s Intelligence Processing Unit (IPU), as well as model-specific optimizations such as merged communication collectives and optimized softplus. Putting these all together, we demonstrate the effectiveness of the proposed co-design approach by providing an implementation of a well-established atomistic GNN on the Graphcore IPUs. We evaluate the training performance on multiple atomistic graph databases with varying degrees of graph counts, sizes and sparsity. Here, we demonstrate that such a co-design approach can reduce the training time of atomistic GNNs and can improve the performance by up to 1.5× compared to the baseline implementation of the model on the IPUs. Additionally, we compare our IPU implementation with a Nvidia GPU-based implementation and show that our atomistic GNN implementation on the IPUs can run 1.8× faster on average compared to the execution time on the GPUs.

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

AI for Experimental Controls at Jefferson Lab

We report the AI for Experimental Controls project is developing an AI system to control and calibrate detector systems located at Jefferson Laboratory. Currently, calibrations are performed offline and require significant time and attention from experts. This work would reduce the amount of data and the amount of time spent calibrating in an offline setting. The first use case involves the Central Drift Chamber (CDC) located inside the GlueX spectrometer in Hall D. We use a combination of environmental and experimental data, such as atmospheric pressure, gas temperature, and the flux of incident particles as inputs to a sequential Neural Network (NN) to recommend a high voltage setting and the corresponding calibration constants in order to maintain consistent gain and optimal resolution throughout the experiment. Utilizing AI in this manner represents an initial shift from offline calibration towards near real time calibrations performed at Jefferson Laboratory.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Constraining $\mathcal{f(R)}$ gravity with a $\mathcal{k}$-cut cosmic shear analysis of the Hyper Suprime-Cam first-year data

Here, using Subaru Hyper Suprime-Cam (HSC) year 1 data, we perform the first k-cut cosmic shear analysis constraining both Λ CDM and f(R) Hu-Sawicki modified gravity. To generate the f(R) cosmic shear theory vector, we use the matter power spectrum emulator trained on COLA (COmoving Lagrangian Acceleration) simulations [Phys. Rev. D 103, 123525 (2021)]. The k-cut method is used to significantly down-weight sensitivity to small scale (k > 1h Mpc -1 ) modes in the matter power spectrum where the emulator is less accurate, while simultaneously ensuring our results are robust to baryonic feedback model uncertainty. We have also developed a test to ensure that the effects of poorly modeled small scales are nulled as intended. For Λ CDM we find S 8 =σ 8 (Ω m /0.3) 0.5 =0.789$^{+0.039}_{-0.022}$, while the constraints on the f(R) modified gravity parameters are prior dominated. In the future, the k-cut method could be used to constrain a large number of theories of gravity where computational limitations make it infeasible to model the matter power spectrum down to extremely small scales.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Experimental and Computational Study of a High-Speed Collision of an Aluminum Striker with a Solid and Mesh Obstacle

The results of computational and experimental studies of peculiarities of the process of impact between the striker and obstacle, which imitates shield protection of spacecrafts, have been considered and pictures of fragmentation of the striker and obstacle have been obtained. The numerical calculations were carried out using the method of smooth particle hydrodynamics (SPH). In the experiments, the striker was accelerated using a two-stage light-gas gun; the state of the obstacle and striker at the moment of their interaction was controlled using an X-ray and high-speed video camera. The recording equipment was switched on using induction cross sections. The comparative analysis of the results of numerical simulations and experiments have been considered.

42 ENGINEERING↗
DOE OSTI2021

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Robust Containment Queries over Collections of Trimmed NURBS Surfaces via Generalized Winding Numbers

Here, we propose a containment query that is robust to the watertightness of regions bound by trimmed NURBS surfaces, as this property is difficult to guarantee for in-the-wild CAD models. Containment is determined through the generalized winding number (GWN), a mathematical construction that is indifferent to the arrangement of surfaces in the shape. Applying contemporary techniques for the 3D GWN to trimmed NURBS surfaces requires some form of geometric discretization, introducing computational inefficiency to the algorithm and even risking containment misclassifications near the surface. In contrast, our proposed method leverages properties of the 3D solid angle to solve the relevant surface integral using a boundary formulation with rapidly converging adaptive quadrature. Batches of queries are further accelerated by memoizing (i.e., caching and reusing) quadrature node positions and tangents as they are evaluated. We demonstrate that our GWN method is robust to complex trimming geometry in a CAD model, and is accurate up to arbitrary precision at arbitrary distances from the surface. The derived containment query is therefore robust to model non-watertightness while respecting all curved features of the input shape.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

QMCPACK

QMCPACK is an open source C++ code that runs across multiple high performance computing architectures including accelerators. It's main function is to implement several Quantum Monte Carlo method for solving the many-body Schrodinger equation.

Lopez, MatthewG↗
DOE OSTI2019

Data from Development of a CRISPR/Cas9 System for High-Efficiency Multiplexed Gene Deletion in Rhodosporidium toruloides

The oleaginous yeast Rhodosporidium toruloides is considered a promising candidate for production of chemicals and biofuels thanks to its ability to grow on lignocellulosic biomass, and its high production of lipids and carotenoids. However, efforts to engineer this organism are hindered by a lack of suitable genetic tools. Here we report the development of a CRISPR/Cas9 system for genome editing in R. toruloides based on a fusion 5S rRNA–tRNA promoter for guide RNA (gRNA) expression, capable of greater than 95% gene knockout for various genetic targets. Additionally, multiplexed double‐gene knockout mutants were obtained using this method with an efficiency of 78%. This tool can be used to accelerate future metabolic engineering work in this yeast.

Conversion↗
DOE OSTI2022

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗