Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 901 records · Page 50

Distributed Automatic Load-Frequency Control with Optimality in Power Systems: Preprint

With increasing penetrations of renewable energy resources, power systems face new challenges in balancing supply and demand and maintaining nominal frequency. This paper studies load control to handle these challenges. In particular, a fully distributed automatic load control algorithm, which needs only local measurement and local communications, is proposed. We prove that the control algorithm globally converges to an optimal operating point that minimizes the total disutility of users, restores the nominal frequency and the scheduled tie-line power flows, and respects the thermal constraints of transmission lines. We also show that the convergence holds even when inaccurate system parameters are used in the control algorithm. Last, the effectiveness, optimality, and robustness of the proposed algorithm are demonstrated via numerical simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

IslandFAST: A Semi-numerical Tool for Simulating the Late Epoch of Reionization

We present the algorithm and main results of our semi-numerical simulation, islandFAST, which was developed from 21cmFAST and designed for the late stage of reionization. The islandFAST simulation predicts the evolution and size distribution of the large-scale underdense neutral regions (neutral islands), and we find that the late Epoch of Reionization proceeds very fast, showing a characteristic scale of the neutral islands at each redshift. Using islandFAST, we compare the impact of two types of absorption systems, i.e., the large-scale underdense neutral islands versus small-scale overdense absorbers, in regulating the reionization process. The neutral islands dominate the morphology of the ionization field, while the small-scale absorbers dominate the mean-free path of ionizing photons, and also delay and prolong the reionization process. With our semi-numerical simulation, the evolution of the ionizing background can be derived self-consistently given a model for the small absorbers. The hydrogen ionization rate of the ionizing background is reduced by an order of magnitude in the presence of dense absorbers.

79 ASTRONOMY AND ASTROPHYSICS↗

On numerical energy conservation for an implicit particle-in-cell method coupled with a binary Monte-Carlo algorithm for Coulomb collisions

We report conventional particle-in-cell (PIC) methods suffer from enhanced numerical heating (explicit PIC) or cooling (semi-implicit PIC) when coupled with a binary Monte-Carlo algorithm for Coulomb collisions. In this work, a fully-implicit θ-PIC scheme (with adjustable time-biasing parameter 1/2 ≤ θ ≤) is considered. The discrete change in energy of a closed system after a time step for this scheme scales with (1/2 - θ)C θ , where C θ is a positive definite quantity that depends on the frequency spectrum of the energy in the fields. Collisions lead to additional energy in the field fluctuations associated with high-frequency light waves produced by a numerical Bremsstrahlung process, which can result in a large increase in the numerical cooling rate for θ > 1/2. However, for θ = 1/2, energy is exactly conserved. The energy in the field fluctuations on long time scales agrees with that calculated using the equipartition theorem for a classical system in thermodynamic equilibrium.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Validation of the EDGES Low-band Antenna Beam Model

The response of the antenna is a source of uncertainty in measurements with the Experiment to Detect the Global Epoch of Reionization Signature (EDGES). We aim to validate the electromagnetic beam model of the low-band (50–100 MHz) dipole antenna with comparisons between models and against data. We find that simulations of a simplified model of the antenna over an infinite perfectly conducting ground plane are, with one exception, robust to changes in the numerical electromagnetic solver code or algorithm. For simulations of the antenna with the actual finite ground plane and realistic soil properties, we find that two out of three numerical solvers agree well. Applying our analysis pipeline to a simulated drift-scan observation from an early EDGES low-band instrument that had a 10 m × 10 m ground plane, we find residual levels after fitting and removing a five-term foreground model from the simulated data binned in local sidereal time (LST) average about 250 mK with ±40 mK variation between numerical solvers. A similar analysis of the primary 30 m × 30 m sawtooth ground plane reduced the LST-averaged residuals to about 90 mK with ±10 mK between the two viable solvers. More broadly we show that larger ground planes generally perform better than smaller ground planes. Simulated data have a power that is within 4% of real observations, a limitation of net accuracy of the sky and beam models. We observe that residual spectral structures after foreground model fits match qualitatively between simulated data and observations, suggesting that the frequency dependence of the beam is reasonably represented by the models. We find that a soil conductivity of 0.02 S m{sup -1} and relative permittivity of 3.5 yield good agreement between simulated spectra and observations. This is consistent with the soil properties reported by Sutinjo et al. for the Murchison Radio-astronomy Observatory, where EDGES is located.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗

Exact and efficient hybrid Monte Carlo algorithm for accelerated Bayesian inference of gene expression models from snapshots of single-cell transcripts

