Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Southern Ocean Cloud Properties Derived From CAPRICORN and MARCUS Data

The properties of Southern Ocean (SO) liquid phase non precipitating clouds (hereafter clouds) are examined using shipborne data collected during the Measurements of Aerosols, Radiation and Clouds over the Southern Ocean and the Clouds Aerosols Precipitation Radiation and atmospheric Composition Over the SoutheRN ocean I and II campaigns that took place south of Australia during Autumn 2016 and Summer 2017–2018. Cloud properties are derived using data from W-band radars, lidars, and microwave radiometers using an optimal estimation algorithm. The SO clouds tended to have larger liquid water paths (LWP, 115 ± 117 g m -2 ), smaller effective radii (re, 8.7 ± 3 μm), and higher number concentrations (N d , 90 ± 107 cm-3) than typical values of eastern ocean basin stratocumulus. The clouds demonstrated a tendency for the LWP to increase with Nd presumably due to precipitation suppression up to Nd of approximately 100 cm -3 when mean LWP decreased with increasing Nd. Due to higher optical depth, cloud albedos were less susceptible to changes in Nd compared to subtropical stratocumulus. The highest latitude clouds of the datasets, observed along and near the Antarctic coast, presented a distinctly bimodal character. One mode had the properties of marine clouds further north. Additionally, the other mode occurred in an aerosol environment characterized by high cloud condensation nuclei concentrations and elevated sulfate aerosol without obvious continental aerosol markers. These regions of higher cloud condensation nuclei tended to have higher Nd, smaller re and higher LWP suggesting sensitivity of cloud properties to seasonal biogenic aerosol production in the high latitude SO.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗
DOE OSTI2020

Correlation between time and angular alignment in molecular dynamics simulations of heavy ion collisions

Neutron-proton equilibration is a process which has been used to study the density dependence of the symmetry energy term in the nuclear equation-of-state. Here, this study utilizes constrained molecular dynamics (CoMD) simulations of 70 Zn + 70 Zn with collision energies of 35 and 45 MeV/nucleon. An algorithm is used which searches through CoMD events and identifies the PLF* after it separates from the target and determines its lifetime, Δt. It also determines the fragments that the PLF* breaks apart into and determines their angular alignment. This technique gives an opportunity to explore how the average alignment of dynamically produced fragments, $\langle$α $\rangle$ dyn , evolves with PLF* lifetime. An approximately linear relationship was determined with d$\langle$α $\rangle$ dyn /dΔt = 0.98 ± 0.08 rad / zs and 1.06 ± 0.09 rad / zs for the 35 and 45 MeV / nucleon, respectively, indicating a correlation with magnitude consistent with classically determined values which were used for prior experimental studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Classical eikonal from Magnus expansion

In a classical scattering problem, the classical eikonal is defined as the generator of the canonical transformation that maps in-states to out-states. It can be regarded as the classical limit of the log of the quantum S-matrix. In a classical analog of the Born approximation in quantum mechanics, the classical eikonal admits an expansion in oriented tree graphs, where oriented edges denote retarded/advanced worldline propagators. The Magnus expansion, which takes the log of a time-ordered exponential integral, offers an efficient method to compute the coefficients of the tree graphs to all orders. We exploit a Hopf algebra structure behind the Magnus expansion to develop a fast algorithm which can compute the tree coefficients up to the 12th order (over half a million trees) in less than an hour. In a relativistic setting, our methods can be applied to the post-Minkowskian (PM) expansion for gravitational binaries in the worldline formalism. We demonstrate the methods by computing the 3PM eikonal and find agreement with previous results based on amplitude methods. Importantly, the Magnus expansion yields a finite eikonal, while the naïve eikonal based on the time-symmetric propagator is infrared-divergent from 3PM on.

Black Holes↗
DOE OSTI2020

Data-driven learning of nonlocal physics from high-fidelity synthetic data

A key challenge to nonlocal models is the analytical complexity of deriving them from first principles, and frequently their use is justified a posteriori. Here, we extract nonlocal models from data, circumventing these challenges and providing data-driven justification for the resulting model form. Extracting data-driven surrogates is a major challenge for machine learning (ML) approaches, due to nonlinearities and lack of convexity — it is particularly challenging to extract surrogates which are provably well-posed and numerically stable. Our scheme not only yields a convex optimization problem, but also allows extraction of nonlocal models whose kernels may be partially negative while maintaining well-posedness even in small-data regimes. To achieve this, based on established nonlocal theory, we embed in our algorithm sufficient conditions on the non-positive part of the kernel that guarantee well-posedness of the learnt operator. These conditions are imposed as inequality constraints to meet the requisite conditions of the nonlocal theory. We demonstrate this workflow for a range of applications, including reproduction of manufactured nonlocal kernels; numerical homogenization of Darcy flow associated with a heterogeneous periodic microstructure; nonlocal approximation to high-order local transport phenomena; and approximation of globally supported fractional diffusion operators by truncated kernels.

