Time domain modeling of constant power loads for electromagnetic transient simulations
Not Available
Alboaouh, Kamel↗
SEARCH · Engineering Papers
Results for “Numerical algorithms”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Space Nuclear Power Autonomous Control Algorithm and Control Element Test Bed
Nuclear thermal rockets are currently NASA’s preferred option for use in a manned mission to Mars in the 2040s. The communication delay between an Earth ground station and a spacecraft heading toward Mars can be up to 20 min. Therefore, controlling the nuclear rocket engine would require either a full-time reactor operator on the mission or an autonomous control system for the reactor. The latter idea of making space nuclear reactors fully autonomous has drawn more interest from stakeholders, but such an autonomous control system must be rigorously tested and validated before it is certified for human use. The cost of a full ground test for a space nuclear reactor is tremendous, so a nonnuclear mock reactor test bed was created to test and validate control elements and control algorithms for space nuclear reactors. The test bed consists of control element hardware that inputs physical measurement data into a reactor emulator to produce the reactor’s performance under steady-state, transient, and fault conditions. The control element hardware consists of six full-sized control drums equipped with servo drives and motors and is instrumented with optical encoders, resolvers, and torque sensors for drum movement characterization. In addition to the drums, a two-phase flow loop was designed and built to mimic the valves and turbomachinery associated with the propellant flow through a nuclear thermal rocket engine; components such as pressure sensors, flow meters, thermocouples, and tachometers are instrumented throughout the loop to characterize the fluid flow, valve, and turbomachinery behavior of the system. The data from the physical hardware (e.g., drum position, propellant flow rates) are input to a nuclear reactor simulator to determine the actual nuclear reactor parameters, and the data are sent back to a control algorithm to complete the control loop. The ability to conduct numerous tests of the control systems and autonomous algorithms can help validate the instrumentation and control aspects for a space nuclear reactor for every possible fault situation.
Wilson, Brandon↗
i- flow: High-dimensional integration and sampling with normalizing flows
In many fields of science, high-dimensional integration is required. Numerical methods have been developed to evaluate these complex integrals. We introduce the code i-flow, a python package that performs high-dimensional numerical integration utilizing normalizing flows. Normalizing flows are machine-learned, bijective mappings between two distributions. i-flow can also be used to sample random points according to complicated distributions in high dimensions. We compare i-flow to other algorithms for high-dimensional numerical integration and show that i-flow outperforms them for high dimensional correlated integrals. The i-flow code is publicly available on gitlab at https://gitlab.com/i-flow/i-flow.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Quantum Algorithm for Approximating Maximum Independent Sets
We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense random graphs G , numerical simulation suggests that our algorithm on average finds an independent set of size close to the maximum size α ( G ) in low polynomial time. The best classical algorithms, by contrast, produce independent sets of size about half of α ( G ) in polynomial time.
Physics↗
Critical points of the random cluster model with Newman–Ziff sampling
Here, we present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.
97 MATHEMATICS AND COMPUTING↗
Steepest-descent algorithm for simulating plasma-wave caustics via metaplectic geometrical optics
The design and optimization of radiofrequency-wave systems for fusion applications is often performed using ray-tracing codes, which rely on the geometrical-optics (GO) approximation. However, GO fails at wave cutoffs and caustics. To accurately model the wave behavior in these regions, more advanced and computationally expensive “full-wave” simulations are typically used, but this is not strictly necessary. A new generalized formulation called metaplectic geometrical optics (MGO) has been proposed that reinstates GO near caustics. The MGO framework yields an integral representation of the wavefield that must be evaluated numerically in general. We present an algorithm for computing these integrals using Gauss-Freud quadrature along the steepest-descent contours. Benchmarking is performed on the standard Airy problem, for which the exact solution is known analytically. Furthermore, the numerical MGO solution provided by the new algorithm agrees remarkably well with the exact solution and significantly improves on previously derived analytical approximations of the MGO integral.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Limitations of Hartree–Fock with quantum resources
The Hartree–Fock problem provides the conceptual and mathematical underpinning of a large portion of quantum chemistry. As efforts in quantum technology aim to enhance computational chemistry algorithms, the Hartree–Fock method, central to many other numerical approaches, is a natural target for quantum enhanced algorithms. While quantum computers and quantum simulation offer many prospects for the future of modern chemistry, the non-deterministic polynomial-complete Hartree–Fock problem is not a likely candidate. Here, we highlight this fact from a number of perspectives including computational complexity, practical examples, and the full characterization of energy landscapes for simple systems.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems
A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.
97 MATHEMATICS AND COMPUTING↗
Enhancing approximate modular Bayesian inference by emulating the conditional posterior
In modular Bayesian analyses, complex models are composed of distinct modules, each representing different aspects of the data or prior information. In this context, fully Bayesian approaches can sometimes lead to undesirable feedback between modules, compromising the integrity of the inference. The “cut-distribution” prevents unwanted influence between modules by “cutting” feedback. The direct sampling (DS) algorithm is standard practice for approximating the cut-distribution, but it can be computationally intensive, especially when the number of imputations required is large. An enhanced method is proposed, the Emulating the Conditional Posterior (ECP) algorithm, which leverages emulation to increase the number of imputations. Through numerical experiment it is demonstrated that the ECP algorithm outperforms the traditional DS approach in terms of accuracy and computational efficiency, particularly when resources are constrained. Here, it is also shown how the DS algorithm can be improved using ideas from design of experiments. Some practical recommendations are given for algorithm choice in modular Bayesian analyses.
97 MATHEMATICS AND COMPUTING↗
Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.
97 MATHEMATICS AND COMPUTING↗
Hierarchical Optimal Power Flow with Improved Gradient Evaluation
Existing algorithms to solve alternating-current optimal power flow (AC-OPF) often exploit linear approximations to simplify system models and accelerate computations. In this paper, we improve a recent hierarchical OPF algorithm, which rested on primal-dual gradients evaluated in a linearized distribution power flow model. Specifically, we identify a risk of voltage violation arising from the model linearization, and propose a more accurate gradient evaluation method to eliminate that risk. We further develop a hierarchical primal-dual algorithm to solve OPF based on the proposed gradient evaluation method. Numerical results on IEEE networks show that our algorithm can enhance voltage safety with satisfactory computational efficiency.
distributed algorithm↗
Finite spatial-grid effects in energy-conserving particle-in-cell algorithms
Finite-grid (or aliasing) instabilities are pervasive in particle-in-cell (PIC) plasma simulation algorithms, and force the modeler to resolve the smallest (Debye) length scale in the problem regardless of dynamical relevance. These instabilities originate in the aliasing of interpolation errors between mesh quantities and particles (which live in the space–time continuum). Recently, strictly energy-conserving PIC (EC-PIC) algorithms have been developed that promise enhanced robustness against aliasing instabilities. In this study, we confirm by analysis that EC-PIC is stable against aliasing instabilities for stationary plasmas. For drifting plasmas, we demonstrate by analysis and numerical experiments that, while EC-PIC algorithms are not free from these instabilities in principle, they feature a benign stability threshold for finite-temperature plasmas that make them usable in practice for a large class of problems (featuring ambipolarity and realistic ion-electron mass ratios) without the need to consider the size of the Debye length. We also demonstrate that this threshold is absent for the popular momentum-conserving PIC algorithms, which are therefore unstable for both drifting and stationary plasmas beyond a threshold in cell size compared to Debye length. Finite-grid (or aliasing) instabilities are pervasive in particle-in-cell (PIC) plasma simulation algorithms, and force the modeler to resolve the smallest (Debye) length scale in the problem regardless of dynamical relevance. These instabilities originate in the aliasing of interpolation errors between mesh quantities and particles (which live in the space–time continuum). Recently, strictly energy-conserving PIC (EC-PIC) algorithms have been developed that promise enhanced robustness against aliasing instabilities. In this study, we confirm by analysis that EC-PIC is stable against aliasing instabilities for stationary plasmas. For drifting plasmas, we demonstrate by analysis and numerical experiments that, while EC-PIC algorithms are not free from these instabilities in principle, they feature a benign stability threshold for finite-temperature plasmas that make them usable in practice for a large class of problems (featuring ambipolarity and realistic ion-electron mass ratios) without the need to consider the size of the Debye length. Finally, we also demonstrate that this threshold is absent for the popular momentum-conserving PIC algorithms, which are therefore unstable for both drifting and stationary plasmas beyond a threshold in cell size compared to Debye length.
97 MATHEMATICS AND COMPUTING↗
Bridging Scales to Model Reactive Diffusive Transport in Porous Media
Published by ECS. Two novel scale-bridging algorithms to model reaction-diffusion transport in porous media are presented. The algorithms are based on direct numerical simulations and couple the information of a micro-scale model, which accounts for the large field of view provided by micro X-ray computed tomography (X-ray CT), and a nano-scale model, which locally resolves transport in the fine structure extracted from nano X-ray CT. The micro-scale model is discretized in the through-plane direction into a 1D grid, where effective properties and internal boundaries are determined based on the results from the nano-scale model. The validated algorithms are used to examine transport of oxygen in precious group metal-free electrodes considering both zero- and first-order kinetics. Unlike conventional methods, the results show that the effective diffusivity is not a passive property but increases in regions where the reaction-rate coefficient is large. The proposed algorithms account for the multiscale coupling of reaction-diffusion transport and material microstructure, thus improving the predictions compared to conventional methods.
42 ENGINEERING↗
Progress toward favorable landscapes in quantum combinatorial optimization
The performance of variational quantum algorithms relies on the success of using quantum and classical computing resources in tandem. Here, we study how these quantum and classical components interrelate. In particular, we focus on algorithms for solving the combinatorial optimization problem MaxCut, and study how the structure of the classical optimization landscape relates to the quantum circuit used to evaluate the MaxCut objective function. In order to analytically characterize the impact of quantum features on the critical points of the landscape, we consider a family of quantum circuit ansätze composed of mutually commuting elements. We identify multiqubit operations as a key resource and show that overparameterization allows for obtaining favorable landscapes. Namely, we prove that an ansatz from this family containing exponentially many variational parameters yields a landscape free of local optima for generic graphs. However, we further prove that these ansätze do not offer superpolynomial advantages over purely classical MaxCut algorithms. Here, we then present a series of numerical experiments illustrating that noncommutativity and entanglement are important features for improving algorithm performance.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Alternative approach to quantum imaginary time evolution
There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science
Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.
Physics↗
Sampling two-dimensional isometric tensor network states
Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.
Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