SEARCH · Engineering Papers

Results for “Computational demand”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Defining quantum-ready primitives for hybrid HPC-QC supercomputing: a case study in Hamiltonian simulation

As computational demands in scientific applications continue to rise, hybrid high-performance computing (HPC) systems integrating classical and quantum computers (HPC-QC) are emerging as a promising approach to tackling complex computational challenges. One critical area of application is Hamiltonian simulation, a fundamental task in quantum physics and other large-scale scientific domains. This paper investigates strategies for quantum-classical integration to enhance Hamiltonian simulation within hybrid supercomputing environments. By analyzing computational primitives in HPC allocations dedicated to these tasks, we identify key components in Hamiltonian simulation workflows that stand to benefit from quantum acceleration. To this end, we systematically break down the Hamiltonian simulation process into discrete computational phases, highlighting specific primitives that could be effectively offloaded to quantum processors for improved efficiency. Our empirical findings provide insights into system integration, potential offloading techniques, and the challenges of achieving seamless quantum-classical interoperability. We assess the feasibility of quantum-ready primitives within HPC workflows and discuss key barriers such as synchronization, data transfer latency, and algorithmic adaptability. These results contribute to the ongoing development of optimized hybrid solutions, advancing the role of quantum-enhanced computing in scientific research.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Antenna analysis using neural networks

Conventional computing schemes have long been used to analyze problems in electromagnetics (EM). The vast majority of EM applications require computationally intensive algorithms involving numerical integration and solutions to large systems of equations. The feasibility of using neural network computing algorithms for antenna analysis is investigated. The ultimate goal is to use a trained neural network algorithm to reduce the computational demands of existing reflector surface error compensation techniques. Neural networks are computational algorithms based on neurobiological systems. Neural nets consist of massively parallel interconnected nonlinear computational elements. They are often employed in pattern recognition and image processing problems. Recently, neural network analysis has been applied in the electromagnetics area for the design of frequency selective surfaces and beam forming networks. The backpropagation training algorithm was employed to simulate classical antenna array synthesis techniques. The Woodward-Lawson (W-L) and Dolph-Chebyshev (D-C) array pattern synthesis techniques were used to train the neural network. The inputs to the network were samples of the desired synthesis pattern. The outputs are the array element excitations required to synthesize the desired pattern. Once trained, the network is used to simulate the W-L or D-C techniques. Various sector patterns and cosecant-type patterns (27 total) generated using W-L synthesis were used to train the network. Desired pattern samples were then fed to the neural network. The outputs of the network were the simulated W-L excitations. A 20 element linear array was used. There were 41 input pattern samples with 40 output excitations (20 real parts, 20 imaginary). A comparison between the simulated and actual W-L techniques is shown for a triangular-shaped pattern. Dolph-Chebyshev is a different class of synthesis technique in that D-C is used for side lobe control as opposed to pattern shaping. The interesting thing about D-C synthesis is that the side lobes have the same amplitude. Five-element arrays were used. Again, 41 pattern samples were used for the input. Nine actual D-C patterns ranging from -10 dB to -30 dB side lobe levels were used to train the network. A comparison between simulated and actual D-C techniques for a pattern with -22 dB side lobe level is shown. The goal for this research was to evaluate the performance of neural network computing with antennas. Future applications will employ the backpropagation training algorithm to drastically reduce the computational complexity involved in performing EM compensation for surface errors in large space reflector antennas.

Smith, William T.↗

DOE OSTI2022

Ion Coulomb Crystals in Storage Rings for Quantum Information Science

