Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 1,099 records · Page 61

Distributed Barrier Certificates for Safe Operation of Inverter-Based Microgrids

Inverter-interfaced microgrids differ from the traditional power systems due to their lack of inertia. Vanishing timescale separation between voltage and frequency dynamics makes it critical that faster-timescale stabilizing control laws also guarantee by-construction the satisfaction of voltage limits during transients. In this article, we apply a barrier functions method to compute distributed active and reactive power setpoint control laws that certify satisfaction of voltage limits during transients. Using sum-of-squares optimization tools, we propose an algorithmic construction of these control laws. Numerical simulations are provided to illustrate the proposed method.

Kundu, Soumya↗

IBS for non-gaussian distributions

In many situations distribution can significantly deviate from Gaussian which requires accurate treatment of IBS. Our original interest in this problem was motivated by the need to have an accurate description of beam evolution due to IBS while distribution is strongly affected by the external electron cooling force. A variety of models with various degrees of approximation were developed and implemented in BETACOOL in the past to address this topic. A more complete treatment based on the friction coefficient and full 3-D diffusion tensor was introduced in BETACOOL at the end of 2007 under the name 'local IBS model'. Such a model allowed us calculation of IBS for an arbitrary beam distribution. The numerical benchmarking of this local IBS algorithm and its comparison with other models was reported before. In this paper, after briefly describing the model and its limitations, they present its comparison with available experimental data.

43 PARTICLE ACCELERATORS↗

The role of cellular structure on increasing the detonability limits of three-step chain-branching detonations

In [1], the dynamics of a pulsating three-step chain-branching detonation were studied. The reaction model consists of, sequentially, chain-initiation, chain-branching and chain-termination steps. The chain-initiation and chain-branching steps are taken to be thermally neutral, with chemical energy release occuring in the chain-termination stage. The purpose of the present study is to examine whether cellular detonation structure can increase the value of the chain-branching cross-over temperature T{sub b} at which fully coupled detonation solutions are observed over those in 1 D. The basic concept is straightforward and has been discussed in [1] and [3]; if T{sub s} drops below T{sub b} at the lead shock, the passage of a transverse shock can increase both the lead shock temperature and the temperature behind the transverse wave back above T{sub b}, thus sustaining an unstable cellular detonation for values of T{sub b} for which a one-dimensional pulsating detonation will fail. Experiments potentially supporting this hypothesis with irregular detonations have been shown in [3] in a shock tube with acoustically absorbing walls. Removal of the transverse waves results in detonation failure, giving way to a decoupled shock-flame complex. A number of questions remain to be addressed regarding the possibility of such a mechanism, and, if so, about the precise mechanisms driving the cellular structure for large T{sub b}. For instance, one might ask what sets the cell size in a chain-branching detonation, particularly could the characteristic cell size be set by the chain-branching cross-over temperature T{sub b}: after a transverse wave shock collision, the strength of the transverse wave weakens as it propagates along the front. If the spacing between shock collisions is too large (cell size), then the transverse shocks may weaken to the extent that the lead shock temperature or that behind the transverse waves is not raised above T{sub b}, losing chemical energy to drive the front in those regions. Failure may result if less than sufficient of the lead shock be driven above n to sustain reaction. Our starting point for generating cellular solutions is as in [I], consisting of an initial ZND wave in the channel, but perturbed here by a density non-uniformity to generate a cellular structure. Exactly how far the detonability limits (value of T{sub b}) can be extended is not addressed here, as such issues relate in part to the way the cellular structure is generated [6]. Our concern here is to investigate the mechanisms of self-sustained cellular detonation for values of T{sub b} above those that lead to 1D pulsating wave failure that can be generated from the initial ZND wave. Finally, we do not consider cellular propagation driven by a process of apparent thermal ignition of hot-spots downstream that tends to appear close to the 20 detonability limit. Such events are subject to the lack of correct thermal diffusive physics in the model and thus to the form of numerical dissipation in the underlying flow algorithm.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Data-Driven Adaptive Damping Controller for Wind Power Plants with Doubly-Fed Induction Generators: Preprint

This paper presents an adaptive damping controller for wind power plants in which the turbines are equipped with doubly-fed induction generators. The controller is designed to respond to an input control signal that is triggered according to the system operating conditions. A processing unit continuously estimates the electromechanical modes of oscillation based on real-time streaming data acquired from a phasor measurement unit that is strategically positioned on the grid. The decision to trigger (or not trigger) the control signal is automatic, based on the relative damping of the dominant mode. The modes are estimated using the dynamic mode decomposition algorithm with time-delay embedding. Numerical simulations performed on the two-area system demonstrate that the proposed controller enhances the rotor angle stability for both small-signal and large disturbances, and is adaptive to changing grid conditions.