Single cells exhibit a significant amount of variability in transcript levels, which arises from slow, stochastic transitions between gene expression states. Elucidating the nature of these states and understanding how transition rates are affected by different regulatory mechanisms require state-of-the-art methods to infer underlying models of gene expression from single cell data. A Bayesian approach to statistical inference is the most suitable method for model selection and uncertainty quantification of kinetic parameters using small data sets. However, this approach is impractical because current algorithms are too slow to handle typical models of gene expression. To solve this problem, we first show that time-dependent mRNA distributions of discrete-state models of gene expression are dynamic Poisson mixtures, whose mixing kernels are characterized by a piecewise deterministic Markov process. Here, we combined this analytical result with a kinetic Monte Carlo algorithm to create a hybrid numerical method that accelerates the calculation of time-dependent mRNA distributions by 1000-fold compared to current methods. We then integrated the hybrid algorithm into an existing Monte Carlo sampler to estimate the Bayesian posterior distribution of many different, competing models in a reasonable amount of time. We demonstrate that kinetic parameters can be reasonably constrained for modestly sampled data sets if the model is known a priori. If there are many competing models, Bayesian evidence can rigorously quantify the likelihood of a model relative to other models from the data. We demonstrate that Bayesian evidence selects the true model and outperforms approximate metrics typically used for model selection.

59 BASIC BIOLOGICAL SCIENCES↗

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗

Massively parallel solvers for elliptic partial differential equations in numerical weather and climate prediction

The demand for substantial increases in the spatial resolution of global weather and climate prediction models makes it essential to use numerically efficient and highly scalable algorithms to solve the equations of large-scale atmospheric fluid dynamics. For stability and efficiency reasons, several of the operational forecasting centres, in particular the Met Office and the European Centre for Medium-Range Weather Forecasts (ECMWF) in the UK, use semi-implicit semi-Lagrangian time-stepping in the dynamical core of the model. The additional burden with this method is that a three-dimensional elliptic partial differential equation (PDE) for the pressure correction has to be solved at every model time step and this often constitutes a significant proportion of the time spent in the dynamical core. In global models, this PDE must be solved in a thin spherical shell. To run within tight operational time-scales, the solver has to be parallelized and there seems to be a (perceived) misconception that elliptic solvers do not scale to large processor counts and hence implicit time-stepping cannot be used in very high-resolution global models. After reviewing several methods for solving the elliptic PDE for the pressure correction and their application in atmospheric models, we demonstrate the performance and very good scalability of Krylov subspace solvers and multigrid algorithms for a representative model equation with more than 1010 unknowns on 65 536 cores on the High-End Computing Terascale Resource (HECToR), the UK's national supercomputer. Here, we tested and optimized solvers from two existing numerical libraries (the Distributed and Unified Numerics Environment (DUNE) and Parallel High Performance Preconditioners (hypre)) and implemented both a conjugate gradient solver and a geometric multigrid algorithm based on a tensor-product approach, which exploits the strong vertical anisotropy of the discretized equation. We study both weak and strong scalability and compare the absolute solution times for all methods; in contrast to one-level methods, the multigrid solver is robust with respect to parameter variations.

58 GEOSCIENCES↗

Mathematical Model for the Emission Infrared Tomography of the Temperature Field in an Isotropic Layer

We consider a mathematical model for the determination of the temperature field in a layer that emits, absorbs, and scatters infrared radiation both in the volume and on the surface. Within the framework of the model, we formulate nonlinear direct and inverse problems of emission infrared tomography of the temperature field in the layer according to known space-and-angular distributions of the flows of infrared radiation emitted into the ambient medium. The iterative-variational methods are proposed for the solution of the indicated direct and inverse problems. As a specific example, we perform the numerical analysis of the developed algorithms.

97 MATHEMATICS AND COMPUTING↗

A robust fourth-order finite-difference discretization for the strongly anisotropic transport equation in magnetized plasmas

We propose a second-order temporally implicit, fourth-order-accurate spatial discretization scheme for the strongly anisotropic heat transport equation characteristic of hot, fusion-grade plasmas. Following Du Toit et al. (2018), the scheme transforms mixed-derivative diffusion fluxes (which are responsible for the lack of a discrete maximum principle) into nonlinear advective fluxes, amenable to nonlinear-solver-friendly monotonicity-preserving limiters. The scheme enables accurate multi-dimensional heat transport simulations with up to seven orders of magnitude of heat-transport-coefficient anisotropies with low cross-field numerical error pollution and excellent algorithmic performance, with the number of linear iterations scaling very weakly with grid resolution and grid anisotropy, and scaling with the square-root of the implicit timestep. We propose a multigrid preconditioning strategy based on a lower-order approximation that renders the scheme efficient and scalable under grid refinement. Several numerical tests are presented that display the expected spatial convergence rates and strong algorithmic performance, including fully nonlinear magnetohydrodynamics simulations of kink instabilities in a Bennett pinch in 2D helical geometry and of ITER in 3D toroidal geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal checkpointing for adjoint multistage time-stepping schemes