Quantum information science is a growing field that promises to take computing into a new age of higher performance and larger scale computing as well as being capable of solving problems classical computers are incapable of solving. The outstanding issue in practical quantum computing today is scaling up the system while maintaining interconnectivity of the qubits and low error rates in qubit operations to be able to implement error correction and fault-tolerant operations. Trapped ion qubits offer long coherence times that allow error correction. However, error correction algorithms require large numbers of qubits to work properly. We can potentially create many thousands (or more) of qubits with long coherence states in a storage ring. For example, a circular radio-frequency quadrupole, which acts as a large circular ion trap and could enable larger scale quantum computing. Such a Storage Ring Quantum Computer (SRQC) would be a scalable and fault tolerant quantum information system, composed of qubits with very long coherence lifetimes. With computing demands potentially outpacing the supply of high-performance systems, quantum computing could bring innovation and scientific advances to particle physics and other DOE supported programs. Increased support of R$\&$D in large scale ion trap quantum computers would allow the timely exploration of this exciting new scalable quantum computer. The R$\&$D program could start immediately at existing facilities and would include the design and construction of a prototype SRQC. We invite feedback from and collaboration with the particle physics and quantum information science communities.

43 PARTICLE ACCELERATORS↗

DOE OSTI2025

Position Papers for Inverse Methods for Complex Systems under Uncertainty Workshop

The ability to solve inverse problems – inferring unknown parameters, structures, or states of a system from observed data – is essential for advancing scientific discovery and innovation capabilities for the DOE mission. Basic research needs and challenges are particularly acute in emerging areas such as the interactive, data-driven, modeling and simulation of digital twins; decision support for experiments at DOE scientific user facilities; and for other complex systems and workflows. Inverse problems are at the heart of understanding and controlling complex systems due to factors such as observational data with varying modalities and fidelities, inherent uncertainties in physical measurements and numerical models, and the computational demands of rapid and high-fidelity simulations. The convergence of recent scientific computing trends – scientific machine learning, artificial intelligence, and computing advances such as exascale computing – is creating unprecedented opportunities. These advancements offer the potential to revolutionize how we approach inverse problems to extract actionable insights with the required level of accuracy and computational efficiency. This workshop and the Call for Position Papers are vital steps in bringing together experts to collectively explore and identify the new computational and mathematical directions needed in inverse methods for complex systems under uncertainty.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

DOE OSTI2026

Ensemble Kalman filter for data assimilation coupled with low-resolution computations techniques applied in fluid dynamics

This paper presents an innovative Reduced-order model (ROM) for merging experimental and simulation data using data assimilation (DA) to estimate the "True" state of a fluid dynamics system, leading to more accurate predictions. Our methodology introduces a novel approach by implementing the ensemble Kalman filter (EnKF) within a reduced-dimensional framework, grounded in a robust theoretical foundation and applied to fluid dynamics. To address the substantial computational demands of DA, the proposed ROM employs low-resolution (LR) techniques to drastically reduce computational costs. This innovative approach involves downsampling datasets for DA computations, followed by an advanced reconstruction technique based on low-cost singular value decomposition (lcSVD). The lcSVD method, a key innovation in this paper, has never been applied to DA before and offers a highly efficient way to enhance resolution with minimal computational resources. Our results demonstrate significant reductions in both computation time and RAM usage through these LR techniques without compromising the accuracy of the estimations. For instance, in a turbulent test case, for a data compression rate of 15.9, the LR approach can achieve a speed-up of 13.7 and a RAM compression of 90.9% while maintaining a low relative root mean square error (RRMSE) of 2.6%, compared to 0.8% in the high-resolution (HR) reference. Furthermore, we highlight the effectiveness of the EnKF in estimating and predicting the state of fluid flow systems based on limited observations and given low-fidelity numerical data. This paper highlights the potential of the proposed DA method in fluid dynamics applications, particularly for improving computational efficiency in CFD and related fields. Its ability to balance accuracy with low computational and memory costs makes it especially suitable for large-scale and real-time applications, such as environmental monitoring or engineering design. This method will be incorporated into ModelFLOWs-app.

Data Assimilation↗

DOE OSTI2026

Machine Learning Interatomic Potentials for Modeling Framework Flexibility and Water Uptake in NbOFFIVE-1-Ni Metal–Organic Framework