42 ENGINEERING↗
DOE OSTI2025

Emergent hydrodynamic mode on SU(2) plaquette chains and quantum simulation

We search for emergent hydrodynamic modes in real-time Hamiltonian dynamics of 2+1-dimensional SU(2) lattice gauge theory on a quasi-one-dimensional plaquette chain, by numerically computing symmetric correlation functions of energy densities on lattice sizes of about 20 with the local Hilbert space truncated at 𝑗 max = $\frac{1}{2}$. Because of the Umklapp processes, we only find a mode for energy diffusion. The symmetric correlator exhibits transport peak near zero frequency with a width approximately proportional to momentum squared at small momentum, when the system is fully quantum ergodic, as indicated by the eigenenergy level statistics. This transport peak leads to a power-law 𝑡 −$\frac{1}{2}$ decay of the symmetric correlator at late time, also known as the long-time tail, as well as diffusionlike spreading in position space. We also introduce a quantum algorithm for computing the symmetric correlator on a quantum computer and find it gives results consistent with exact diagonalization when tested on the IBM emulator. Finally we discuss the future prospect of searching for the sound modes.

Hamiltonian systems↗
DOE OSTI2021

Boundary Layer Climatology at ARM Southern Great Plains

Operational since 1992, the Atmospheric Radiation Measurement (ARM) southern great plains (SGP) site at Oklahoma, USA has become a reference research site for meteorological studies. Due to an open data policy the ARM data are used by researchers all over the world. In this report, we review the long-term climatology of the atmospheric boundary layer, SGP instrumentations, the site and some site-specific atmospheric conditions which potentially effect wind turbines within the region. As the atmospheric boundary layer is bounded and influenced by the surface, observations of surface radiation components and heat fluxes are crucial in understanding land-atmosphere interactions. The entrainment of air, updrafts, downdrafts and boundary layer height characteristics is needed for understanding the structure and growth of the atmospheric boundary layer. Therefore, measurements from both surface in-situ and remote sensing observations at SGP provide an overall climatology and their interactions from surface up to the boundary layer. Measurements from a 60 m meteorological tower, surface flux stations, disdrometers, soil temperature and moisture flux plates, coherent Doppler lidar, Raman lidar, radiosondes, and satellite data at SGP central facility were analyzed. All the measurements were generally within a few square kilometers of each other at the central facility. This report focuses on data from January 2010 to June 2020 at SGP central facility. The various sections describe the ARM SGP site and surrounding wind turbines; in-situ and remote sensing instrumentation used in the report; provides mathematical equations to analyze fluxes, turbulence and other boundary layer parameters; a climatological analysis of surface winds, fluxes and thermodynamic parameters for several years; an analysis of observed winds in the framework of Monin-Obukhov Similarity Theory; an analysis of the boundary layer winds and direction from a Doppler lidar; multi-year turbulence estimates through the boundary layer from a Doppler lidar; atmospheric boundary layer water vapor and relative humidity profiles from Raman lidar; cloud base height and boundary layer height from multiple sensors and satellite data; and finally site specific atmospheric conditions, such as nocturnal low-level jets. Diurnal, seasonal and yearly variations of surface, sub-surface and boundary layer quantities, such as wind speed, direction, temperature, atmospheric stability, soil temperature, and various atmospheric fluxes at SGP showed distinct trends useful for focused modeling studies. The applicability of surface similarity theory on ARM SGP data is also evaluated, which showed northerly flows are aligned with MO theory estimates compared to southerly flows. Boundary layer winds and direction profiles for several years from a Doppler lidar shows a consistent presence of a nocturnal low-level jet and predominant southerly wind directions through the boundary layer at SGP. The inter-annual variability at SGP is low (<3.5%), with a mean annual wind speed of approximately 7 m s -1 at 100 m above ground level. Boundary layer turbulence and moisture transport from Doppler and Raman lidars are evaluated, which provides evidence of increased water vapor mass flux into the great plains during nocturnal low-level jets. The moisture flux from nocturnal low-level jets is observed to be maximum during summer periods. A novel machine learning algorithm is implemented to accurately estimate the planetary boundary layer height, providing further insights into growth and destruction of the convective boundary layer height during various seasons and land-atmosphere conditions. The high frequency of low-level clouds during winter, spring and fall seasons is validated using the multi-sensor array and satellite estimates of cloud top height. Satellite vegetative fraction data provides insight into seasonal surface roughness and vegetation variability around SGP site.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

