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 1,081 records · Page 60

Negative complexity of formation: the compact dimensions strike back

We show that the vacuum-subtracted maximal volume, the proposed holographic dual to complexity of formation, can be negative when contributions from compact directions are included. We construct explicit solutions with arbitrarily negative complexity of formation in asymptotically AdS 4 × S 7 SUGRA. These examples rely critically on the compact directions, specifically the fact that the full eleven-dimensional spacetime is not asymptotically AdS 11 . While there is some ambiguity in the extension of the holographic complexity proposal to the compact directions, we show that the two natural candidates can both have arbitrarily negative complexity of formation in SUGRA solutions. We further find examples in which complexity can even decrease at late times, including cases of both single-sided geometries and two-sided wormholes. In particular, we construct a cosmological wormhole with simultaneously negative and decreasing complexity of formation (as computed by volume) at late times. We find a distinguished role for relevant primaries in these constructions and comment on possible interpretations.

2D Gravity↗

Diagonal isometric form for tensor network states in two dimensions

Isometric tensor network states (isoTNS) generalize the isometric form of the one-dimensional matrix product states to tensor networks in two and higher dimensions. Here, we introduce an alternative isometric form for isoTNS by incorporating auxiliary tensors to represent the orthogonality hypersurface. We implement the time evolving block decimation algorithm on this new isometric form and benchmark the method by computing ground states and the real time evolution of the transverse field Ising model in two dimensions on large square lattices of up to 1250 sites. Our results demonstrate that isoTNS can efficiently capture the entanglement structure of two-dimensional area law states. The short-time dynamics is also accurately reproduced even at the critical point. Our isoTNS formulation further allows for a natural extension to different lattice geometries, such as the honeycomb or kagome lattice.

2-dimensional systems↗

Leveraging Multiple Connected Traffic Light Signals in an Energy-Efficient Speed Planner

Connecting automated vehicles to traffic lights can lead to significant energy savings by enabling them to pass through intersections in an energy-efficient way without unnecessary stops. A cellular-based communication system connecting multiple traffic lights can help realize the full potential of energy-efficient driving at intersections. Thus, we propose a hierarchical speed planner that can leverage information from multiple connected traffic lights. The proposed speed planner consists of two modules: a green window selector and a reference trajectory generator. The green window selector, based on Dijkstra’s algorithm, finds a series of "green windows" for connected traffic lights that builds an energy-optimal path for vehicles to follow. The reference trajectory generator finds optimal entering times, based on the selected green window at each intersection, and then computes reference trajectories. Deriving and using analytical optimal entering speeds as a function of entering times allows us to guarantee the computational simplicity suitable for real-time implementation. We also demonstrate how to balance energy and traffic flow perspectives in the reference trajectory generator. Lastly, a high-fidelity simulation framework is used to evaluate the proposed speed planner and quantify the extent to which it can save energy in various real-world urban route scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Photoluminescence of Cis-Polyacetylene Semiconductor Material

Photoluminescence (PL) is one of the key experimental characterizations of optoelectronic materials, including conjugated polymers (CPs). In this study, a simplified model of an undoped cis-polyacetylene (cis-PA) oligomer was selected and used to explain the mechanism of photoluminescence (PL) of the CPs. Using a combination of the ab initio electronic structure and a time-dependent density matrix methodology, the photo-induced time-dependent excited state dynamics were computed. We explored the phonon-induced relaxation of the photoexcited state for a single oligomer of cis-PA. Here, the dissipative Redfield equation of the motion was used to compute the dissipative excited state dynamics of electronic degrees of freedom. This equation used the nonadiabatic couplings as parameters. The computed excited state dynamics showed that the relaxation rate of the electron is faster than the relaxation rate of the hole. The dissipative excited-state dynamics were combined with radiative recombination channels to predict the PL spectrum. The simulated results showed that the absorption and emission spectra both have a similar transition. The main result is that the computed PL spectrum demonstrates two mechanisms of light emission originating from (i) the inter-band transitions, corresponding to the same range of transition energies as the absorption spectrum and (ii) intra-band transitions not available in the absorption spectra. However, the dissipative Redfield equation of the motion was used to compute the electronic degrees of freedom of the nonadiabatic couplings, which helped to process the time propagation of the excited dynamic state. This excited dynamic state shows that the relaxation rate of the electron is faster than the relaxation rate of the hole, which can be used for improving organic semiconductor materials for photovoltaic and LED applications.

36 MATERIALS SCIENCE↗

Optimizing aircraft flows at airports using data driven predicted capabilities

