Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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

Linear Approximation Line Pack Model for Integrated Electricity and Natural Gas Systems OPF

With the increasing installation of renewable energy electricity generation capacity, the penetration of natural gas fired generation is also substantailly increasing in power systems due to their fast response capability to mitigate system variability and uncertainty. The dependencies between the electricity system and the natural gas system are becoming more important to maintain the reliability of both systems. In integrated electricity and natural gas systems (IEGSs) operations, the nonlinearity of the natural gas system brings challenges to the system operators. In this paper, the IEGSs optimal power flow (OPF) model is proposed that includes the line pack of the gas system via linear approximation. The simulation results demonstrate that the proposed model can obtain optimal solutions efficiently that are comparable in accuracy as the nonlinear line pack model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Approximation of the Frequency-Amplitude Curve Using the Homotopy Analysis Method

The Frequency-Amplitude (F-A) curve on power system oscillation under a large disturbance characterizes how a natural oscillation mode transitions to nonlinear oscillations with growing amplitudes and decaying frequencies. The existing formulation of the F-A curve is derived by solving elliptical integrals on oscillation of a single-machine-infinite-bus equivalent about the targeted oscillation mode. The formula is in a form of infinite series and needs to sum a large number of terms for satisfactory accuracy. This paper introduces an explicit, approximate expression obtained from the Homotopy Analysis Method on the F-A curve. The proposed F-A curve expression is derived from an SMIB system and verified on the IEEE 3-machine 9-bus system to show how the oscillation frequency of a dominant mode varies with oscillation amplitude under large disturbances.

frequency-amplitude (F-A) curve↗
DOE OSTI2025

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising tool for accelerating optimization processes in the Noisy Intermediate-Scale Quantum (NISQ) era. Compared to classical methods, QAOA efficiently solves optimization problems, often formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. Classical quantum simulators are crucial for evaluating quantum algorithms due to limited quantum resources. However, QAOA's performance can vary with different simulation methods. This study analyzes QAOA's performance using various quantum simulators (e.g., density _matrix, statevector, and matrix_product_state) and demonstrates the benefits of HPC-QC integrated systems in solving QUBO problems on an active learning workflow. By simulating QAOA on dense, large-matrix QUBO problems, we evaluate accuracy and problem-solving time. We also assess QAOA's performance on local computers and HPC-QC inte-grated systems, using Oak Ridge Leadership Computing Facility (OLCF)'s Frontier supercomputer with local Qiskit Aer and remote IBM Quantum simulators.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2025

Quantum Approximate Optimization Algorithm on Different Qubit Systems

Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2023

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PredCom: A Predictive Approach to Collecting Approximated Communication Traces

Communication traces collected from MPI applications are an important source of information for performance optimization as they can help analysts determine communication patterns and identify inefficiencies. However, their collection, especially at scale, is time consuming, since it usually requires running the complete target application on a large number of nodes. In this work, we present PredCom, a tool-chain to generate a predictive communication proxy based on information gathered from a few small scale runs, which allows us to extract approximate communication traces with an accuracy high enough for most analysis goals. For this, we combine LLVM passes on the original source code (to capture static program structure) with parameter prediction (to capture dynamic and scaling behavior). This approach drastically reduces the time needed for collecting the communication traces, even for traces on large numbers of MPI processes. Here, we demonstrate that PredCom generates communication traces of various applications up to 1612x faster with an accuracy loss of 0.11 on average compared to the original large-scale traces, and we show that the generated traces can be used to optimize process placement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximating Trajectory Constraints With Machine Learning – Microgrid Islanding With Frequency Constraints

Here, we introduce deep earning aided constraint encoding to tackle the frequency-constraint microgrid scheduling problem. The nonlinear function between system operating condition and frequency nadir is approximated by using a neural network, which admits an exact mixed-integer formulation (MIP). This formulation is then integrated with the scheduling problem to encode the frequency constraint. With the stronger representation power of the neural network, the resulting commands can ensure adequate frequency response in a realistic setting in addition to islanding success. The proposed method is validated on a modified 33-node system. Successful islanding with a secure response is simulated under the scheduled commands using a detailed three-phase model in Simulink. The advantages of our model are particularly remarkable when the inertia emulation functions from wind turbine generators are considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Posterior Covariance Matrix Approximations

Here, the Davis equation of state (EOS) is commonly used to model thermodynamic relationships for high explosive (HE) reactants. Typically, the parameters in the EOS are calibrated, with uncertainty, using a Bayesian framework and Markov Chain Monte Carlo (MCMC) methods. However, MCMC methods are computationally expensive, especially for complex models with many parameters. This paper provides a comparison between MCMC and less computationally expensive Variational methods (Variational Bayesian and Hessian Variational Bayesian) for computing the posterior distribution and approximating the posterior covariance matrix based on heterogeneous experimental data. All three methods recover similar posterior distributions and posterior covariance matrices. This study demonstrates that for this EOS parameter calibration application, the assumptions made in the two Variational methods significantly reduce the computational cost but do not substantially change the results compared to MCMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A fivefold UO$_2^{2+}$ node is a path to dodecagonal quasicrystal approximants in coordination polymers [plus supplemental information]

Aperiodic formations continue to focus interest in areas ranging from advanced scientific theories to practical everyday applications. Starting from diverse and tightly bonded intermetallic compounds, this world showed an important breakthrough toward the so-called soft systems of meso/macroscale: liquid crystals, thin films, polymers, proteins, etc. This work opens a route for making bulk quasicrystals (QC) in an unprecedented but very common area, with molecular ligands. Since these systems are, to a large extent, transparent, they extend the possible areas of QC application to previously unreachable corners, e.g., photonics. We combined efficient bridging ligands with uranyl pentagonal bonding centers and, unexpectedly, brought the unique attributes of f-element coordination chemistry to an interdisciplinary area of aperiodic formations. Taking advantage of the planar coordination of uranyl ions, we were able to direct the structure expansion solely in two directions with a characteristic snub square tiling, a predicted but previously unobtainable dodecagonal approximant.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations

