Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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,297 records · Page 72
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Cooperative Systems in Presence of Cyber-Attacks: A Unified Framework for Resilient Control and Attack Identification

Here, this paper considers a cooperative control problem in presence of unknown attacks. The attacker aims at destabilizing the consensus dynamics by intercepting the system’s communication network and corrupting its local state feedback. We first revisit the virtual network based resilient control proposed in our previous work and provide a new interpretation and insights into its implementation. Based on these insights, a novel distributed algorithm is presented to detect and identify the compromised communication links. It is shown that it is not possible for the adversary to launch a harmful and stealthy attack by only manipulating the physical states being exchanged via the network. In addition, a new virtual network is proposed which makes it more difficult for the adversary to launch a stealthy attack even though it is also able to manipulate information being exchanged via the virtual network. A numerical example demonstrates that the proposed control framework achieves simultaneously resilient operation and real-time attack identification.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Maximum a posteriori Ly α estimator (MAPLE): band power and covariance estimation of the 3D Ly α forest power spectrum

We present a novel maximum a posteriori estimator to jointly estimate band powers and the covariance of the three-dimensional power spectrum (P3D) of Ly $\alpha$ forest flux fluctuations, called MAPLE. Our Wiener-filter based algorithm reconstructs a window-deconvolved P3D in the presence of complex survey geometries typical for Ly $\alpha$ surveys that are sparsely sampled transverse to and densely sampled along the line of sight. We demonstrate our method on idealized Gaussian random fields with two selection functions: (i) a sparse sampling of 30 background sources per square degree designed to emulate the current Dark Energy Spectroscopic Instrument; (ii) a dense sampling of 900 background sources per square degree emulating the upcoming Prime Focus Spectrograph Galaxy Evolution Survey. Our proof-of-principle shows promise, especially since the algorithm can be extended to marginalize jointly over nuisance parameters and contaminants, i.e. offsets introduced by continuum fitting. Our code is implemented in JAX and is publicly available on GitHub.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm

Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are particularly attractive candidates for implementation on near-term quantum processors. As hardware realities such as error and qubit connectivity will constrain achievable circuit depth in the near future, new ways to achieve high performance at low depth are of great interest. In this work, we present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation axis in the XY plane of the mixer Hamiltonian. Here, via numerical simulation, we show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MaxCut problem on graphs of up to seven qubits. Furthermore, we explore the Z-phase error mitigation properties of our modified Ansatz, its performance under a realistic error model for a neutral atom quantum processor, and the class of problems it can solve in a single round.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Isometric Tensor Network States in Two Dimensions

Tensor-network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. Here we consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm for approximating of the ground state of a Hamiltonian as an isometric TNS-which we demonstrate for the 2D transverse field Ising model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Model Predictive Control-Based Trajectory Shaper for Safe and Efficient Adaptive Cruise Control

Recent studies show that commercially-available adaptive cruise control (ACC) systems are string-unstable, indicating that ACC-driven vehicles amplify speed fluctuations from downstream traffic and induce stop-and-go waves. Moreover, it is challenging to revise the original control algorithm of an ACC system to achieve string stability due to its internal complexity and powertrain uncertainties. To achieve desired control performance given a string-unstable ACC system and circumvent revising the original control algorithm, this study proposes a model predictive control-based trajectory shaper (MPC-TS), which only modifies the sensor-measured trajectory information (i.e., position and speed) of the preceding vehicle. The proposed MPC-TS leverages the input shaping technique to generate reference trajectory to improve string stability, while incorporating tracking errors and vehicle acceleration/deceleration magnitude in the MPC cost function and constraining fluctuations of vehicle speed and spacing to ensure desired car-following performance. Numerical experiments validate the control performance of ACC with the proposed MPC-TS in terms of string stability, safety, traffic efficiency, and comfort.

Zhou, Anye↗
DOE OSTI2021

Stochastic Gradient-Based Distributed Bayesian Estimation in Cooperative Sensor Networks

Distributed Bayesian inference provides a full quantification of uncertainty offering numerous advantages over point estimates that autonomous sensor networks are able to exploit. However, fully-decentralized Bayesian inference often requires large communication overheads and low network latency, resources that are not typically available in practical applications. In this paper, we propose a decentralized Bayesian inference approach based on stochastic gradient Langevin dynamics, which produces full posterior distributions at each of the nodes with significantly lower communication overhead. We provide analytical results on convergence of the proposed distributed algorithm to the centralized posterior, under typical network constraints. Finally, we also provide extensive simulation results to demonstrate the validity of the proposed approach.

42 ENGINEERING↗
DOE OSTI2022

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Modeling Air Handling Units to Create a Diverse Fault Dataset for FDD Innovation: Lessons Learned and Recommendations

