Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve 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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

tomoCAM : fast model-based iterative reconstruction via GPU acceleration and non-uniform fast Fourier transforms

X-ray-based computed tomography is a well established technique for determining the three-dimensional structure of an object from its two-dimensional projections. In the past few decades, there have been significant advancements in the brightness and detector technology of tomography instruments at synchrotron sources. These advancements have led to the emergence of new observations and discoveries, with improved capabilities such as faster frame rates, larger fields of view, higher resolution and higher dimensionality. These advancements have enabled the material science community to expand the scope of tomographic measurements towards increasingly in situ and in operando measurements. In these new experiments, samples can be rapidly evolving, have complex geometries and restrictions on the field of view, limiting the number of projections that can be collected. In such cases, standard filtered back-projection often results in poor quality reconstructions. Iterative reconstruction algorithms, such as model-based iterative reconstructions (MBIR), have demonstrated considerable success in producing high-quality reconstructions under such restrictions, but typically require high-performance computing resources with hundreds of compute nodes to solve the problem in a reasonable time. Here, tomoCAM , is introduced, a new GPU-accelerated implementation of model-based iterative reconstruction that leverages non-uniform fast Fourier transforms to efficiently compute Radon and back-projection operators and asynchronous memory transfers to maximize the throughput to the GPU memory. The resulting code is significantly faster than traditional MBIR codes and delivers the reconstructive improvement offered by MBIR with affordable computing time and resources. tomoCAM has a Python front-end, allowing access from Jupyter -based frameworks, providing straightforward integration into existing workflows at synchrotron facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

A Bilevel Voltage Regulation Operation for Distribution Systems With Self-Operated Microgrids

The emerging of microgrids in distribution systems has significantly enhanced the resilience of power grids. However, the operators of a distribution system and microgrids therein can be different and have accessibility to different devices. To model the operation of such a grid, this work proposes a bilevel formulation and probes into the voltage regulation operation, considering the interaction between different systems. The proposed bilevel formulation considers the cooperation of active energy resources (AER), transformer tap-changers, and capacitor banks that are controlled by different operators. To facilitate the solution time of the target bilevel optimization, the lower-level problems with different objectives are modeled using deep neural networks (DNNs) which are then converted into a set of constraints. Hence, the bilevel problem can be reformed to a single-level problem. Lastly, the proposed solution procedures are validated using a customized joint system constructed by the IEEE 123-bus system and a real distribution system in Iowa. According to the numerical validation results, the solution time of the proposed nonlinear activation function based DNN model is 69 times faster than other methods in solving voltage regulation with a bilevel structure.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Collisional Effects on Electron Trajectories in Crossed-Field Devices

Crossed-field diodes (CFDs) are used in multiple high-power applications and are characterized by an applied magnetic field orthogonal to the electric field, induced by the applied voltage across the anode-cathode gap. In vacuum, the Hull cutoff magnetic field (HCMF) represents the maximum applied magnetic field for which an electron from the cathode can reach the anode. This study investigates the effects of non-vacuum conditions on electron trajectories by introducing electron mobility, which represents particle collisions. We used numerical solutions of the electron force law and particle-in-cell simulations (XPDP1) to assess electron motion for various electron mobilities. For magnetic fields above the HCMF in vacuum, reducing the electron mobility increases the time for an electron emitted from the cathode to reach the anode. Reducing mobility below 22 C s/kg eliminates the HCMF for any magnetic field, meaning that an emitted electron will always cross the gap. We derived the magnetic field, mobility, and electron transit time corresponding to this condition by solving for the condition when the electron velocity in the direction across the anode-cathode gap going to zero at the anode. A parametric study of these conditions using theory and XPDP1 is performed under different gap distances, voltages, and magnetic fields.

42 ENGINEERING↗
DOE OSTI2020

Wake steering optimization under uncertainty

