Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 433 records · Page 24

Annealed Importance Sampling Reversible Jump MCMC algorithms

It will soon be 20 years since reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithms have been proposed. They have significantly extended the scope of Markov chain Monte Carlo simulation methods, offering the promise to be able to routinely tackle transdimensional sampling problems, as encountered in Bayesian model selection problems for example, in a principled and flexible fashion. Their practical efficient implementation, however, still remains a challenge. A particular difficulty encountered in practice is in the choice of the dimension matching variables (both their nature and their distribution) and the reversible transformations which allow one to define the one-to-one mappings underpinning the design of these algorithms. Indeed, even seemingly sensible choices can lead to algorithms with very poor performance. The focus of this paper is the development and performance evaluation of a method, annealed importance sampling RJ-MCMC (aisRJ), which addresses this problem by mitigating the sensitivity of RJ-MCMC algorithms to the aforementioned poor design. As we shall see the algorithm can be understood as being an “exact approximation” of an idealized MCMC algorithm that would sample from the model probabilities directly in a model selection set-up. Such an idealized algorithm may have good theoretical convergence properties, but typically cannot be implemented, and our algorithms can approximate the performance of such idealized algorithms to an arbitrary degree while not introducing any bias for any degree of approximation. Our approach combines the dimension matching ideas of RJ-MCMC with annealed importance sampling and its Markov chain Monte Carlo implementation. We illustrate the performance of the algorithm with numerical simulations which indicate that, although the approach may at first appear computationally involved, it is in fact competitive.

annealed importance sampling↗

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗

On Maximal Hard-Core Thinnings of Stationary Particle Processes

The present paper studies existence and distributional uniqueness of subclasses of stationary hard-core particle systems arising as thinnings of stationary particle processes. These subclasses are defined by natural maximality criteria. We investigate two specific criteria, one related to the intensity of the hard-core particle process, the other one being a local optimality criterion on the level of realizations. In fact, the criteria are equivalent under suitable moment conditions. We show that stationary hard-core thinnings satisfying such criteria exist and are frequently distributionally unique. More precisely, distributional uniqueness holds in subcritical and barely supercritical regimes of continuum percolation. Additionally, based on the analysis of a specific example, we argue that fluctuations in grain sizes can play an important role for establishing distributional uniqueness at high intensities. Finally, we provide a family of algorithmically constructible approximations whose volume fractions are arbitrarily close to the maximum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Estimating Energy Market Schedules using Historical Price Data

The global climate crisis is expected to reshape the energy generation landscape in the coming decades. Increasing integration of non-dispatchable renewable energy resources into energy infrastructures and markets creates uncertainty as well as new opportunities for flexible energy systems. To conduct proper economic evaluation of flexible energy systems, such as integrated energy systems (IES), advancements in modelling of market interactions, such as bidding, is crucial. This work presents a shortcut algorithm which uses two mixed integer linear programs to compute dispatch schedules (e.g., hourly power production targets) that are constrained by the resource's bid information and characteristics (e.g., minimum up and down times) based on historical locational marginal price (LMP) data. The proposed algorithm is approximately 100 times faster and uses orders of magnitude less data than a full production cost model (PCM). We find the shortcut simulator recapitulates generator dispatch signals for the Prescient PCM with approximately 4% error for the RTS-GMLC test system.

electricity generation↗

Reduced-order modeling through machine learning and graph-theoretic approaches for brittle fracture applications

Typically, thousands of computationally expensive micro-scale simulations of brittle crack propagation are needed to upscale lower length scale phenomena to the macro-continuum scale. Running such a large number of crack propagation simulations presents a significant computational challenge, making reduced-order models (ROMs) attractive for this task. Here, the ultimate goal of this research is to develop ROMs that have sufficient accuracy and low computational cost so that these upscaling simulations can be readily performed. However, constructing ROMs for these complex simulations presents its own challenge. Here, we present and compare four different approaches for reduced-order modeling of brittle crack propagation in geomaterials. These methods rely on machine learning (ML) and graph-theoretic algorithms to approximate key aspects of the brittle crack problem. These methods also incorporate different physics-based assumptions in order to reduce the training requirements while maintaining accurate physics as much as possible. Results from the ROMs are directly compared against a high-fidelity model of brittle crack propagation. Further, the strengths and weaknesses of the ROMs are discussed, and we conclude that combining smart physics-informed feature engineering with highly trainable ML models provides the best performance. The ROMs considered here have computational costs that are orders-of-magnitude less than the cost associated with high-fidelity physical models while maintaining good accuracy.