61 RADIATION PROTECTION AND DOSIMETRY↗

Calculating gluon one-loop amplitudes numerically

This note reports on an independent implementation of calculating one-loop amplitudes semi-numerically using generalized unitarity techniques. The algorithm implemented in form of a C++ code closely follows the method by Ellis, Giele, Kunszt and Melnikov. For the case of gluons, the algorithm is briefly reviewed. Double-precision results are presented documenting the accuracy and efficiency of this computation.

Winter, Jan-Christopher↗

New perspectives on superparameterization for geophysical turbulence

This is a research expository paper regarding superparameterization, a class of multi-scale numerical methods designed to cope with the intermittent multi-scale effects of inhomogeneous geophysical turbulence where energy often inverse-cascades from the unresolved scales to the large scales through the effects of waves, jets, vortices, and latent heat release from moist processes. Original as well as sparse space–time superparameterization algorithms are discussed for the important case of moist atmospheric convection including the role of multi-scale asymptotic methods in providing self-consistent constraints on superparameterization algorithms and related deterministic and stochastic multi-cloud parameterizations. Test models for the statistical numerical analysis of superparameterization algorithms are discussed both to elucidate the performance of the basic algorithms and to test their potential role in efficient multi-scale data assimilation. The very recent development of grid-free seamless stochastic superparameterization methods for geophysical turbulence appropriate for “eddy-permitting” mesoscale ocean turbulence is presented here including a general formulation and illustrative applications to two-layer quasigeostrophic turbulence, and another difficult test case involving one-dimensional models of dispersive wave turbulence. This last test case has randomly generated solitons as coherent structures which collapse and radiate wave energy back to the larger scales, resulting in strong direct and inverse turbulent energy cascades.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

Advection algorithms for quantum neutrino moment transport

Neutrino transport in compact objects is an inherently challenging multidimensional problem. Here, this difficulty is compounded if one includes flavor transformation—an intrinsically quantum phenomenon requiring one to follow the coherence between flavors and thus necessitating the introduction of complex numbers. To reduce the computational burden, simulations of compact objects that include neutrino transport often make use of momentum-angle-integrated moments (the lowest order ones being commonly referred to as the energy density and flux) and these quantities can be generalized to include neutrino flavor, i.e., they become quantum moments. Numerous finite-volume approaches to solving the moment evolution equations for classical neutrino transport have been developed based on solving a Riemann problem at cell interfaces. In this paper we describe our generalization of a Riemann solver for quantum moments, specifically decomposing complex numbers in terms of a (signed) magnitude and phase instead of real and imaginary parts. We then test our new algorithm in numerous cases showing a neutrino fast flavor instability, varying from toy models with analytic solutions to snapshots from neutron star merger simulations. Compared to previous algorithms for neutrino transport with flavor mixing, we find uniformly smaller growth rates of the flavor transformation along with concomitantly larger length-scales, and that the results are a better match with the growth rates seen from multiangle codes.

79 ASTRONOMY AND ASTROPHYSICS↗

Explicit time integration of the stiff chemical Langevin equations using computational singular perturbation

A stable explicit time-scale splitting algorithm for stiff chemical Langevin equations (CLEs) is developed, based on the concept of computational singular perturbation. The drift term of the CLE is projected onto basis vectors that span the fast and slow subdomains. The corresponding fast modes exhaust quickly, in the mean sense, and the system state then evolves, with a mean drift controlled by slow modes, on a random manifold. The drift-driven time evolution of the state due to fast exhausted modes is modeled algebraically as an exponential decay process, while that due to slow drift modes and diffusional processes is integrated explicitly. This enables time integration step sizes much larger than those required by typical explicit numerical methods for stiff stochastic differential equations. The algorithm is motivated and reported on, and extensive numerical experiments are conducted to illustrate its accuracy and stability with a number of model systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Simple algorithm for computing the geometric measure of entanglement

We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition; no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of three qubits and the three-qubit XX model with external magnetic field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral characteristics of background error covariance and multiscale data assimilation

The spatial resolutions of numerical atmospheric and oceanic circulation models have steadily increased over the past decades. Horizontal grid spacing down to the order of 1 km is now often used to resolve cloud systems in the atmosphere and sub-mesoscale circulation systems in the ocean. These fine resolution models encompass a wide range of temporal and spatial scales, across which dynamical and statistical properties vary. In particular, dynamic flow systems for small scales can become spatially localized and temporarily intermittent. An analysis shows that the background correlation length scale is larger than 75 km for streamfunctions, even for a 2-km resolution model, and larger than 25 km for water vapor mixing ratios. The theoretical analyses suggest that such correlation length scales prevent the currently used data assimilation schemes from constraining spatial scales smaller than 150 km for streamfunctions and 50 km for water vapor mixing ratios. These results highlight the necessity of fundamentally modifying the currently used data assimilation algorithm for assimilating high-resolution observations into the aforementioned fine resolution models. A multiscale methodology based on scale decomposition is suggested, and challenges are discussed.