Metal–organic frameworks (MOFs), with their distinctive porous structures and tunable chemical properties, have shown immense promise in the separation and storage of gases. Currently, the accurate simulation of their adsorptive properties remains challenging, especially for systems where the molecules fit very tightly into the pores. Traditional simulation methods often approximate the frameworks as rigid and do not account for the framework flexibility seen in materials such as NbOFFIVE-1-Ni. First-principles molecular dynamics (FPMD) simulations offer the desired accuracy in modeling this flexibility but are limited by their extensive computational demands, rendering them impractical for long simulations. Conversely, classical force field-based simulations offer computational efficiency but lack the necessary accuracy. Here, to break this accuracy-efficiency trade-off, we have developed machine learning interatomic potentials trained on energies and forces from FPMD to model the framework flexibility of NbOFFIVE-1-Ni in the presence of water over nanosecond time scales. Furthermore, by integrating MLIP-driven molecular dynamics (MLIP-MD) with grand canonical Monte Carlo (GCMC) simulations, we further incorporated framework flexibility into adsorption predictions, yielding water adsorption isotherms that better align with experimental data compared to those of conventional GCMC simulations. These advances offer new opportunities for the design and optimization of MOFs in gas storage and separation applications.

adsorption↗

DOE OSTI2025

Data-driven equation-free dynamics applied to many-protein complexes: The microtubule tip relaxation

Microtubules (MTs) constitute the largest components of the eukaryotic cytoskeleton and play crucial roles in various cellular processes, including mitosis and intracellular transport. The property allowing MTs to cater to such diverse roles is attributed to dynamic instability, which is coupled to the hydrolysis of GTP (guanosine-5'-triphosphate) to GDP (guanosine-5'-diphosphate) within the β-tubulin monomers. Understanding the equilibrium dynamics and the structural features of both GDP- and GTP-complexed MT tips, especially at an all-atom level, remains challenging for both experimental and computational methods because of their dynamic nature and the prohibitive computational demands of simulating large, many-protein systems. This study employs the “equation-free” multiscale computational method to accelerate the relaxation of all-atom simulations of MT tips toward their putative equilibrium conformation. Using large MT lattice systems (14 protofilaments × 8 heterodimers) comprising ~21-38 million atoms, we applied this multiscale approach to leapfrog through time and nearly double the computational efficiency in realizing relaxed all-atom conformations of GDP- and GTP-complexed MT tips. Commencing from an initial 4 μs unbiased all-atom simulation, we interleave coarse projective “equation-free” jumps with short bursts of all-atom molecular dynamics simulation to realize an additional effective simulation time of 1.875 μs. Our 5.875 μs of effective simulation trajectories for each system expose the subtle yet essential differences in the structures of MT tips as a function of whether β-tubulin monomer is complexed with GDP or GTP, as well as the lateral interactions within the MT tip, offering a refined understanding of features underlying MT dynamic instability. Furthermore, the approach presents a robust and generalizable framework for future explorations of large biomolecular systems at atomic resolution.

