Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Real-Time Time-Dependent Nuclear–Electronic Orbital Approach: Dynamics beyond the Born–Oppenheimer Approximation

The quantum mechanical treatment of both electrons and nuclei is crucial in nona- diabatic dynamical processes such as proton-coupled electron transfer. The nuclear electronic orbital (NEO) method provides an elegant framework for including nuclear quantum effects beyond the Born-Oppenheimer approximation. To enable the study of nonequilibrium properties, we derive and implement a real-time NEO (RT-NEO) approach based on time-dependent Hatree-Fock or density functional theory, in which both the electronic and nuclear degrees of freedom are propagated in a time-dependent variational framework. Nuclear and electronic spectral features can be resolved from the time-dependent dipole moment computed using the RT-NEO method. The test cases demonstrate the dynamical interplay between the quantum nuclei and the electrons through vibronic coupling. Moreover, vibrational excitation in the RT-NEO approach is demonstrated by applying a resonant driving eld, and electronic excitation is demonstrated by simulating excited state intramolecular proton transfer. This work shows that the RT-NEO approach is a promising tool to study nonadiabatic quantum dynamical processes within a time-dependent variational description for the coupled electronic and nuclear degrees of freedom.

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

Hamiltonian Simulation [Slides]

Given a (qubit) quantum system modeled by a Hamiltonian H, use a quantum computer to obtain time-evolved properties of the system. One way of solving this problem is by actually preparing the evolved quantum state (in some encoded fashion). The goal is to provide a sequence of elementary 1 and 2-qubit gates that would prepare such a state.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction

Quantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically use a binary system, where each qubit exists in a superposition of the 0 and 1 states. Furthermore, it is often possible to access the 2 or even 3 states in the same physical unit by manipulating the system in different ways. In this work, we consider automatically encoding two qubits into one four-state ququart via a compression scheme. We use quantum optimal control to design efficient proof-of-concept gates that fully replicate standard qubit computation on these encoded qubits.

compilation↗
DOE OSTI2025

CRCNS22 Learning Rules in the Hippocampus and their Mapping to Neuromorphic Systems (Final Technical Report)

Large scale biologically-realistic computational models are key to investigating the interplay between structure and function in nervous systems, thus paving the way to new clinical methods and neuro-inspired computing solutions. This project focuses on the hippocampus, in particular the CA3-CA1 regions, due to their role in associative learning and memory, pattern separation and completion, and spatial navigation. Investigations into the neuronal organization and learning rule(s) of this circuit can shed light into how declarative memories are formed, stored, recalled and forgotten and inform computational, experimental and clinical neuroscience work. Our project aims at developing a novel data-driven methodology supported by a broad heterogeneous base of neuroscience experimental knowledge and inspired from advances in computer science and engineering. Specifically, this work will benchmark existing and new learning rules within a full-scale spiking neural network simulation of the CA3-CA1 region. The model will be based on an open-source repository, called the Hippocampome, which contains neuronal morphologies, firing patterns, synapse probabilities, and most other required parameters for all known neuron types in the rodent hippocampal formation. The model will be first trained in a supervised fashion for associative memory tasks using backpropagation through time traditionally used in computer science, enhanced with a new technique called the surrogate gradient method. This optimization method will be used to obtain a global loss minimization, but it is not biologically inspired as it assumes the use of data not locally available to the synapses. However, we propose its use as a benchmarking tool, to compare the training performance of local biologically plausible and hardware-mappable learning rules at scale. New rules or combinations will be proposed and tested as needed, based on the obtained results. Progress in this area will also drive the development of novel hardware-mappable algorithms for continual lifelong learning and categorization of new events from few presented examples. This project goes beyond the existing state-of-the-art by looking at large scale realistic neuronal circuits as networks trainable via global optimization methods such as surrogate gradient descent. The objective function of the brain that supports learning is largely unknown, but it is likely that it operates through local learning rules. Studying network trajectories around local minima as proposed in this work represents a useful strategy for understanding whether a network is training by using a specific (set of) learning rule(s). Starting from a completely untrained network is a challenging test since it is difficult to determine how the learning rule affects the trajectory of the network. This interdisciplinary project will help understand what rule governs learning in these regions or if multiple learning rules are involved. The work will develop a robust methodology to measure if the network is converging to the target solution, oscillating around it, or diverging away.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Real-time sparse-sampled Ptychographic imaging through deep neural networks