A method for safe and efficient use of airport runway capacity includes receiving, at an air traffic control system at an airport, airport data related to movement areas of the airport, time data related to a time period, aircraft data related to a plurality of aircraft expected to operate into and out of the airport during the time period, and environmental data related to environmental conditions predicted for the airport during the time period. The method further includes computing a probability distribution for inter-aircraft spacing by applying the airport data, the time data, the aircraft data, and the environmental data to a trained Bayesian network, producing the probability distribution for the inter-aircraft spacing as an output observation of the trained Bayesian network, and, using the probability distribution and a confidence value, identifying an inter-aircraft spacing value for the plurality of aircraft expected to operate into and out of the airport during the time period.

Sweet, Douglas↗

Scalability of high-performance PDE solvers

Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.

97 MATHEMATICS AND COMPUTING↗

Rapid Construction of Validated Chemistry Models for Advanced Biofuels (Co-Optima Final Report)

Computer methods were developed and demonstrated that make it possible to predict the combustion and pyrolysis chemistry of proposed biofuels, even before the biofuels are ever manufactured or experimentally tested. The methods are based on first-principles calculations of reaction rates and equilibria. A large number of complicated calculations are required, so we developed a computer workflow that automates many of the steps. With the chemical structure of the biofuel and the system conditions (temperature, pressure, compositions, etc.) as the input, the computer methods can construct a detailed kinetic model with refined parameters without intense human intervention. The automation of model construction makes it practical for a single engineer to make the predictions in a reasonable time period. The accuracy of the computer predictions was tested by measuring the time-profiles of various reaction intermediates (carbon monoxide, carbon dioxide, water, formaldehyde, methane, and ethylene) formed as the biofuels pyrolyze or ignite using sophisticated laser shock tube methods. Several biofuels, including methyl propyl ether, cyclopentanone, butyl acetate isomers, etc., were carefully studied to demonstrate the validity of the proposed computational and experimental methodology. This research project opens up the possibility for assessing some proposed biofuels on the computer without expensive experimental campaigns. The new computer methods are open source and well-documented, allowing a knowledgeable modeler to easily access the developed methods and implement them in their work routine. Moreover, they are also convenient and powerful, promising for developing the fuel chemistry models needed for use in engine simulators, facilitating co-optimization of new engine designs with new fuels.

09 BIOMASS FUELS↗

An Ensemble Approach to Computationally Efficient Radiological Anomaly Detection and Isotope Identification

Radiological source search is a challenging task involving detection and identification of weak sources in a constantly changing radiological background. As of now, many radiological source detection algorithms have been proposed; however, their computational complexity, and hence reliance on power intensive processing units inhibit low-power applications of radiological source search systems. In this work, we introduce the anomaly filter (AF) algorithm; a computationally light, yet effective time-series source detection algorithm based on exponential weighted moving average (EWMA) and Poisson deviance statistics. Then, we demonstrate that the proposed algorithm can be used in ensemble with other more computationally intensive source detection and identification algorithms to achieve both increased detection performance and reduced power consumption. The proposed AF algorithm and the ensemble algorithms were thoroughly benchmarked against several existing source detection and identification algorithms. The results show that the AF algorithm outperforms existing conventional source detection algorithms, and the ensemble approach improves the overall performance of existing source detection and isotope identification algorithms. Furthermore, the AF algorithm and the Non-negative Matrix Factorization approach based source identification (NMF-ID) algorithm were combined and implemented on a singleboard microcontroller and the power consumption was measured. This ensemble algorithm reduced the power consumption of the NMF-ID algorithm almost by a factor of 100, while improving the detection performance of the overall system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗

Real-Time Interactive 4D-STEM Phase-Contrast Imaging From Electron Event Representation Data: Less computation with the right representation

The arrival of direct electron detectors (DED) with high frame-rates in the field of scanning transmission electron microscopy has enabled many experimental techniques that require collection of a full diffraction pattern at each scan position, a field which is subsumed under the name four dimensional-scanning transmission electron microscopy (4D-STEM). DED frame rates approaching 100 kHz require data transmission rates and data storage capabilities that exceed commonly available computing infrastructure. Current commercial DEDs allow the user to make compromises in pixel bit depth, detector binning or windowing to reduce the per-frame file size and allow higher frame rates. This change in detector specifications requires decisions to be made before data acquisition that may reduce or lose information that could have been advantageous during data analysis. The 4D Camera, a DED with 87 kHz frame-rate developed at Lawrence Berkeley National Laboratory, reduces the raw data to a linear-index encoded electron event representation (EER). Here we show with experimental data from the 4D Camera that linear-index encoded EER and its direct use in 4D-STEM phase contrast imaging methods enables real-time, interactive phase-contrast from large-area 4D-STEM datasets. Furthermore, we detail the computational complexity advantages of the EER and the necessary computational steps to achieve real-time interactive ptychography and center-of-mass differential phase contrast using commonly available hardware accelerators.

4D-STEM↗

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗

Distributed Training and Optimization of Neural Networks