Wu, Jiangbo [University of Chicago, IL (United Sta↗

NASA NTRS2008

Electron Impact Ionization: A New Parameterization for 100 eV to 1 MeV Electrons

Low, medium and high energy electrons can penetrate to the thermosphere (90-400 km; 55-240 miles) and mesosphere (50-90 km; 30-55 miles). These precipitating electrons ionize that region of the atmosphere, creating positively charged atoms and molecules and knocking off other negatively charged electrons. The precipitating electrons also create nitrogen-containing compounds along with other constituents. Since the electron precipitation amounts change within minutes, it is necessary to have a rapid method of computing the ionization and production of nitrogen-containing compounds for inclusion in computationally-demanding global models. A new methodology has been developed, which has parameterized a more detailed model computation of the ionizing impact of precipitating electrons over the very large range of 100 eV up to 1,000,000 eV. This new parameterization method is more accurate than a previous parameterization scheme, when compared with the more detailed model computation. Global models at the National Center for Atmospheric Research will use this new parameterization method in the near future.

Fang, Xiaohua↗

DOE OSTI2025

Dependent scattering and fractal microstructure determine the transparency of aerogel monoliths

This study reveals how dependent scattering and microstructure significantly affect electromagnetic wave propagation through aerogel monoliths, contributing to their transparency. Light scattering by particle ensembles is considered “dependent” when the scattering properties rely not only on particle size and optical constants but also on their spatial distribution, typically occurring when the average interparticle distance is small in comparison with the wavelength of incident radiation. Addressing dependent scattering requires solving Maxwell’s equations for complex heterogeneous structures, which is computationally demanding and usually limited to sample thicknesses on the same scale as the wavelength. This study combines computer-generated ambigel microstructures of fractal aggregates of polydisperse nanoparticles and the radiative transfer with reciprocal transaction method to predict the transmittance of thick ambigel slabs. Transmittance measurements of ambiently dried aerogel monoliths (ambigels) with porosities from about 50% to 90% closely matched the predicted values for their digital twins. However, ignoring dependent scattering or particle aggregation led to inaccurate predictions. This study validated the computational framework, and its findings offer insights for designing photonic metamaterials and analyzing their interactions with electromagnetic waves.

Yalcin, Refet A. (ORCID:0000000339973494)↗

DOE OSTI2023

Green Computing Opportunities & Strategy

Computation is critical to emerging fields of data intensive research, enabling new methodologies, approaches and tools. As the rate of hardware efficiency gains slows, computational time and energy costs increase. To match pace with computation demand, new approaches are needed to keep the opportunity for impact open. Charles Tripp, lead of the Green Computing Catalyzer, discusses research efforts to improve software efficiency to enable faster, less energy-intensive computing.

algorithmic efficiency↗

DOE OSTI2024

Exploring code portability solutions for HEP with a particle tracking test code

Traditionally, high energy physics (HEP) experiments have relied on x86 CPUs for the majority of their significant computing needs. As the field looks ahead to the next generation of experiments such as DUNE and the High-Luminosity LHC, the computing demands are expected to increase dramatically. To cope with this increase, it will be necessary to take advantage of all available computing resources, including GPUs from different vendors. A broad landscape of code portability tools—including compiler pragma-based approaches, abstraction libraries, and other tools—allow the same source code to run efficiently on multiple architectures. In this paper, we use a test code taken from a HEP tracking algorithm to compare the performance and experience of implementing different portability solutions. While in several cases portable implementations perform close to the reference code version, we find that the performance varies significantly depending on the details of the implementation. Achieving optimal performance is not easy, even for relatively simple applications such as the test codes considered in this work. Several factors can affect the performance, such as the choice of the memory layout, the memory pinning strategy, and the compiler used. The compilers and tools are being actively developed, so future developments may be critical for their deployment in HEP experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1998

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and weighted links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Weights are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗

NASA NTRS1996

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and directed links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Reliability values are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗

DOE OSTI2020

INTEGRATED WORKFLOW MANAGEMENT FOR PARTICLE ACCELERATOR SIMULATION

Supercomputing systems are used for a wide range of computationally demanding tasks in many fields of science and engineering. They play a key role in numerical simulation, in which mathematical models are computed in order to simulate the behavior of physical systems. Scientists and engineers that use supercomputers for numerical simulation often have their productivity limited by the need to manually organize and manage extremely large amounts of data that are often produced and consumed by the software programs run on these systems. Recognizing these limitations, Kitware Inc. (Clifton Park, NY) and SLAC National Accelerator Laboratory (Menlo Park, CA) are developing an advanced software platform that can reduce the cognitive overhead required by knowledge workers when using supercomputers for numerical simulation. Phase I of the project is complete and includes the development of new capabilities for organizing simulation project files, improvements to the user interface and overall usability, and deployment of a “middle tier” server to sit between user desktop machines and supercomputers to offload much of the data management workload. The project also developed prototype software for executing sequences of numerical simulations, and a prototype for migrating supercomputing software to cloud-based computing systems to provide a potential alternative to supercomputers with different logistical and price-to-performance tradeoffs.

Tourtellott, John↗

DOE OSTI2024

Upscaling Methods Applied to a Fine-Scale Reservoir Model

This study was conducted as part of the Southwest Regional Partnership on Carbon Sequestration (SWP) project to evaluate how upscaling fine-scale simulation models to coarse-scale simulation models impacted the results. The focus was on the Farnsworth Unit (FWU) and its Morrow' B' Sandstone reservoir, specifically the west half of the field. Due to data limitations and the geologic characteristics of the surrounding area, the upscaling was limited to the west half of the FWU rather than a broader basinscale model. The primary aim was to explore how upscaling impacts numerical simulation models, particularly regarding CO 2 -enhanced oil recovery (EOR) and storage capacity predictions. Upscaling was necessary to reduce computational demands when transitioning from high-resolution geological models to coarser grids, as large-scale simulations with finer grids can be computationally prohibitive. This study expands on previous work by the SWP to understand how additional upscaling, applied to already fine-scale numerical simulation models, affects reservoir performance simulations (Ampomah, Balch, & Grigg, 2015). This is key to understanding how loss of resolution can affect coarsescale model results that may be used for large sensitivity analyses, uncertainty quantifications, and training data for machine learning applications.

02 PETROLEUM↗

DOE OSTI2021

Trinity by the Numbers: The Computing Effort that Made Trinity Possible

Utilizing rarely used source materials and identifying points of bias among more commonly used sources, this critical review provides a more complete representation of wartime Los Alamos computing operations and personnel, including the Laboratory’s typically underrepresented human computers and how they contributed to the success of the Trinity test. This paper also identifies how the Laboratory’s unusual wartime computing demands served as a formative experience among many Los Alamos personnel and consultants who contributed significantly to the development and use of mechanized computing at and beyond Los Alamos after the war.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRSDate not supplied

Advanced Materials for the Lunar Surface: Multiscale Computational Design of Refractory Alloys and Carbides

Emerging operational environments, such as the lunar surface, present novel challenges for NASA and drive the need for advanced materials in applications like fission surface power systems. To address these demands, computational materials science is rapidly evolving to augment or replace costly and hazardous empirical testing. Although materials selection at NASA remains predominantly experimentally driven, advanced simulation methodologies are being steadily integrated into the engineering lifecycle. This work details the application of multiscale simulation techniques—including first-principles calculations, CALPHAD, dislocation dynamics, and molecular dynamics—at NASA's Ames Research Center to evaluate advanced materials for extreme environments. First, we present contributions to the Space Nuclear Propulsion Project. Be-cause propellant channel coatings in nuclear thermal rockets must withstand high-pressure, high-temperature hydro-gen, optimizing these materials is critical. First-principles calculations were employed to establish a rigorous quantitative and qualitative understanding of the behavior of the refractory carbides ZrC, NbC, and their mixtures in high-enthalpy hydrogen environments. This necessitated the generation of high-fidelity thermodynamic models for both stoichiometric and carbon-depleted carbides, both with and without the presence of hydrogen. Furthermore, we highlight efforts under the Refractory Alloy Additive Manufacturing Build Optimization (RAAMBO) project, where existing and novel alloy compositions were assessed for additive manufacturing printability and subsequent performance in applications such as heat pipes and rocket nozzle extensions. This was accomplished through a comprehensive multiscale simulation framework that bridged the gap from the nanometer to the millimeter scale. Across both initiatives, rigorous validation against empirical data was prioritized. By systematically employing a verified and validated computational frame-work, we demonstrate how simulation effectively supports multidisciplinary engineering efforts, builds project-wide confidence, and drives critical materials development.

computational materials↗