Ptychography has rapidly grown in the fields of X-ray and electron imaging for its unprecedented ability to achieve nano or atomic scale resolution while simultaneously retrieving chemical or magnetic information from a sample. A ptychographic reconstruction is achieved by means of solving a complex inverse problem that imposes constraints both on the acquisition and on the analysis of the data, which typically precludes real-time imaging due to computational cost involved in solving this inverse problem. In this work we propose PtychoNN, a novel approach to solve the ptychography reconstruction problem based on deep convolutional neural networks. We demonstrate how the proposed method can be used to predict real-space structure and phase at each scan point solely from the corresponding far-field diffraction data. The presented results demonstrate how PtychoNN can effectively be used on experimental data, being able to generate high quality reconstructions of a sample up to hundreds of times faster than state-of-the-art ptychography reconstruction solutions once trained. By surpassing the typical constraints of iterative model-based methods, we can significantly relax the data acquisition sampling conditions and produce equally satisfactory reconstructions. Besides drastically accelerating acquisition and analysis, this capability can enable new imaging scenarios that were not possible before, in cases of dose sensitive, dynamic and extremely voluminous samples.

Cherukara, Mathew J↗
DOE OSTI2022

Using dynamic mode decomposition to predict the dynamics of a two-time non-equilibrium Green’s function

Computing the numerical solution of the Kadanoff–Baym equations, a set of nonlinear integral differential equations satisfied by the two-time Green's functions derived from many-body perturbation theory for a quantum many-body system away from equilibrium, is a challenging task. Recently, we have successfully applied dynamic mode decomposition (DMD) to construct a data driven reduced order model that can be used to extrapolate the time-diagonal of a two-time Green's function from numerical solutions of the KBE within a small time window. In this paper, we extend the previous work and use DMD to predict off-diagonal elements of the two-time Green's function. We partition the two-time Green's function into a number of one-time functions along the diagonal and subdiagonals of the two-time window as well as in horizontal and vertical directions. We use DMD to construct separate reduced order models to predict the dynamics of these one-time functions in a two-step procedure. We extrapolate along diagonal and several subdiagonals within a subdiagonal band of a two-time window in the first step. In the second step, we use DMD to extrapolate the Green's function outside of the sub-diagonal band. In conclusion, we demonstrate the efficiency and accuracy of this approach by applying it to a two-band Hubbard model problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

GPU-Accelerated Machine Learning Inference as a Service for Computing in Neutrino Experiments

Machine learning algorithms are becoming increasingly prevalent and performant in the reconstruction of events in accelerator-based neutrino experiments. These sophisticated algorithms can be computationally expensive. At the same time, the data volumes of such experiments are rapidly increasing. The demand to process billions of neutrino events with many machine learning algorithm inferences creates a computing challenge. We explore a computing model in which heterogeneous computing with GPU coprocessors is made available as a web service. The coprocessors can be efficiently and elastically deployed to provide the right amount of computing for a given processing task. With our approach, Services for Optimized Network Inference on Coprocessors (SONIC), we integrate GPU acceleration specifically for the ProtoDUNE-SP reconstruction chain without disrupting the native computing workflow. With our integrated framework, we accelerate the most time-consuming task, track and particle shower hit identification, by a factor of 17. This results in a factor of 2.7 reduction in the total processing time when compared with CPU-only production. For this particular task, only 1 GPU is required for every 68 CPU threads, providing a cost-effective solution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Race conditions and data partitioning: risks posed by common errors to reproducible parallel simulations

When parallel algorithms for simulation were introduced in the 1970s, their development and use interested only experts in parallel computation. This circumstance changed as multi-core processors became commonplace, putting a parallel computer into the hands of every modeler. A natural outcome is growing interest in parallel simulation among persons not intimately familiar with parallel computing. At the same time, parallel simulation tools continue to be developed with the implicit assumption that the modeler is knowledgeable about parallel programming. The unintended consequence is a rapidly growing number of users of parallel simulation tools that are unlikely to recognize when the interaction of race conditions, partitioning strategies, and simultaneous action in their simulation models make results non-reproducible, thereby calling into question the validity of conclusions drawn from the simulation data. Here, we illustrate the potential dangers of exposing parallel algorithms to users who are not experts in parallel computation with example models constructed using existing parallel simulation tools. By doing so, we hope to refocus tool developers on usability, even if this new focus incurs loss of some performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Toward real-time optimization through model reduction and model discrepancy sensitivities