Deep learning models are yielding increasingly better performances thanks to multiple factors. To be successful, model may have large number of parameters or complex architectures and be trained on large dataset. This leads to large requirements on computing resource and turn around time, even more so when hyperparameter optimization is done (e.g. search over model architectures). While this is a challenge that goes beyond particle physics, we review the various ways to do the necessary computations in parallel, and put it in the context of high-energy physics.

Vlimant, Jean-Roch↗

Accelerating Multiphase Simulations With Denoising Diffusion Model Driven Initializations

This study introduces a hybrid fluid simulation approach that integrates generative diffusion models with physics‐based simulations, aiming at reducing the computational costs of flow simulations while still honoring all the physical properties of interest. Pore‐scale simulations enhance our understanding of applications such as assessing hydrogen and storage efficiency in underground reservoirs. Nevertheless, they are computationally expensive and the presence of non‐unique solutions can require multiple simulations within a single geometry. To overcome the computational cost hurdle, we propose a method that couples generative diffusion models and physics‐based simulations. While training the data‐driven model, we simultaneously generate initial conditions and perform physics‐based simulations using these. This integrated approach enables us to receive real‐time feedback on a single compute node equipped with both CPUs and GPUs. By efficiently managing these processes within a single compute node, we can continuously monitor performance and halt training once the model meets the specified criteria. To test our model, we generate realizations in a real Berea sandstone fracture which shows that our technique is up to 4.4 times faster than commonly used flow simulation initializations.

36 MATERIALS SCIENCE↗

Diagonal state designs with reconfigurable real-time circuits

Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

Shen, Yizhi [LBL, Berkeley] (ORCID:000000024160548↗

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↗

Direct numerical simulations of turbulent reacting flows with shock waves and stiff chemistry using many-core/GPU acceleration

Compressible reacting flows may display sharp spatial variation related to shocks, contact discontinuities or reactive zones embedded within relatively smooth regions. The presence of such phenomena emphasizes the relevance of shock-capturing schemes such as the weighted essentially non-oscillatory (WENO) scheme as an essential ingredient of the numerical solver. However, these schemes are complex and have more computational cost than the simple high-order compact or non-compact schemes. In this paper, we present the implementation of a seventh-order, minimally-dissipative mapped WENO (WENO7M) scheme in a newly developed direct numerical simulation (DNS) code called KAUST Adaptive Reactive Flows Solver (KARFS). In order to make efficient use of the computer resources and reduce the solution time, without compromising the resolution requirement, the WENO routines are accelerated via graphics processing unit (GPU) computation. The performance characteristics and scalability of the code are studied using different grid sizes and block decomposition. Furthermore, the performance portability of KARFS is demonstrated on a variety of architectures including NVIDIA Tesla P100 GPUs and NVIDIA Kepler K20X GPUs. In addition, the capability and potential of the newly implemented WENO7M scheme in KARFS to perform DNS of compressible flows is also demonstrated with model problems involving shocks, isotropic turbulence, detonations and flame propagation into a stratified mixture with complex chemical kinetics.

97 MATHEMATICS AND COMPUTING↗

Real-Time Time-Dependent Density Functional Theory for Simulating Nonequilibrium Electron Dynamics

The explicit real-time propagation approach for time-dependent density functional theory (RT-TDDFT) has increasingly become a popular first-principles computational method for modeling various time-dependent electronic properties of complex chemical systems. Here, in this Perspective, we provide a nontechnical discussion of how this first-principles simulation approach has been used to gain novel physical insights into nonequilibrium electron dynamics phenomena in recent years. Following a concise overview of the RT-TDDFT methodology from a practical standpoint, we discuss our recent studies on the electronic stopping of DNA in water and the Floquet topological phase as examples. Our discussion focuses on how RT-TDDFT simulations played a unique role in deriving new scientific understandings. We then discuss existing challenges and some new advances at the frontier of RT-TDDFT method development for studying increasingly complex dynamic phenomena and systems.

Hamiltonians↗

Nonlocal and nonadiabatic Pauli potential for time-dependent orbital-free density functional theory

Time-dependent orbital-free density functional theory is an efficient ab initio method for calculating the electronic dynamics of large systems. In comparison to standard time-dependent density functional theory, it computes only a single electronic state regardless of system size, but it requires an additional time-dependent Pauli potential term. Herein we propose a nonadiabatic and nonlocal Pauli potential whose main ingredients are the time-dependent particle and current densities. Our calculations of the optical spectra of metallic and semiconductor clusters indicate that nonlocal and nonadiabatic time-dependent orbital-free density functional theory performs accurately for metallic systems and semiquantitatively for semiconductors. This paper opens the door to wide applicability of time-dependent orbital-free density functional theory for nonequilibrium electron and electron-nuclear dynamics of complex materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