CIRCLES: Congestion Impacts Reduction via CAV-in-the-loop Lagrangian Energy Smoothing

The energy efficiency of today’s vehicular mobility relies on the un-integrated combination of i) control via static assets (traffic lights, metering, variable speed limits, etc.); and ii) onboard vehicle automation (adaptive cruise control (ACC), ecodriving, etc.). These two families of control were not co-designed and are not engineered to work in coordination. Recent studies have shown i) limitations of controls, and even ii) negative impacts of ACC. This project focused on the technology development, implementation and prototyping, and validation of Mobile Traffic Control (MTC). MTC can be viewed as an extension of classical traffic control (in which static infrastructure actuates traffic flow). In the MTC paradigm, automated vehicles actuate the entire flow via their behavior, offering enhanced possibilities to optimize the energy footprint of traffic, if designed correctly. We set out to demonstrate for the first time that considerably reduced fuel consumption of all vehicles in traffic can be achieved via distributed control of a small proportion of CAVs. Compared to baseline vehicular technologies, our work offers a significant design departure: control algorithms for the CAVs consider the impact one vehicle can have on overall traffic, improving resulting overall fuel consumption. We focus on using a few vehicles (as traffic controllers via CAV technology) to improve the energy efficiency of traffic flow to further optimize energy efficiency. A live-traffic demonstration in November 2022 featured the deployment of 100 specially-equipped CAVs, constituting an approximate local penetration rate upwards of 2%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Inferring the Dynamics of the State Evolution During Quantum Annealing

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Furthermore, using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer, such as the state evolution during annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce a technique to estimate the freeze-out point of both the system as well as of individual qubits.

42 ENGINEERING↗
DOE OSTI2021

Domain decomposition in the GPU-accelerated Shift Monte Carlo code

The GPU solver within the Shift continuous-energy Monte Carlo neutron transport code has been extended to provide domain decomposition in addition to domain replication to enable the solution of problems with memory requirements exceeding the capacity of a single GPU. The strategy follows the Multiple Set, Overlapping Domain (MSOD) approach that is used in Shift’s CPU solver and integrates into the event-based algorithm used for Shift’s GPU solver. Furthermore, the ability to assign processors to spatial domains non-uniformly has been maintained. In this work, two different approaches for communicating particle data between domains are considered, and multiple criteria for load balancing problems have been investigated. Numerical results are presented for both fresh and depleted small modular nuclear reactor (SMR) cores. A parallel efficiency of approximately 80% was achieved with up to 16 spatial domains measured relative to full domain replication. A scaling study on the Summit supercomputer demonstrates a weak scaling parallel efficiency of over 90% on over 24000 GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Uniform-in-phase-space data selection with iterative normalizing flows

Improvements in computational and experimental capabilities are rapidly increasing the amount of scientific data that are routinely generated. In applications that are constrained by memory and computational intensity, excessively large datasets may hinder scientific discovery, making data reduction a critical component of data-driven methods. Datasets are growing in two directions: the number of data points and their dimensionality. Whereas dimension reduction typically aims at describing each data sample on lower-dimensional space, the focus here is on reducing the number of data points. A strategy is proposed to select data points such that they uniformly span the phase-space of the data. The algorithm proposed relies on estimating the probability map of the data and using it to construct an acceptance probability. An iterative method is used to accurately estimate the probability of the rare data points when only a small subset of the dataset is used to construct the probability map. Instead of binning the phase-space to estimate the probability map, its functional form is approximated with a normalizing flow. Therefore, the method naturally extends to high-dimensional datasets. The proposed framework is demonstrated as a viable pathway to enable data-efficient machine learning when abundant data are available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multiscale Ecosystem for solving Maxwell-Schrodinger equations of open quantum systems (OpenMS)

Light-matter interactions play an important role in many branches of physics, chemistry, energy, and materials science. In the strong coupling regime, light-matter interactions are able to tune the materials properties via the formation of new quasiparticles, such as plasmons and polaritons. However, theoretical and numerical modeling of the light-matter interaction-mediated processes remain a big challenge because light-matter interactions are fundamentally multiscale and multiphysics problems involving multiple interactions between electrons, nuclei, and photons at different time/length scales. In the current community, light-matter interactions were treated at different levels of theoretical complexity in quantum chemistry and quantum optics. In quantum optics or quantum photonics, the matter is usually simplified as a few-level system, and the light is treated quantum-mechanically. On the other hand, quantum chemistry explores first-principles methods, including both single-particle and many-body-based techniques, to describe the electronic properties of matter in detail. However, light is usually prescribed as a classical electromagnetic field, and the light-matter interaction is taken into account as an external potential via classical approximations. This software is designed to fill current modeling shortcomings by delivering a first-ever scalable multiscale platform for simulating light-matter interactions in realistic electromagnetic environments. The software solves Maxwell and Schrodinger equations self-consistent on the heterogeneous platforms. It implements HF/DFT, TDDFT, and coupled-cluster counterparts for light-matter interactions and adopts modular programming to offload massively parallel algorithms on a large number of CPU/GPUs.

