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 487 records · Page 27

Uncertainty based Online Ensemble on Non-Stationary Data for Fusion Science

Machine Learning (ML) is poised to play a pivotal role in the development and operation of next-generation fusion devices. Fusion data shows non-stationary behavior due to drifts in the data. The drifts can arise from both experimental evolution and machine wear-and-tear. ML models assume stationary distribution and fail to maintain performance when encountered with non-stationary data streams.Online learning can be used to continuously adapt the models with new data as it is acquired. However, traditional online learning can suffer from short-term performance degradation, as ground truth are not available before making the prediction. To address this challenge, we propose uncertainty aware ensemble approach for online learning. We use Deep Gaussian Process Approximation (DGPA) technique for calibrated uncertainty estimation and use the uncertainty values to guide a meta-algorithm that produces predictions based on ensemble of learners. Moreover, DGPA also provides uncertainty estimation along with the predictions for decision makers. This paper demonstrates that the proposed method outperforms traditional online learning approach, and a naive ensemble without uncertainty guidance by about 7% and 6%, respectively, on B-coil deflection prediction at DIII-D Fusion Facility.

Rajput, Kishansingh [Thomas Jefferson National Acc↗

Physically interpretable approximations of many-body spectral functions

The rational function approximation provides a natural and interpretable representation of response functions such as the many-body spectral functions. We apply the vector fitting (VFIT) algorithm to fit a variety of spectral functions calculated from the Holstein model of electron-phonon interactions. We show that the resulting rational functions are highly efficient in their fitting of sharp features in the spectral functions, and could provide a means to infer physically relevant information from a spectral data set. The position of the peaks in the approximated spectral function are determined by the location of poles in the complex plane. Additionally, we developed a variant of VFIT that incorporates regularization to improve the quality of fits. With this procedure, we demonstrate it is possible to achieve accurate spectral function fits that vary smoothly as a function of physical conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗

Metaplectic geometrical optics for ray-based modeling of caustics: Theory and algorithms

The optimization of radio frequency-wave (RF) systems for fusion experiments is often performed using ray-tracing codes, which rely on the geometrical-optics (GO) approximation. However, GO fails at caustics such as cutoffs and focal points, erroneously predicting the wave intensity to be infinite. This is a critical shortcoming of GO, since the caustic wave intensity is often the quantity of interest, e.g., RF heating. Full-wave modeling can be used instead, but the computational cost limits the speed at which such optimizations can be performed. Here, we have developed a less expensive alternative called metaplectic geometrical optics (MGO). Instead of evolving waves in the usual x (coordinate) or k (spectral) representation, MGO uses a mixed X$\equiv$Ax+Bk representation. By continuously adjusting the matrix coefficients A and B along the rays, one can ensure that GO remains valid in the X coordinates without caustic singularities. The caustic-free result is then mapped back onto the original x space using metaplectic transforms. Here, we overview the MGO theory and review algorithms that will aid the development of an MGO-based ray-tracing code. We show how using orthosymplectic transformations leads to considerable simplifications compared to previously published MGO formulas. We also prove explicitly that MGO exactly reproduces standard GO when evaluated far from caustics (an important property that until now has only been inferred from numerical simulations), and we relate MGO to other semiclassical caustic-removal schemes published in the literature. Finally this discussion is then augmented by an explicit comparison of the computed spectrum for a wave bounded between two cutoffs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow: Preprint

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗

Decentralized Low-Rank State Estimation for Power Distribution Systems

This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.

41 EE - Solar Energy Technologies Office (EE-4S)↗

FIB-ToF-SIMS characterization of irradiated U-10Zr

Post-irradiation examination (PIE) is critical for the performance assessment and qualification of nuclear fuels. Secondary ion mass spectrometry (SIMS) is a powerful materials characterization technique that allows for elemental and isotopic mapping with a depth resolution greater than EDS and EPMA. However, it has not yet been applied to PIE of metallic nuclear fuel. Here, in this work, we characterize an fast neutron spectrum irradiated U-10Zr fuel sample using a time-of-flight SIMS (ToF-SIMS) system connected to a FIB/SEM system, which allows for flexible sample analysis compared to a dedicated ToF-SIMS instrument. Analysis of the resulting hyperspectral micrograph data was aided by the development of an unsupervised machine learning (ML) algorithm that iterates on existing methods to segment the 3D micrographic datasets based on the similarity of mass spectra. The results showed that the FIB-ToF-SIMS instrument was potentially capable of spatially resolving closed fission gas bubbles in 3D by continued ion sputtering of the analyzed volume. Additionally, the ML algorithm proved useful in revealing the chemical segregation of light fission products (those with an atomic mass between approximately 85–105 amu, such as ruthenium and rhodium) plus matrix zirconium, heavy fission products (those with an atomic mass between approximately 135–150 amu, such as the lanthanides) and uranium. Future studies are planned to conduct FIB-ToF-SIMS analysis on more irradiated U-Zr samples to study the constituent redistribution.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Operation of the ATLAS trigger system in Run 2

The ATLAS experiment at the Large Hadron Collider employs a two-level trigger system to record data at an average rate of 1 kHz from physics collisions, starting from an initial bunch crossing rate of 40 MHz. During the LHC Run 2 (2015–2018), the ATLAS trigger system operated successfully with excellent performance and flexibility by adapting to the various run conditions encountered and has been vital for the ATLAS Run-2 physics programme. For proton-proton running, approximately 1500 individual event selections were included in a trigger menu which specified the physics signatures and selection algorithms used for the data-taking, and the allocated event rate and bandwidth. The trigger menu must reflect the physics goals for a given data collection period, taking into account the instantaneous luminosity of the LHC and limitations from the ATLAS detector readout, online processing farm, and offline storage. This document discusses the operation of the ATLAS trigger system during the nominal proton-proton data collection in Run 2 with examples of special data-taking runs. Aspects of software validation, evolution of the trigger selection algorithms during Run 2, monitoring of the trigger system and data quality as well as trigger configuration are presented.

43 PARTICLE ACCELERATORS↗

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗

L-BFGS Class Implementation in C++

This report presents a header-only C++ class implementation of the Limited-memory BroydenFletcher-Goldfarb-Shanno (L-BFGS) algorithm. The L-BFGS method is a general purpose quasi-Netwon optimization method that builds an approximation of the descent direction from consecutive iterate and gradient vectors. The limited-memory aspect stems from the replacement of the N × N approximation matrix of the original BFGS method with M vectors of length N. An example usage of the class is included along with the reference source code.

97 MATHEMATICS AND COMPUTING↗

Design and Manufacturing of High Performance, Reduced Charge Heat Exchangers

Air-to-fluid heat exchangers (HXs) play a critical role as the main heat transfer component in Heating, Ventilation, Air-Conditioning, and Refrigeration (HVAC&R) systems. However, their airside thermal resistance significantly inhibits their overall performance. Furthermore, these HXs must be continually more compact to meet the latest refrigerant charge limits to reduce emissions. Recent literature suggests that traditional HX geometries (e.g., round or flat tubes with fins), have reached their limits, and more sophisticated shape- and topology-optimized designs are required to achieve the next jump in performance. This research sheds light on the next generation of air-to-refrigerant HXs and aims to address several practical issues to commercialization such as novelty challenges (improved performance for significant charge reduction; modeling expertise & time investment), manufacturing challenges (non-round tube manufacturing; tube-header integration; product qualification, e.g., burst pressure testing, extreme operational environment, etc.), and operational challenges (flow maldistribution, fouling & wetting, noise & vibration). For example, a >20% improvement on one (or more) HX-level performance metrics (e.g., envelope volume, airside pressure drop, face area, capacity, refrigerant charge, weight, cost, etc.) must be achieved before a HX design is considered for commercialization. We present a new, comprehensive and experimentally validated air-to-refrigerant HX optimization framework with simultaneous thermal-hydraulic performance and mechanical strength considerations for novel, non-round, shape- and topology-optimized tubes capable of optimizing single and two-phase HX designs for any refrigerant choice and performance requirement with significant engineering time savings compared to conventional design practices. The framework was exercised for a wide range of applications and refrigerants, resulting in HXs which achieved greater than 20% improved performance, 20% reductions in size, and 25% reductions in refrigerant charge. To enable non-round tube bundle use in next generation HVAC&R equipment, novel manufacturing techniques were investigated, including the development of conventional manufacturing methods for small diameter, non-round tubes and novel tube-header integration strategies. In total, ten HX prototypes were manufactured, nine using conventional methods directly attributed to this project and one using advanced additive manufacturing methods. The five-year manufacturing feasibility of the proposed HXs was found to have a good outlook. The non-round tube HX simulated performance was validated through comprehensive experimental testing, including nine in-house component-level tests, one independent component-level test at an industry partner laboratory, and in-house system-level tests of using a commercially-available, residential packaged A/C unit which was retrofitted with a non-round tube prototype HX. It was found that HX designs proposed by the new framework can successfully predict experimental thermal-hydraulic performance within ±10-20% the first time with no manual design changes, eliminating the need for time-consuming and expensive prototyping efforts. This work will accelerate design and time to market for next generation HXs while simultaneously facilitating industry transition to new refrigerants at lower charge.

42 ENGINEERING↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer

There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We introduce a new circuit optimizer called AQCEL, which aims to remove redundant controlled operations from controlled gates, depending on initial states of the circuit. Especially, the AQCEL can remove unnecessary qubit controls from multi-controlled gates in polynomial computational resources, even when all the relevant qubits are entangled, by identifying zero-amplitude computational basis states using a quantum computer. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. For this benchmark, we have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates. Moreover, when deploying AQCEL with a noisy intermediate scale quantum computer, it efficiently produces a quantum circuit that approximates the original circuit with high fidelity by truncating low-amplitude computational basis states below certain thresholds. Our technique is useful for a wide variety of quantum algorithms, opening up new possibilities to further simplify quantum circuits to be more effective for real devices.

97 MATHEMATICS AND COMPUTING↗

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