Optimization problems arise in a range of scenarios, from optimal control to model parameter estimation. In many applications, such as the development of digital twins, it is essential to solve these optimization problems within wall-clock-time limitations. However, this is often unattainable for complex systems, such as those modeled by nonlinear partial differential equations. One strategy for mitigating this issue is to construct a reduced-order model (ROM) that enables more rapid optimization. In particular, the use of nonintrusive ROMs—those that do not require access to the full-order model at evaluation time—is popular because they facilitate the computation of optimization solutions within the wall-clock time requirements. However, the optimization solution will be unreliable if the iterates move outside the ROM training data. This article proposes the use of hyper-differential sensitivity analysis with respect to model discrepancy (HDSA-MD) as a computationally efficient tool to augment ROM-constrained optimization and improve its reliability. The proposed approach consists of two phases: (i) an offline phase where several full-order model evaluations are computed to train the ROM, and (ii) an online phase where a ROM-constrained optimization problem is solved, a limited number of full-order model evaluations are computed, and HDSA-MD is used to enhance the optimization solution. Numerical results are demonstrated for two examples, atmospheric contaminant control and wildfire ignition location estimation, in which a ROM is trained offline using inaccurate atmospheric data. In conclusion, the HDSA-MD update yields a significant improvement in the ROM-constrained optimization solution using only one full-order model evaluation online with corrected atmospheric data.

PDE-constrained optimization↗
DOE OSTI2024

Addressing the data and real-time challenges in large scale particle physics experiments through AI and in situ computing technologies

Modern high energy physics experiments are faced not only with the challenge of having to deal with extremely high data rates but with the need to process data quickly to meet real time constraints. At Fermilab, we explore the use of novel computing technologies and techniques to address these challenges. I will discuss my R&D efforts in applying such computing solutions to enhance the multi-messenger astronomy capabilities and improve the overall physics performance of large-scale LArTPC based neutrino experiments. These efforts offer excellent opportunities for fruitful collaboration.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Optimal Operation of a Hybrid Hydraulic Electric Architecture (HHEA) for Off-Road Vehicles Over Discrete Operating Decisions

Many off-highway machines including construction and agriculture equipment use hydraulics for power transmission and throttling as a means for control. Trends towards better efficiency and electrification have led to the creation of a novel Hybrid Hydraulic-Electric Architecture (HHEA) which could significantly reduce energy consumption and maintain control performance, even in machines that are too large to be directly electrified. This is achieved by using a set of common pressure rails to transmit the majority of power via power dense hydraulics and modulating the power with small electric motor-drives to achieve precise control. This paper proposes a computationally efficient method for computing the optimal sequence of pressure rail selections for the HHEA over finite drive cycles. This is useful for fairly comparing the novel architecture’s energy performance to existing architectures and for use in iterative optimal design of the architecture. The optimal control technique makes use of a static model of the architecture and losses. Constraints are enforced such that the drive cycle is repeatable. The constrained optimal operation is solved using a Lagrange multiplier technique that transforms the optimization into a small set of sub-problems by considering combinations of active constraints. Each of these sub-problems can be solved efficiently because loss calculations for all time steps can be computed in parallel. A case study of an off-road construction machine demon-strates that the HHEA reduces energy consumption by 2/3 compared to the baseline load sensing architecture.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Reference Site Condition Datasets for Floating Wind Arrays in the United States