Li, Zhijin↗

Snell Envelope with Small Probability Criteria

We present a new algorithm to compute the Snell envelope in the specific case where the criteria to optimize is associated with a small probability or a rare event. This new approach combines the Stochastic Mesh approach of Broadie and Glasserman with a particle approximation scheme based on a specific change of measure designed to concentrate the computational effort in regions pointed out by the criteria. The theoretical analysis of this new algorithm provides non asymptotic convergence estimates. Finally, the numerical tests confirm the practical interest of this approach.

97 MATHEMATICS AND COMPUTING↗

Modified formulation of a rate-dependent damage model for ductile materials

A modification to the rate-dependent damage and failure model developed by Addessio and Johnson [J. Appl. Phys. 74, 1640 (1993)] for ductile materials under high-rate loading is presented. In the current formulation the equilibrium stress, which is used to calculate the plastic strain rate and damage in the material, is defined as the orthogonal projection of the final stress onto an equilibrium yield surface, instead of being a projection of the trial stress onto the yield surface as is done in the original formulation. The modification makes the current formulation fully consistent with the viscoplasticity theory. An implicit algorithm is also presented for the modified model and numerical results of copper under uniaxial strain loading are given to show the features of the model and the algorithm. Comparisons with the results of the original formulation are also presented.

36 MATERIALS SCIENCE↗

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

Accuracy of the explicit energy-conserving particle-in-cell method for under-resolved simulations of capacitively coupled plasma discharges

The traditional explicit electrostatic momentum-conserving particle-in-cell algorithm requires strict resolution of the electron Debye length to deliver numerical stability and accuracy. The explicit electrostatic energy-conserving particle-in-cell algorithm alleviates this constraint with minimal modification to the traditional algorithm, retaining its simplicity, ease of parallelization, and acceleration on modern supercomputing architectures. In this article, we apply the algorithm to model a one-dimensional radio frequency capacitively coupled plasma discharge relevant to industrial applications. The energy-conserving approach closely matches the results from the momentum-conserving algorithm and retains accuracy even for cell sizes up to 8 times the electron Debye length. For even larger cells, the algorithm loses accuracy due to poor resolution of steep gradients within the radio frequency sheath. Accuracy can be recovered by adopting a non-uniform grid, which resolves the sheath and allows for cell sizes up to 32 times the electron Debye length in the quasi-neutral bulk of the discharge. The effect is an up to 8 times reduction in the number of required simulation cells, an improvement that can compound in higher-dimensional simulations. We therefore consider the explicit energy-conserving algorithm as a promising approach to significantly reduce the computational cost of full-scale device simulations and a pathway to delivering kinetic simulation capabilities of use to industry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

Here we propose a manifold sampling algorithm for minimizing a nonsmooth composition $f= h\circ F$, where we assume $h$ is nonsmooth and may be inexpensively computed in closed form and $F$ is smooth but its Jacobian may not be available. We additionally assume that the composition $h\circ F$ defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of $F$ are combined with particularly sampled information about $h$ to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about $f$.

97 MATHEMATICS AND COMPUTING↗

Assessing three closed-loop learning algorithms by searching for high-quality quantum control pulses

Designing a high-quality control is crucial for reliable quantum computation. Among the existing approaches, closed-loop leaning control is an effective choice. Its efficiency depends on the learning algorithm employed, thus deserving algorithmic comparisons for its practical applications. Here we assess three representative learning algorithms, including GRadient Ascent Pulse Engineering (GRAPE), improved Nelder-Mead (NMplus), and Differential Evolution (DE), by searching for high-quality control pulses to prepare the Bell state. We first implement each algorithm experimentally in a nuclear magnetic resonance system and then conduct a numerical study considering the impact of some possible significant experimental uncertainties. The experiments report the successful preparation of the high-fidelity target state by the three algorithms, while NMplus converges fastest, and these results coincide with the numerical simulations when potential uncertainties are negligible. However, under certain significant uncertainties, these algorithms possess distinct performance with respect to their resulting precision and efficiency, and DE shows the best robustness. Finally, this study provides insight to aid in the practical application of different closed-loop learning algorithms in realistic physical scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