Here, we consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes that require computing several substeps within one complete time step. Specifically, we propose two algorithms that can generate optimal checkpoint-ing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with other algorithms. The CAMS algorithm is made publicly available in a library with bindings to C and Python. Numerical results show that the proposed algorithms can deliver up to two times the speedup compared with that of classical Revolve. Moreover, we discuss the utilization of the CAMS library in mature scientific computing libraries and demonstrate the ease of using it in an adjoint workflow. The proposed algorithms have been adopted by the PETSc TSAdjoint library. Their performance has been demonstrated with a large-scale PDE-constrained optimization problem on a leadership-class supercomputer. This work is a significant extension of the authors' conference paper.

97 MATHEMATICS AND COMPUTING↗

Mesh Algorithms for PDE with Sieve I: Mesh Distribution

We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.

Knepley, Matthew G.↗

Charge-and-energy conserving moment-based accelerator for a multi-species Vlasov–Fokker–Planck–Ampère system, part II: Collisional aspects

In this study, we extend the moment-based acceleration algorithm for the charge, momentum, and energy conserving Vlasov–Ampère discretization developed in Ref. [1] by including a reduced Fokker–Planck operator. We propose an energy conserving discretization for the Fokker–Planck collision operator. We show by numerical experiment that the new algorithm 1) efficiently converges the nonlinearly coupled Vlasov–Fokker–Planck–Ampère system, and 2) accurately steps over stiff time-scales such as the inverse electron plasma frequency, and the electron–electron collision time-scale. We demonstrate that discrete energy conservation is critical to eliminate numerical heating issues when strong density gradients exist.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Novel Data-based Stochastic Distribution Control for Non-Gaussian Stochastic Systems

In this note, we present a novel data-based approach to investigate the non-Gaussian stochastic distribution control problem. As the motivation of this note, the existing methods have been summarised regarding to the drawbacks, for example, neural network weights training for unknown stochastic distribution and so on. To overcome these disadvantages, a new transformation for dynamic probability density function is given by kernel density estimation using interpolation. Based upon this transformation, a representative model has been developed while the stochastic distribution control problem has been transformed into an optimisation problem. Then, data-based direct optimisation and identification-based indirect optimisation have been proposed. In addition, the convergences of the presented algorithms are analysed and the effectiveness of these algorithms has been evaluated by numerical examples. In summary, the contributions of this note are as follows: 1) a new data-based probability density function transformation is given; 2) the optimisation algorithms are given based on the presented model; and 3) a new research framework is demonstrated as the potential extensions to the existing stochastic distribution control.

42 ENGINEERING↗

Linac Alignment Algorithm: Analysis on 1-to-1 Steering

In a linear accelerator, it is important to achieve a good alignment between all of its components (such as quadrupoles, RF cavities, beam position monitors et al.), in order to better preserve the beam quality during acceleration. After the survey of the main linac components, there are several beam-based alignment (BBA) techniques to be applied, to further optimize the beam trajectory and calculate the corresponding steering magnets strength. Among these techniques the most simple and straightforward one is the one-to-one (1-to-1) steering technique, which steers the beam from quad center to center, and removes the betatron oscillation from quad focusing. For a future linear collider such as the International Linear Collider (ILC), the initial beam emittance is very small in the vertical plane (flat beam with {gamma}{epsilon}{sub y} = 20-40nm), which means the alignment requirement is very tight. In this note, we evaluate the emittance growth with one-to-one correction algorithm employed, both analytically and numerically. Then the ILC main linac accelerator is taken as an example to compare the vertical emittance growth after 1-to-1 steering, both from analytical formulae and multi-particle tracking simulation. It is demonstrated that the estimated emittance growth from the derived formulae agrees well with the results from numerical simulation, with and without acceleration, respectively.

43 PARTICLE ACCELERATORS↗

Tartarus: A relativistic Green's function quantum average atom code

A relativistic Green’s Function quantum average atom model is implemented in the Tartarus code for the calculation of equation of state data in dense plasmas. We first present the relativistic extension of the quantum Green’s Function average atom model described by Starrett [1]. The Green’s Function approach addresses the numerical challenges arising from resonances in the continuum density of states without the need for resonance tracking algorithms or adaptive meshes, though there are still numerical challenges inherent to this algorithm. We discuss how these challenges are addressed in the Tartarus algorithm. The outputs of the calculation are shown in comparison to PIMC/DFT-MD simulations of the Principal Shock Hugoniot in Silicon. Finally, we also present the calculation of the Hugoniot for Silver coming from both the relativistic and nonrelativistic modes of the Tartarus code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy-preserving coupling of explicit particle-in-cell with Monte Carlo collisions

The particle-in-cell (PIC) and Monte Carlo collisions (MCC) methods are workhorses of many numerical simulations of physical systems. Recently, it was pointed out that, while the two methods can be exactly—or nearly—energy-conserving independently, combining the two leads to anomalous numerical heating. This paper reviews the standard explicit PIC-MCC algorithm, elucidates the origins of the anomalous numerical heating, and explains how to couple the two methods such that the anomalous numerical heating is avoided.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