36 MATERIALS SCIENCE↗

Stress field analysis in a stony meteorite under thermal fatigue and mechanical loadings

A micromechanical approach relying on 3D image-based finite element (FE) models, together with experimental testing, is employed to investigate the stress distribution in an L6 ordinary chondrite's microstructure subjected to thermal and mechanical loadings. An in-situ X-ray micro-computed tomography (micro-CT) setup capable of applying thermal and mechanical loads shed light on crack initiation mechanisms in chondrite samples. Micro-CT images were further used to reconstruct realistic microstructural models of the samples, which were transformed into FE models using an automated non-iterative mesh generation algorithm. FE approximation of stress fields showed that under mechanical loads, the stress often concentrates in matrix-particle interfacial regions with higher curvatures. Furthermore, this could result in the nucleation and eventually propagation of cracks in such regions. However, when the thermal cycling takes place, the stress concentrates more uniformly along with particle interfaces, resulting in their debonding from the surrounding matrix. Both observations were verified by experimental data obtained from in-situ micro-CT imaging.

36 MATERIALS SCIENCE↗

A Fourier-series-based kernel-independent fast multipole method

We present in this paper a new kernel-independent fast multipole method (FMM), named as FKI-FMM, for pairwise particle interactions with translation-invariant kernel functions. FKI-FMM creates, using numerical techniques, sufficiently accurate and compressive representations of a given kernel function over multi-scale interaction regions in the form of a truncated Fourier series. It provides also economic operators for the multipole-to-multipole, multipole-to-local, and local-to-local translations that are typical and essential in the FMM algorithms. The multipole-to-local translation operator, in particular, is readily diagonal and does not dominate in arithmetic operations. FKI-FMM provides an alternative and competitive option, among other kernel-independent FMM algorithms, for an efficient application of the FMM, especially for applications where the kernel function consists of multi-physics and multi-scale components as those arising in recent studies of biological systems. We present the complexity analysis and demonstrate with experimental results the FKI-FMM performance in accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗

Automated co-adding and energy calibration of large array microcalorimeter data with zero sample knowledge

State-of-the-art microcalorimeter spectrometers now contain large detector arrays with hundreds of individual pixels. Each individual pixel outputs a unique and non-linear response with respect to deposited energy. This work describes a pattern-recognition algorithm to combine these responses into a single energy-calibrated histogram, referred to as co-adding pixels. Photo-peaks from different pixels are matched together based upon how well the match aligns the centroids and heights of neighboring peaks. This usually results in around 100 co-adding calibration points from 30 to 300 keV for a several day acquisition of plutonium items with masses between 0.5 and 10 grams. An additional algorithm energy-calibrates this co-added spectrum using the fluoresced K x-ray emissions from a tantalum absorber and inherent x-ray escape peaks from the tin absorbers. Both algorithms operate without knowledge of the source and are fully automated. This work presents results from the acquisitions of high and low burnup plutonium, 10% enriched uranium, a 153 Gd calibration source, and a 57 Co+ 166m Ho calibration source. In all measurements, resolution defined as the full-width at half-maximum (FWHM) of photo-peaks is preserved between the individual pixel and co-added spectra at around 65 eV for incident photon energies between 60 and 208 keV. The energy calibration algorithm is approximate and yields a calibration curve off by an average of around 200 eV for incident photon energies between 60 and 208 keV.

47 OTHER INSTRUMENTATION↗

Wave forecast and its application to the optimal control of offshore floating wind turbine for load mitigation