Turbines in wind power plants experience significant power losses when wakes from upstream turbines affect the energy production of downstream turbines. A promising plant-level control strategy to reduce these losses is wake steering, where upstream turbines are yawed to direct wakes away from downstream turbines. However, there are significant uncertainties in many aspects of the wake steering problem. For example, infield sensors do not give perfect information, and inflow to the plant is complex and difficult to forecast with available information, even over short time periods. Here, we formulate and solve an optimization under uncertainty (OUU) problem for determining optimal plant-level wake steering strategies in the presence of independent uncertainties in the direction, speed, turbulence intensity, and shear of the incoming wind, as well as in turbine yaw positions. The OUU wake steering strategy is first examined for a two-turbine test case to explore the impacts of different types of inflow uncertainties, and it is then demonstrated for a more realistic 11-turbine wind power plant. Of the sources of uncertainty considered, we find that wake steering strategies are most sensitive to uncertainties in the wind speed and direction. When maximizing expected power production, the OUU strategy also tends to favor smaller yaw angles, which have been shown in previous work to reduce turbine loading. Ultimately, the plant-level wake steering strategy formulated using an OUU approach yields 0.48?% more expected annual energy production for the 11-turbine wind plant than a strategy that neglects uncertainty when considering stochastic inputs. Thus, not only does the present OUU strategy produce more power in realistic conditions, but it also reduces risk by prescribing strategies that call for less extreme yaw angles.

17 WIND ENERGY↗
DOE OSTI2020

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

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 OSTI2021

A general approach to seismic inversion with automatic differentiation

Imaging Earth structure or seismic sources from seismic data involves minimizing a target misfit function, and is commonly solved through gradient-based optimization. The adjoint-state method has been developed to compute the gradient efficiently; however, its implementation can be time-consuming and difficult. We develop a general seismic inversion framework to calculate gradients using reverse-mode automatic differentiation. The central idea is that adjoint-state methods and reverse-mode automatic differentiation are mathematically equivalent. Here, the mapping between numerical PDE simulation and deep learning allows us to build a seismic inverse modeling library, ADSeismic, based on deep learning frameworks, which supports high performance reverse-mode automatic differentiation on CPUs and GPUs. We demonstrate the performance of ADSeismic on inverse problems related to velocity model estimation, rupture imaging, earthquake location, and source time function retrieval. ADSeismic has the potential to solve a wide variety of inverse modeling applications within a unified framework.

58 GEOSCIENCES↗
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2021

Meshless discretization of the discrete-ordinates transport equation with integration based on Voronoi cells

The time-dependent, gray, linear radiation transport equation is discretized using the meshless local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends on the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. The results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A vortex sheet based analytical model of the curled wake behind yawed wind turbines

Motivated by the need for compact descriptions of the evolution of non-classical wakes behind yawed wind turbines, we develop an analytical model to predict the shape of curled wakes. Interest in such modelling arises due to the potential of wake steering as a strategy for mitigating power reduction and unsteady loading of downstream turbines in wind farms. We first estimate the distribution of the shed vorticity at the wake edge due to both yaw offset and rotating blades. By considering the wake edge as an ideally thin vortex sheet, we describe its evolution in time moving with the flow. Vortex sheet equations are solved using a power series expansion method, and an approximate solution for the wake shape is obtained. The vortex sheet time evolution is then mapped into a spatial evolution by using a convection velocity. Apart from the wake shape, the lateral deflection of the wake including ground effects is modelled. Our results show that there exists a universal solution for the shape of curled wakes if suitable dimensionless variables are employed. For the case of turbulent boundary layer inflow, the decay of vortex sheet circulation due to turbulent diffusion is included. Finally, we modify the Gaussian wake model by incorporating the predicted shape and deflection of the curled wake, so that we can calculate the wake profiles behind yawed turbines. Model predictions are validated against large-eddy simulations and laboratory experiments for turbines with various operating conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Development of ML FPGA Filter for Particle Identification and Tracking in Real Time

Real-time data processing is a frontier field in experimental particle physics. Machine Learning methods are widely used and have proven to be very powerful in particle physics. The growing computational power of modern FPGA boards allows us to add more sophisticated algorithms for real time data processing. Many tasks could be solved using modern Machine Learning (ML) algorithms which are naturally suited for FPGA architectures. The FPGA-based machine learning algorithm provides an extremely low, sub-microsecond, latency decision and makes information-rich data sets for event selection. We report work has started to evaluate an FPGA based Machine Learning (ML) algorithm for a real-time particle identification and tracking with Transition Radiation Detector (TRD) and e/m calorimeter. The first target is the GlueX experiment, with a plan to build a TRD based on GEM technology. GlueX trigger latency is 3.3 μs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Advancing simulations of coupled electron and phonon nonequilibrium dynamics using adaptive and multirate time integration