Floating offshore wind farm design is highly site-specific, requiring detailed information about the specific conditions of a project area for realistic design studies. Unfortunately, publicly available site condition data for potential floating offshore wind project sites in the United States is scarce. To support U.S. offshore wind research, we developed reference site condition datasets, including metocean and seabed information, for four potential floating wind project areas in the U.S.: Humboldt Bay, Morro Bay, the Gulf of Maine, and the Gulf of Mexico. These datasets were compiled using publicly available data. Our metocean analysis, covering wind, waves, and surface currents, utilized measurement data from 2000 to 2020. Sources included the National Renewable Energy Laboratory’s National Offshore Wind Dataset for wind data, National Data Buoy Center buoys for wave data, and the High Frequency Radar Network for surface currents. These data were integrated into hourly time series used to compute extreme return periods up to 500 years, monthly statistics, and joint probability clusters for fatigue analysis. Soil conditions were evaluated using the usSEABED database and bathymetry grids were interpolated from the NCEI Digital Elevation Model Global Mosaic. Further information on the datasets and how they were created can be found in: Biglu, M., M. Hall, E. Lozon, S. Housner. 2024. Reference Site Conditions for Floating Wind Arrays in the United States. Golden, CO: National Renewable Energy Laboratory (NREL). NREL/TP-5000-89897. The data are also available at: https://github.com/FloatingArrayDesign/SiteConditions The content of each dataset is as follows: _NOW23_wind.txt: Hourly NOW-23 wind data up to a height of 400 meter. _metocean_1hr.txt: Hourly time series including wind, wave, surface current and temperature data. _Summary.xlsx: Metocean data, including extreme values, joint probability distributions and monthly statistics. _usSEABED_soil.csv: Extract of the usSEABED database for this specific site. _bathymetry_200m.txt (and 500m, 1000m): Gridded seabed depth data.

16 TIDAL AND WAVE POWER↗
DOE OSTI2025

Cost of emulating a small quantum annealing problem in the circuit model

Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.

Quantum algorithms & computation↗
DOE OSTI2021

Local time stepping for the shallow water equations in MPAS

In this work we assess the performance of a set of local time-stepping (LTS) schemes for the shallow water equations implemented in the Model for Prediction Across Scales (MPAS). The goal of LTS is to speed up the simulation by allowing different time-steps on different regions of the computational grid. The LTS schemes considered here were originally introduced by Hoang et al. (2019) [26], who laid out the mathematical foundation of the methods. Here, the authors take on the task of presenting a fast, efficient and scalable parallel implementation of these LTS methods on high performance computing machines, with the aim to provide a recipe for other climate modeling groups that may be interested in employing LTS algorithms in their codes. As a matter of fact, even if MPAS is our framework of choice, our approach is general enough and could be of interest to other groups beyond the MPAS community. Due to their nature, LTS methods possess an inherent load imbalance that needs to be carefully addressed in order to obtain efficient scalability. Even more important is the far from trivial task of computing the right-hand side terms only on specific LTS regions during the time-stepping procedure. An inefficient handling of this task causes a drastic decay of the CPU time performance, making the LTS algorithms practically of no use. The emphasis of the present work is therefore on the computational and parallel aspects of the LTS methods, whose proper treatment is crucial to make the methods run faster against existing strategies, such as for instance high-order explicit global time-stepping schemes. This is in fact the ultimate goal of using an LTS procedure and it is the one to which we direct all our optimization efforts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Performance of explicit and IMEX MRI multirate methods on complex reactive flow problems within modern parallel adaptive structured grid frameworks

Large-scale multiphysics simulations are computationally challenging due to the coupling of multiple processes with widely disparate time scales. The advent of exascale computing systems exacerbates these challenges since these systems enable ever-increasing size and complexity. In recent years, there has been renewed interest in developing multirate methods as a means to handle the large range of time scales, as these methods may afford greater accuracy and efficiency than more traditional approaches of using implicit-explicit (IMEX) and low-order operator splitting schemes. However, to date there have been few performance studies that compare different classes of multirate integrators on complex application problems. In this work, we study the performance of several newly developed multirate infinitesimal (MRI) methods, implemented in the SUNDIALS solver package, on two reacting flow model problems built on structured mesh frameworks. The first model revisits prior work on a compressible reacting flow problem with complex chemistry that is implemented using BoxLib but where we now include comparisons between a new explicit MRI scheme with the multirate spectral deferred correction (SDC) methods in the original paper. The second problem uses the same complex chemistry as the first problem, combined with a simplified flow model, but runs at a large spatial scale where explicit methods become infeasible due to stability constraints. Two recently developed IMEX MRI multirate methods are tested. These methods rely on advanced features of the AMReX framework on which the model is built, such as multilevel grids and multilevel preconditioners. The results from these two problems show that MRI multirate methods can offer significant performance benefits on complex multiphysics application problems and that these methods may be combined with advanced spatial discretization to compound the advantages of both.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On the Rapid Calculation of Binding Affinities for Antigen and Antibody Design and Affinity Maturation Simulations