Control algorithms play an important role in energy capture and load mitigation for offshore floating wind turbines (OFWTs). One of the advanced and effective control techniques is the feedforward or model predictive control approach, which requires the forecast of incoming environment conditions. For OFWTs, wave loading is one of the dominant sources to excite structural responses. This study is thus motivated to develop forecasting algorithms for wave elevations and wave excitation forces with the purpose of applying feedforward controllers on OFWTs. Two forecasting algorithms, the approximate Prony Method based on ESPRIT (Estimation of Signal Parameters via Rotational Invariance Techniques) and SVM (Support Vector Machine) regression, are developed and validated using wave records from tank tests. Utilizing the forecasted wave elevations and wave excitation forces, a feedforward LQR controller is designed to mitigate structural loads of an OFWT system.

17 WIND ENERGY↗

Multicomponent Cholesky Decomposition: Application to Nuclear–Electronic Orbital Theory

The Cholesky decomposition technique is commonly used to reduce the memory requirement for storing two-particle repulsion integrals in quantum chemistry calculations that use atomic orbital bases. However, when quantum methods use multicomponent bases, such as nuclear–electronic orbitals, additional challenges are introduced due to asymmetric two-particle integrals. This work proposes several multicomponent Cholesky decomposition methods for calculations using nuclear–electronic orbital density functional theory. To analyze the errors in different Cholesky decomposition components, benchmark calculations using water clusters are carried out. The largest benchmark calculation is a water cluster (H 2 O) 27 where all 54 protons are treated quantum mechanically. Furthermore, this study provides energetic and complexity analyses to demonstrate the accuracy and performance of the proposed multicomponent Cholesky decomposition method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coupled Cluster Theory on Graphics Processing Units I. The Coupled Cluster Doubles Method

The coupled cluster (CC) ansatz is generally recognized as providing one of the best wave function-based descriptions of electronic correlation in small- and medium-sized molecules. The fact that the CC equations with double excitations (CCD) may be expressed as a handful of dense matrix-matrix multiplications makes it an ideal method to be ported to graphics processing units (GPUs). Here we present our implementation of the spin-free CCD equations in which the entire iterative procedure is evaluated on the GPU. The GPU-accelerated algorithm readily achieves a factor of 4-5 speedup relative to the multithreaded CPU algorithm on same-generation hardware. The GPU-accelerated algorithm is approximately 8-12 times faster than Molpro, 17-22 times faster than NWChem, and 21-29 times faster than GAMESS for each CC iteration. Single-precision GPU-accelerated computations are also performed, leading to an additional doubling of performance. Single-precision errors in the energy are typically on the order of 10 -6 hartrees and can be improved by about an order of magnitude by performing one additional iteration in double precision.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scaling quantum approximate optimization on near-term hardware

The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

97 MATHEMATICS AND COMPUTING↗

Numerical Experiments with a Continuous L{sub 2}-exponential Merit Function for Semi-Infinite Programming

Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L{sub 2}-exponential merit function. The proposed merit function is continuous for SIP and improves the algorithm efficiency when compared with other previously tested merit functions. A comparison with other reduction methods is also included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A H-infinity Fault Detection and Diagnosis Scheme for Discrete Nonlinear System Using Output Probability Density Estimation

In this paper, a H-infinity fault detection and diagnosis (FDD) scheme for a class of discrete nonlinear system fault using output probability density estimation is presented. Unlike classical FDD problems, the measured output of the system is viewed as a stochastic process and its square root probability density function (PDF) is modeled with B-spline functions, which leads to a deterministic space-time dynamic model including nonlinearities, uncertainties. A weighting mean value is given as an integral function of the square root PDF along space direction, which leads a function only about time and can be used to construct residual signal. Thus, the classical nonlinear filter approach can be used to detect and diagnose the fault in system. A feasible detection criterion is obtained at first, and a new H-infinity adaptive fault diagnosis algorithm is further investigated to estimate the fault. Simulation example is given to demonstrate the effectiveness of the proposed approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