Electronic structure calculations in the time domain provide a deeper understanding of nonequilibrium dynamics in materials. The real-time Boltzmann equation (rt-BTE), used in conjunction with accurate interactions computed from first principles, has enabled reliable predictions of coupled electron and lattice dynamics. However, the timescales and system sizes accessible with this approach are still limited, with two main challenges being the different timescales of electron and phonon interactions and the cost of computing collision integrals. As a result, only a few examples of these calculations exist, mainly for two-dimensional (2D) materials. Here we leverage adaptive and multirate time integration methods to achieve a major step forward in solving the coupled rt-BTEs for electrons and phonons. Relative to conventional (non-adaptive) time-stepping, our approach achieves a 10x speedup for a target accuracy, or greater accuracy by 3–6 orders of magnitude for the same computational cost, enabling efficient calculations in both 2D and bulk materials. This efficiency is showcased by computing the coupled electron and lattice dynamics in graphene up to ~100 ps, as well as modeling ultrafast lattice dynamics and thermal diffuse scattering maps in bulk materials (silicon and gallium arsenide). In addition to improved efficiency, our adaptive method can resolve the characteristic rates of different physical processes, thus naturally bridging different timescales. This enables simulations of longer timescales and provides a framework for modeling multiscale dynamics of coupled degrees of freedom in matter. Our work opens new opportunities for quantitative studies of nonequilibrium physics in materials, including driven lattice dynamics with phonons coupled to electrons, spin, and other degrees of freedom.