The accurate and efficient calculation of protein-protein binding affinities is an essential component in antibody and antigen design and optimization, and in computer modeling of antibody affinity maturation. Such calculations remain challenging despite advances in computer hardware and algorithms, primarily because proteins are flexible molecules, and thus, require explicit or implicit incorporation of multiple conformational states into the computational procedure. The astronomical size of the amino acid sequence space further compounds the challenge by requiring predictions to be computed within a short time so that many sequence variants can be tested. In this study, we compare three classes of methods for antibody/antigen (Ab/Ag) binding affinity calculations: (i) a method that relies on the physical separation of the Ab/Ag complex in equilibrium molecular dynamics (MD) simulations, (ii) a collection of 18 scoring functions that act on an ensemble of structures created using homology modeling software, and (iii) methods based on the molecular mechanics-generalized Born surface area (MM-GBSA) energy decomposition, in which the individual contributions of the energy terms are scaled to optimize agreement with the experiment. When applied to a set of 49 antibody mutations in two Ab/HIV gp120 complexes, all of the methods are found to have modest accuracy, with the highest Pearson correlations reaching about 0.6. In particular, the most computationally intensive method, i.e., MD simulation, did not outperform several scoring functions. The optimized energy decomposition methods provided marginally higher accuracy, but at the expense of requiring experimental data for parametrization. Within each method class, we examined the effect of the number of independent computational replicates, i.e., modeled structures or reinitialized MD simulations, on the prediction accuracy. We suggest using about ten modeled structures for scoring methods, and about five simulation replicates for MD simulations as a rule of thumb for obtaining reasonable convergence. We anticipate that our study will be a useful resource for practitioners working to incorporate binding affinity calculations within their protein design and optimization process.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Monte-Carlo modeling of phonon thermal transport using DFT-based anisotropic dispersion relations over the full Brillouin zone

In this work, we present a Monte Carlo (MC) approach to solve the phonon Boltzmann transport equation (BTE) in which the anisotropic phonon dispersion relations over the full Brillouin zone (BZ) are used. In this approach, the discretization of the BZ used to compute the phonon relaxation time places constraints on the direction of scattered phonons in the real-space simulation domain. The phonon dispersion and phonon relaxation times are calculated using the density functional theory (DFT) approach. The modified MC approach is validated by a close examination of its ability to simulate phonon transport in both the ballistic and diffusive regimes for multiple materials including GaAs, InAs, ThO 2 , and α-U. In doing so, the phonon thermal conductivities from 100 K to 1000 K are calculated and compared with traditional non-transport solution of the phonon BTE. It is found that the phonon thermal conductivities of α-U and ThO 2 obtained from MC simulations using isotropic dispersion are larger than the values obtained using anisotropic phonon dispersion relations over the full BZ. The effect of phonon-defect scattering on the thermal conductivity of ThO 2 is also studied as an application of the current MC approach and found to agree with previously computed values in the literature. The MC solver developed here has been parallelized as a step to demonstrate its potential to solving computationally intensive phonon thermal transport problems at the mesoscale.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Optimization of direct air capture processes using reactive transport models of adsorption-desorption cycles

In this study, we develop and implement a reactive transport model in COMSOL Multiphysics® to address the challenges of direct air carbon capture. The model is validated against experimental data and used to simulate the cyclic steady state of the adsorption-desorption process. The optimization of this model is achieved through advanced trust-region methods integrated with Gaussian Processes. Key decision variables, including adsorption and desorption times, desorption temperature and pressure, input velocity, bed porosity, column length, and radius were optimized to minimize the capture cost. After optimization, a sensitivity analysis revealed the complex interplay between the decision variables and their effect on the specific energy and cost of removing the CO 2 . We optimized the capture cost while taking into account the trade-off between energy consumption and productivity. The resulting minimum capture cost was determined to be 265.2 $/t-CO 2 , which aligns with expected values reported in the literature. Numerical results suggest the effectiveness of the optimization strategies applied, and underscore the importance of simultaneous decision variable selection in improving the performance in direct air capture processes. We also extend the modeling approach to a 2D axisymmetric model to better visualize CO₂ uptake and temperature profiles, revealing significant radial gradients during the regeneration step. As a main drawback, this enhanced model comes with a computational cost approximately 40 times higher than that of the 1D model.

Adsorption-desorption process↗