In this work, we present a fast and approximate multifrontal solver for large-scale sparse linear systems arising from finite-difference, finite-volume or finite-element discretization of high-frequency wave equations. The proposed solver leverages the butterfly algorithm and its hierarchical matrix extension for compressing and factorizing large frontal matrices via graph-distance guided entry evaluation or randomized matrix-vector multiplication-based schemes. Complexity analysis and numerical experiments demonstrate $\mathcal{O}(N\log^2 N)$ computation and $\mathcal{O}(N)$ memory complexity when applied to an $N\times N$ sparse system arising from 3D high-frequency Helmholtz and Maxwell problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Scaled Vecchia Approximation for Fast Computer-Model Emulation

Many scientific phenomena are studied using computer experiments consisting of multiple runs of a computer model while varying the input settings. Gaussian processes (GPs) are a popular tool for the analysis of computer experiments, enabling interpolation between input settings, but direct GP inference is computationally infeasible for large datasets. We adapt and extend a powerful class of GP methods from spatial statistics to enable the scalable analysis and emulation of large computer experiments. Specifically, we apply Vecchia’s ordered conditional approximation in a transformed input space, with each input scaled according to how strongly it relates to the computer-model response. The scaling is learned from the data by estimating parameters in the GP covariance function using Fisher scoring. Our methods are highly scalable, enabling estimation, joint prediction, and simulation in near-linear time in the number of model runs. In several numerical examples, our approach substantially outperformed existing methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Punzi-loss: a non-differentiable metric approximation for sensitivity optimisation in the search for new particles

We present the novel implementation of a non-differentiable metric approximation and a corresponding loss-scheduling aimed at the search for new particles of unknown mass in high energy physics experiments. We call the loss-scheduling, based on the minimisation of a figure-of-merit related function typical of particle physics, a Punzi-loss function, and the neural network that utilises this loss function a Punzi-net. We show that the Punzi-net outperforms standard multivariate analysis techniques and generalises well to mass hypotheses for which it was not trained. This is achieved by training a single classifier that provides a coherent and optimal classification of all signal hypotheses over the whole search space. Our result constitutes a complementary approach to fully differentiable analyses in particle physics. We implemented this work using PyTorch and provide users full access to a public repository containing all the codes and a training example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Auger spectroscopy beyond the ultra-short core-hole relaxation time approximation

Abstract We present a time-dependent computational approach to study Auger electron spectroscopy (AES) beyond the ultra-short core-hole relaxation time approximation and, as a test case, we apply it to the paradigmatic example of a one-dimensional Mott insulator represented by a half-filled Hubbard chain. The Auger spectrum is usually calculated by assuming that, after the creation of a core-hole, the system thermalizes almost instantaneously. This leads to a relatively simple analytical expression that uses the ground-state with a core-hole as a reference state and ignores all the transient dynamics related to the screening of the core-hole. In this picture, the response of the system can be associated to the pair spectral function. On the other hand, in our numerical calculations, the core hole is created by a light pulse, allowing one to study the transient dynamics of the system in terms of the pulse duration and in the non-perturbative regime. Time-dependent density matrix renormalization group calculations reveal that the relaxation process involves the creation of a polarization cloud of doublon excitations that have an effect similar to photo-doping. As a consequence, there is a leak of spectral weight to higher energies into what otherwise would be the Mott gap. For longer pulses, these excited states, mostly comprised of doublons, can dominate the spectrum. By changing the duration of the light-pulse, the entire screening process can be resolved in time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Constructing approximately diagonal quantum gates

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers. We systemically study this conjecture and prove several important partial results. Some techniques are developed to pave the way for a final resolution of the conjecture. The sequences provided here have applications in quantum search algorithms, quantum circuit compilation, generation of leakage-free entangled gates in topological quantum computing, etc.

Computer Science↗
DOE OSTI2023

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data

We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.

Computer Science↗
DOE OSTI2023

Voltage-Dependent First-Principles Simulation of Insertion of Chloride Ions into Al/Al 2 O 3 Interfaces Using the Quantum Continuum Approximation

Experiments have shown that pitting corrosion can develop in aluminum surfaces at potentials > − 0.5 V relative to the standard hydrogen electrode (SHE). Until recently, the onset of pitting corrosion in aluminum has not been rigorously explored at an atomistic scale because of the difficulty of incorporating a voltage into density functional theory (DFT) calculations. We introduce the Quantum Continuum Approximation (QCA) which self-consistently couples explicit DFT calculations of the metal-insulator and insulator-solution interfaces to continuum Poisson-Boltzmann electrostatic distributions describing the bulk of the insulating region. By decreasing the number of atoms necessary to explicitly simulate with DFT by an order of magnitude, QCA makes the first-principles prediction of the voltage of realistic electrochemical interfaces feasible. After developing this technique, we apply QCA to predict the formation energy of chloride atoms inserting into oxygen vacancies in Al(111)/α-Al 2 O 3 (0001) interfaces as a function of applied voltage. We predict that chloride insertion is only favorable in systems with a grain boundary in the Al 2 O 3 for voltages > − 0.2 V (SHE). Here our results roughly agree with the experimentally demonstrated onset of corrosion, demonstrating QCA's utility in modeling realistic electrochemical systems at reasonable computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