Yao, Jia [California Institute of Technology (CalT↗
DOE OSTI2020

Quandary

Quandary numerically simulates and optimizes the time-evolution of open quantum systems. The underlying dynamics are modelled by Lindblad's master equation, a linear ordinary differential equation (ODE) describing quantum systems interacting with the environment. Quandary solves this ODE numerically by applying a time-stepping integration scheme, and utilizes a gradient-based optimization approach to determine optimal control pulses that drive the quantum system to a desired target state. Two optimization objectives are considered: (a) Unitary gate optimization that finds controls to realize a unitary gate transformation, and (b) optimal reset that aims to drive the quantum system to the ground states. Gradient-based optimization schemes utilizing Petsc's Tao optimization package are applied to generate control pulses that minimize the respective measure. To evaluate the gradient of the objective function, the discrete adjoint method is used while leveraging techniques from Algorithmic Differentiation to produce exact and consistent gradients. To mitigate excessive execution run times, the software can be build together with the XBraid software library which provides a parallelization strategy to distribute the time-evolution of the underlying dynamics onto multiple processor.

Petersson, NilsA.↗
DOE OSTI2024

Analytic bounds on late-time axion-scalar cosmologies

The cosmological dynamics of multiple scalar/pseudoscalar fields are difficult to solve, especially when the field-space metric is curved. This presents a challenge in determining whether a given model can support cosmic acceleration, without solving for the on-shell solution. In this work, we present bounds on late-time FLRW-cosmologies in classes of theories that involve arbitrary numbers of scalar and pseudoscalar fields coupled both kinetically (leading to a curved field space metric) and through scalar potentials. Such bounds are proven analytically, independently of initial conditions, with no approximation in the field equations and without referring to explicit solutions. Besides their broad applications to cosmological model building, our bounds can be applied to studying asymptotic cosmologies of certain classes of string compactifications.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Space-Time Reduced-Order Modeling for Uncertainty Quantification

This work focuses on the space-time reduced-order modeling (ROM) method for solving large-scale uncertainty quantification (UQ) problems with multiple random coefficients. In contrast with the traditional space ROM approach, which performs dimension reduction in the spatial dimension, the space-time ROM approach performs dimension reduction on both the spatial and temporal domains, and thus enables accurate approximate solutions at a low cost. We incorporate the space-time ROM strategy with various classical stochastic UQ propagation methods such as stochastic Galerkin and Monte Carlo. Numerical results demonstrate that our methodology has significant computational advantages compared to state-of-the-art ROM approaches. By testing the approximation errors, we show that there is no obvious loss of simulation accuracy for space-time ROM given its high computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Realistic Theory of Quantum Measurement

Abstract We propose that the ontic understanding of quantum mechanics can be extended to a fully realistic theory that describes the evolution of the wavefunction at all times, including during a measurement. In such an approach the wave equation should reduce to the standard wave equation when there is no measurement, and describe state reduction when the system is measured. The general wave equation must be nonlinear and nonlocal, and we require it to be time-symmetric; consequently, this approach is not a new interpretation but a new theory. The wave equation is an integrodifferential equation (IDE). The time symmetry requirement leads to a retrocausal approach, in which the wave equation is solved subject to initial and final conditions to determine history at intermediate times. We propose that different outcomes from (apparently) identically prepared experiments may result from uncontrolled parameters; both the nonlocality and the retrocausality of the theory imply that Bell’s Theorem cannot rule out such “hidden variables.” Beginning with Hamilton’s principle, we demonstrate the construction of such a theory by replacing the action with a functional designed to give rise to a nonlinear, nonlocal IDE as the wave equation. This IDE reduces to the standard wave equation (a differential equation) in the absence of a measurement, but exhibits state reduction to a single eigenvalue when the system interacts with another system with the properties of a measurement apparatus. We demonstrate several desirable features of this theory; for other properties we indicate their plausibility and possible avenues to a proof.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Physics-Informed Gaussian Process Regression for States Estimation and Forecasting in Power Grids

Real-time state estimation and forecasting are critical for the efficient operation of power grids. In this paper, a physics-informed Gaussian process regression (PhI-GPR) method is presented and used for forecasting and estimating the phase angle, angular speed, and wind mechanical power of a three-generator power grid system using sparse measurements. In standard data-driven Gaussian process regression (GPR), parameterized models for the prior statistics are fit by maximizing the marginal likelihood of observed data. In the PhI-GPR method, we propose to compute the prior statistics offline by solving stochastic differential equations (SDEs) governing the power grid dynamics. The short-term forecast of a power grid system dominated by wind generation is complicated by the stochastic nature of the wind and the resulting uncertainty in wind mechanical power. Here, we assume that the power grid dynamics are governed by swing equations, with the wind mechanical power fluctuating randomly in time. We solve these equations for the mean and covariances of the power grid states using the Monte Carlo simulation method. We demonstrate that the proposed PhI-GPR method can accurately forecast and estimate observed and unobserved states. For the considered problem, PhI-GPR has computational advantages over the ensemble Kalman filter (EnKF) method: In PhI-GPR, ensembles are computed offline and independently of the data acquisition process, whereas for EnFK, ensembles are computed online with data acquisition, rendering real-time forecast more challenging. We also demonstrate that the PhI-GPR forecast is more accurate than the EnKF forecast when the random mechanical wind power is non-Markovian. In contrast, the two methods produce similar forecasts for the Markovian mechanical wind power. For observed states, we show that PhI-GPR provides a forecast comparable to the standard data-driven GPR; both forecasts are significantly more accurate than the autoregressive integrated moving average (ARIMA) forecast. We also show that the ARIMA forecast is more sensitive to observation frequency and measurement errors than the PhI-GPR forecast.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Performance Comparison of Object Detection Networks for Shrapnel Identification in Ultrasound Images

Ultrasound imaging is a critical tool for triaging and diagnosing subjects but only if images can be properly interpreted. Unfortunately, in remote or military medicine situations, the expertise to interpret images can be lacking. Machine-learning image interpretation models that are explainable to the end user and deployable in real time with ultrasound equipment have the potential to solve this problem. We have previously shown how a YOLOv3 (You Only Look Once) object detection algorithm can be used for tracking shrapnel, artery, vein, and nerve fiber bundle features in a tissue phantom. However, real-time implementation of an object detection model requires optimizing model inference time. Here, we compare the performance of five different object detection deep-learning models with varying architectures and trainable parameters to determine which model is most suitable for this shrapnel-tracking ultrasound image application. We used a dataset of more than 16,000 ultrasound images from gelatin tissue phantoms containing artery, vein, nerve fiber, and shrapnel features for training and evaluating each model. Every object detection model surpassed 0.85 mean average precision except for the detection transformer model. Overall, the YOLOv7tiny model had the higher mean average precision and quickest inference time, making it the obvious model choice for this ultrasound imaging application. Other object detection models were overfitting the data as was determined by lower testing performance compared with higher training performance. In summary, the YOLOv7tiny object detection model had the best mean average precision and inference time and was selected as optimal for this application. Next steps will implement this object detection algorithm for real-time applications, an important next step in translating AI models for emergency and military medicine.

60 APPLIED LIFE SCIENCES↗