Zhang, Yu↗
DOE OSTI2020

Quantum Fast Approximate Synthesis Tool (QFAST) v1.0.0

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.

Younis, Ed↗
DOE OSTI2021

The picasso map-making code: application to a simulation of the QUIJOTE northern sky survey

ABSTRACT Map-making is an important step for the data analysis of cosmic microwave background (CMB) experiments. It consists of converting the data, which are typically a long, complex, and noisy collection of measurements, into a map, which is an image of the observed sky. We present in this paper a new map-making code named picasso (Polarization and Intensity CArtographer for Scanned Sky Observations), which was implemented to construct intensity and polarization maps from the Multi Frequency Instrument (MFI) of the QUIJOTE (Q-U-I Joint TEnerife) CMB polarization experiment. picasso is based on the destriping algorithm, and is suited to address specific issues of ground-based microwave observations, with a technique that allows the fit of a template function in the time domain, during the map-making step. This paper describes the picasso code, validating it with simulations and assessing its performance. For this purpose, we produced realistic simulations of the QUIJOTE-MFI survey of the northern sky (approximately ∼20 000 deg2), and analysed the reconstructed maps with picasso, using real and harmonic space statistics. We show that, for this sky area, picasso is able to reconstruct, with high fidelity, the injected signal, recovering all the scales with ℓ > 10 in TT, EE, and BB. The signal error is better than 0.001 per cent at 20 < ℓ < 200. Finally, we validated some of the methods that will be applied to the real wide-survey data, like the detection of the CMB anisotropies via cross-correlation analyses. Despite that the implementation of picasso is specific for QUIJOTE-MFI data, it could be adapted to other experiments.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Approximate Dynamic Programming With Enhanced Off-Policy Learning for Coordinating Distributed Energy Resources

Herein this paper proposes an innovative approximate dynamic programming (ADP) method for distributed energy resource coordination with the loss of life of battery energy storage system (BESS) explicitly modeled. The dispatch policy is designed to account for both calendrical and cyclical aging effects on BESS, explicitly modeling the impacts of ambient temperature on BESS lifespan. The proposed ADP employs an adaptive critic method and enhanced off-policy deterministic policy gradient (DPG) strategy, addressing the limitations of the on-policy gradient-based ADP approaches, including inadequate exploration, low data usage, and computational complexity. In particular, a customized policy is proposed to guide the algorithm to explore some promising decisions and thereby improve exploration capability and learning efficiency compared to conventional DPG-based learning approaches, which may struggle to find a global optimum due to random noisy action-based exploration or require expert demonstration with extra effort. The proposed method is illustrated using the IEEE 123-node system and compared with the existing ADP methods to prove solution accuracy and demonstrate the effects of incorporating degradation models into control design. Case studies showed that the proposed ADP effectively coordinates DERs with a 10 times smaller optimization gap compared to existing methods, and the incorporation of the BESS life loss model ensures the expected lifespan and results in significant cost savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits

Hadron wave packets are prepared and time evolved in the Schwinger model using 112 qubits of IBM’s 133-qubit Heron quantum computer ibm_torino. The initialization of the hadron wave packet is performed in two steps. First, the vacuum is prepared across the whole lattice using the recently developed SC-ADAPT-VQE algorithm and workflow. SC-ADAPT-VQE is then extended to the preparation of localized states, and used to establish a hadron wave packet on top of the vacuum. This is done by adaptively constructing low-depth circuits that maximize the overlap with an adiabatically prepared hadron wave packet. Due to the localized nature of the wavepacket, these circuits can be determined on a sequence of small lattices using classical computers, and then robustly scaled to prepare wave packets on large lattices for simulations using quantum computers. Time evolution is implemented with a second-order Trotterization. To reduce both the required qubit connectivity and circuit depth, an approximate quasilocal interaction is introduced. This approximation is made possible by the emergence of confinement at long distances, and converges exponentially with increasing distance of the interactions. Using multiple error-mitigation strategies, up to 14 Trotter steps of time evolution are performed, employing 13,858 two-qubit gates (with a CNOT depth of 370). The propagation of hadrons is clearly identified, with results that compare favorably with Matrix Product State simulations. Finally, prospects for a near-term quantum advantage in simulations of hadron scattering are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