As energy management and information systems (e.g., automated fault detection and diagnostics [AFDD] tools) become more prevalent in the commercial building stock, it is important to determine the effectiveness of these technologies by benchmarking their performance. The authors have been working to develop the largest publicly available dataset of HVAC fault datasets for performance benchmarking applications, covering the most common HVAC systems and designs including chiller plants, rooftop packaged units, dual duct air handling unit and single duct air handling units. This study covers the development, modeling, and validation of a synthetic fault dataset for the air handling unit (AHU), one of the most common HVAC configurations found in the commercial building stock. Despite this being a common system, real-world time series data are scarce and usually do not span a wide range of weather conditions. Due to this limitation, two detailed AHU models, which included the single duct AHU and dual duct AHU developed in the Modelica language and HVACSIM+ were employed to carry out annual simulations of numerous common sensor faults, mechanical faults, and control sequence faults. The fault inclusive data were then validated by comparing fault effects on system performance to expected symptoms. We summarize the nature of each fault and their impacts under different weather and operation conditions. We report some lessons learnt during the efforts of validating the high volumes of the FDD data sets. Finally, we highlight considerations for FDD developers that may want to use this dataset to assess their algorithms’ performance and their improvement over time.

Casillas, Armando↗
DOE OSTI2023

Improving the Accuracy of Variational Quantum Eigensolvers with Fewer Qubits Using Orbital Optimization

Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To date, experimental demonstrations of algorithms such as the Variational Quantum Eigensolver (VQE) have been limited to small molecules using minimal basis sets for this reason. In this work we propose incorporating an orbital optimization scheme into quantum eigensolvers wherein a parametrized partial unitary transformation is applied to the basis functions set in order to reduce the number of qubits required for a given problem. The optimal transformation is found by minimizing the ground state energy with respect to this partial unitary matrix. Through numerical simulations of small molecules up to 16 spin orbitals, we demonstrate that this method has the ability to greatly extend the capabilities of near-term quantum computers with regard to the electronic structure problem. Finally, we find that VQE paired with orbital optimization consistently achieves lower ground state energies than traditional VQE when using the same number of qubits and even frequently achieves lower ground state energies than VQE methods using more qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Analysis of a New Implicit Solver for a Semiconductor Model

Here, we present and analyze a new iterative solver for implicit discretizations of a simplified Boltzmann--Poisson system. The algorithm builds on recent work that incorporated a sweeping algorithm for the Vlasov--Poisson equations as part of nested inner-outer iterative solvers for the Boltzmann--Poisson equations. The new method eliminates the need for nesting and requires only one transport sweep per iteration. It arises as a new fixed-point formulation of the discretized system which we prove to be contractive for a given electric potential. We also derive an accelerator to improve the convergence rate for systems in the drift-diffusion regime. We numerically compare the efficiency of the new solver, with and without acceleration, against a recently developed nested iterative solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

RHOD Site - NOAA PSL Wind Retrievals WINDoe / Derived Data

This dataset contains daily NetCDF files with horizontal wind profiles retrieved with the WINDoe retrieval (Gebauer and Bell 2024) at Rhode Island (RHOD). WINDoe retrievals datasets are also available at Nantucket Island (NANT, nant.windoe.z01.c1) and Block Island (BLOC, bloc.windoe.z01.c1). WINDoe is an optimal estimation algorithm to retrieve wind profiles combining multiple instruments. The code is available in this github repository (https://github.com/OAR-atmospheric-observations/WINDoe/tree/main) and the retrieval is described by Gebauer and Bell (2024). WINDoe allows combining the individual datasets and outputs into one profile taking into account the information and uncertainties of each dataset. The use of WINDoe minimizes data gaps and maximizes data availability, compared to using wind profiles from only one of the instruments. The regular height grid eases comparisons to numerical weather prediction models. Code modifications have been made that include reading in WFIP3 specific instruments, averaging Doppler lidar radial velocities at various azimuth angles to avoid overfitting, and allowing the user to define a height grid by the user in the vipfile. The instruments used as input to the retrieval are a radar wind profiler (low- and high resolution mode) providing data in and above the boundary layer, a scanning Doppler lidar usually providing data throughout the boundary layer, a profiling lidar providing data from 50 to 200 m at BLOC and NANT, and from 10 to 280 m at Rhode Island, and a surface tower (4 m at NANT and RHOD and 10 m at BLOC). From the scanning lidars, we used radial velocity measurements at 60 deg elevation angle at six different azimuth angles with a resolution of approximately 30 m along the line of sight and the lowest range gate at approximately 70 m. The wind profiles are retrieved with WINDoe up to 3.74 km with 10 m vertical resolution. The profiles are retrieved every 15 min at BLOC and NANT and every 60 min at RHOD.

17 WIND ENERGY↗
DOE OSTI2026

BLOC Site - NOAA PSL Wind Retrievals WINDoe / Derived Data

This dataset contains daily netcdf files with horizontal wind profiles retrieved with the WINDoe retrieval (Gebauer and Bell 2024) at Block Island (BLOC). WINDoe retrievals datasets are also available at Nantucket Island (NANT, nant.windoe.z01.c1) and Rhode Island (RHOD, rhod.windoe.z01.c1). WINDoe is an optimal estimation algorithm to retrieve wind profiles combining multiple instruments. The code is available in this github repository (https://github.com/OAR-atmospheric-observations/WINDoe/tree/main), and the retrieval is described by Gebauer and Bell (2024). WINDoe allows combining the individual datasets and outputs into one profile taking into account the information and uncertainties of each dataset. The use of WINDoe minimizes data gaps and maximizes data availability, compared to using wind profiles from only one of the instruments. The regular height grid eases comparisons to numerical weather prediction models. Code modifications have been made that include reading in WFIP3 specific instruments, averaging Doppler lidar radial velocities at various azimuth angles to avoid overfitting, and allowing the user to define a height grid by the user in the vipfile. The instruments used as input to the retrieval are a radar wind profiler (low- and high resolution mode) providing data in and above the boundary layer, a scanning Doppler lidar usually providing data throughout the boundary layer, a profiling lidar providing data from 50 to 200 m at BLOC and NANT, and from 10 to 280 m at Rhode Island, and a surface tower (4 m at NANT and RHOD and 10 m at BLOC). From the scanning lidars, we used radial velocity measurements at 60 deg elevation angle at six different azimuth angles with a resolution of approximately 30 m along the line of sight and the lowest range gate at approximately 70 m. The wind profiles are retrieved with WINDoe up to 3.74 km with 10 m vertical resolution. The profiles are retrieved every 15 min at BLOC and NANT and every 60 min at RHOD.

17 WIND ENERGY↗
DOE OSTI2026

NANT Site - NOAA PSL Wind Retrievals WINDoe / Derived Data

This dataset contains daily NetCDF files with horizontal wind profiles retrieved with the WINDoe retrieval (Gebauer and Bell 2024) at Nantucket Island (NANT). WINDoe retrievals datasets are also available at Block Island (BLOC, bloc.windoe.z01.c1) and Rhode Island (RHOD, rhod.windoe.z01.c1). WINDoe is an optimal estimation algorithm to retrieve wind profiles combining multiple instruments. The code is available in this github repository (https://github.com/OAR-atmospheric-observations/WINDoe/tree/main), and the retrieval is described by Gebauer and Bell (2024). WINDoe allows combining the individual datasets and outputs into one profile taking into account the information and uncertainties of each dataset. The use of WINDoe minimizes data gaps and maximizes data availability, compared to using wind profiles from only one of the instruments. The regular height grid eases comparisons to numerical weather prediction models. Code modifications have been made that include reading in WFIP3 specific instruments, averaging Doppler lidar radial velocities at various azimuth angles to avoid overfitting, and allowing the user to define a height grid by the user in the vipfile. The instruments used as input to the retrieval are a radar wind profiler (low- and high resolution mode) providing data in and above the boundary layer, a scanning Doppler lidar usually providing data throughout the boundary layer, a profiling lidar providing data from 50 to 200 m at BLOC and NANT, and from 10 to 280 m at Rhode Island, and a surface tower (4 m at NANT and RHOD and 10 m at BLOC). From the scanning lidars, we used radial velocity measurements at 60 deg elevation angle at six different azimuth angles with a resolution of approximately 30 m along the line of sight and the lowest range gate at approximately 70 m. The wind profiles are retrieved with WINDoe up to 3.74 km with 10 m vertical resolution. The profiles are retrieved every 15 min at BLOC and NANT and every 60 min at RHOD.

17 WIND ENERGY↗
DOE OSTI2024

Multiscale Normalizing Flows for Gauge Theories

Scale separation is an important physical principle that has previously enabled algorithmic advances such as multigrid solvers. Previous work on normalizing flows has been able to utilize scale separation in the context of scalar field theories, but the principle has been largely unexploited in the context of gauge theories. This work gives an overview of a new method for generating gauge fields using hierarchical normalizing flow models. This method builds gauge fields from the outside in, allowing different parts of the model to focus on different scales of the problem. Numerical results are presented for $U(1)$ and $SU(3)$ gauge theories in 2, 3, and 4 spacetime dimensions.

Abbott, Ryan↗
DOE OSTI2020

MOCMC: Method of Characteristics Moment Closure, a Numerical Method for Covariant Radiation Magnetohydrodynamics

In this work, we present a conservative numerical method for radiation magnetohydrodynamics with frequency-dependent full transport in stationary spacetimes. This method is stable and accurate for both large and small optical depths and radiation pressures. The radiation stress–energy tensor is evolved in flux-conservative form, and closed with a swarm of samples that each transport a multigroup representation of the invariant specific intensity along a null geodesic. In each zone, the enclosed samples are used to efficiently construct a Delaunay triangulation of the unit sphere in the comoving frame, which in turn is used to calculate the Eddington tensor, average source terms, and adaptively refine the sample swarm. Furthermore, radiation four-forces are evaluated in the moment sector in a semi-implicit fashion. The radiative transfer equation is solved in invariant form deterministically for each sample. Since each sample carries a discrete representation of the full spectrum, the cost of evaluating the transport operator is independent of the number of frequency groups, representing a significant reduction of algorithmic complexity for transport in frequency-dependent problems. The major approximation we make in this work is performing scattering in an angle-averaged way. Local adaptivity in samples also makes this scheme more amenable to nonuniform meshes than a traditional Monte Carlo method. We describe the method and present results on a suite of test problems. We find that Method of Characteristics Moment Closure converges at least as ~N -1 , rather than the canonical Monte Carlo N -1/2 , where N is the number of samples per zone.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Synthesizing realistic sand assemblies with denoising diffusion in latent space

Abstract The shapes and morphological features of grains in sand assemblies have far‐reaching implications in many engineering applications, such as geotechnical engineering, computer animations, petroleum engineering, and concentrated solar power. Yet, our understanding of the influence of grain geometries on macroscopic response is often only qualitative, due to the limited availability of high‐quality 3D grain geometry data. In this paper, we introduce a denoising diffusion algorithm that uses a set of point clouds collected from the surface of individual sand grains to generate grains in the latent space. By employing a point cloud autoencoder, the three‐dimensional point cloud structures of sand grains are first encoded into a lower‐dimensional latent space. A generative denoising diffusion probabilistic model is trained to produce synthetic sand that maximizes the log‐likelihood of the generated samples belonging to the original data distribution measured by a Kullback‐Leibler divergence. Numerical experiments suggest that the proposed method is capable of generating realistic grains with morphology, shapes and sizes consistent with the training data inferred from an F50 sand database. We then use a rigid contact dynamic simulator to pour the synthetic sand in a confined volume to form granular assemblies in a static equilibrium state with targeted distribution properties. To ensure third‐party validation, 50,000 synthetic sand grains and the 1542 real synchrotron microcomputed tomography (SMT) scans of the F50 sand, as well as the granular assemblies composed of synthetic sand grains are made available in an open‐source repository.

Vlassis, Nikolaos N.↗
DOE OSTI2023

Direct implicit and explicit energy-conserving particle-in-cell methods for modeling of capacitively coupled plasma devices

Achieving large-scale kinetic modeling is a crucial task for the development and optimization of modern plasma devices. With the trend of decreasing pressure in applications, such as plasma etching, kinetic simulations are necessary to self-consistently capture the particle dynamics. The standard, explicit, electrostatic, momentum-conserving particle-in-cell method suffers from restrictive stability constraints on spatial cell size and temporal time step, requiring resolution of the electron Debye length and electron plasma period, respectively. This results in a very high computational cost, making the technique prohibitive for large volume device modeling. We investigate the direct implicit algorithm and the explicit energy conserving algorithm as alternatives to the standard approach, both of which can reduce computational cost with a minimal (or controllable) impact on results. These algorithms are implemented into the well-tested EDIPIC-2D and LTP-PIC codes, and their performance is evaluated via 2D capacitively coupled plasma discharge simulations. The investigation reveals that both approaches enable the utilization of cell sizes larger than the Debye length, resulting in a reduced runtime, while incurring only minor inaccuracies in plasma parameters. The direct implicit method also allows for time steps larger than the electron plasma period; however, care must be taken to avoid numerical heating or cooling. It is demonstrated that by appropriately adjusting the ratio of cell size to time step, it is possible to mitigate this effect to an acceptable level.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Dynamic scaling of order parameter fluctuations in model B

Brookhaven National Laboratory has performed a dedicated set of experiments, called the Beam Energy Scan (BES), with the goal of location a possible critical point in the phase diagram of nuclear matter, This point is analogous to the endpoint of the liquid-gas phase transition in water, where the liquid phase corresponds to a phase of hadrons, and the gas phase to a plasma of quarks and gluons. In order to describe the data generated by these experiments we have studied numerical simulations of the stochastic diffusion equation with a conserved charge. Here, we focus on the dynamics in the vicinity of a critical point in the Ising universality class. The model we consider is expected to describe the critical dynamics near a possible QCD critical point if the coupling of the order parameter to the momentum density of the fluid can be neglected. The simulations are performed on a spatial lattice, and the time evolution is performed using a Metropolis algorithm. We determine the dynamical critical exponent z ≃ 3.972(2), which agrees with predictions of the epsilon expansion. We also study non-equilibrium sweeps of the reduced temperature and observe approximate Kibble-Zurek scaling.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