Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical stability”

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 19 records

Dynamic State Estimation for Multi-Machine Power System by Unscented Kalman Filter With Enhanced Numerical Stability

In this paper, in order to enhance the numerical stability of the unscented Kalman filter (UKF) used for power system dynamic state estimation, a new UKF with guaranteed positive semidifinite estimation error covariance (UKFGPS) is proposed and compared with five existing approaches, including UKFschol, UKF-kappa, UKFmodified, UKF-Delta Q, and the squareroot UKF (SRUKF). These methods and the extended Kalman filter (EKF) are tested by performing dynamic state estimation on WSCC 3-machine 9-bus system and NPCC 48-machine 140-bus system. For WSCC system, all methods obtain good estimates. However, for NPCC system, both EKF and the classic UKF fail. It is found that UKFschol, UKF-kappa, and UKF-Delta Q do not work well in some estimations while UKFGPS works well in most cases. UKFmodified and SRUKF can always work well, indicating their better scalability mainly due to the enhanced numerical stability.

dynamic state estimation↗

Numerical Stability and Accuracy of Temporally Coupled Multi-Physics Modules in Wind-Turbine CAE Tools

In this paper we examine the stability and accuracy of numerical algorithms for coupling time-dependent multi-physics modules relevant to computer-aided engineering (CAE) of wind turbines. This work is motivated by an in-progress major revision of FAST, the National Renewable Energy Laboratory's (NREL's) premier aero-elastic CAE simulation tool. We employ two simple examples as test systems, while algorithm descriptions are kept general. Coupled-system governing equations are framed in monolithic and partitioned representations as differential-algebraic equations. Explicit and implicit loose partition coupling is examined. In explicit coupling, partitions are advanced in time from known information. In implicit coupling, there is dependence on other-partition data at the next time step; coupling is accomplished through a predictor-corrector (PC) approach. Numerical time integration of coupled ordinary-differential equations (ODEs) is accomplished with one of three, fourth-order fixed-time-increment methods: Runge-Kutta (RK), Adams-Bashforth (AB), and Adams-Bashforth-Moulton (ABM). Through numerical experiments it is shown that explicit coupling can be dramatically less stable and less accurate than simulations performed with the monolithic system. However, PC implicit coupling restored stability and fourth-order accuracy for ABM; only second-order accuracy was achieved with RK integration. For systems without constraints, explicit time integration with AB and explicit loose coupling exhibited desired accuracy and stability.

17 WIND ENERGY↗

Numerical stability of relativistic beam multidimensional PIC simulations employing the Esirkepov algorithm

Rapidly growing numerical instabilities routinely occur in multidimensional particle-in-cell computer simulations of plasma-based particle accelerators, astrophysical phenomena, and relativistic charged particle beams. Reducing instability growth to acceptable levels has necessitated higher resolution grids, high-order field solvers, current filtering, etc. except for certain ratios of the time step to the axial cell size, for which numerical growth rates and saturation levels are reduced substantially. This paper derives and solves the cold beam dispersion relation for numerical instabilities in multidimensional, relativistic, electromagnetic particle-in-cell programs employing either the standard or the Cole–Karkkainnen finite difference field solver on a staggered mesh and the common Esirkepov current-gathering algorithm. Good overall agreement is achieved with previously reported results of the WARP code. In particular, the existence of select time steps for which instabilities are minimized is explained. Additionally, an alternative field interpolation algorithm is proposed for which instabilities are almost completely eliminated for a particular time step in ultra-relativistic simulations.

43 PARTICLE ACCELERATORS↗

Investigating Inherent Numerical Stabilization for the Moist, Compressible, Non‐Hydrostatic Euler Equations on Collocated Grids

This study investigates inherent numerical dissipation due to upwind fluxes and reconstruction strategies for collocated Finite-Volume integration of the Euler equations. Idealized supercell simulations are used without any explicit dissipation. Flux terms are split into: mass flux, pressure, and advected quantities. They are computed with the following upwind strategies: central, advectively upwind, and acoustically upwind. This is performed for third and ninth-order-accurate reconstructions with and without Weighted Essentially Non-Oscillatory limiting. Acoustic-only upwinding for pressure and mass flux terms and advective-only upwinding for advected quantities is the most flexible simplification found. It reduces data movement and computations. Assuming a constant speed of sound in acoustic upwinding gives similar results to using the true speed of sound. Dissipation from upwind adapts automatically to grid spacing, time step, reconstruction accuracy, and flow smoothness. While stability is maintained even at 21st-order spatial accuracy, there is a limit to the spatial order of accuracy for which upwinding alone can create a realizable solution in the conditions of this study. Convex combinations of upwind and central solutions for flux terms also reduced dissipation, but as the central proportion grows, solutions become physically unrealizable. The range of length scales of the kinetic energy spectra can be extended along k −5/3 to smaller spatial scales by reducing dissipation either with higher-order reconstructions or using convex combinations of upwind and central fluxes. However, not all extensions of the length scale range along k −5/3 exhibit physically realizable solutions, even though the spectra appear to be physical.

54 ENVIRONMENTAL SCIENCES↗

RELAP-7 Numerical Stabilization: Entropy Viscosity Method

The RELAP-7 code is the next generation nuclear reactor system safety analysis code being developed at the Idaho National Laboratory (INL). The code is based on the INL's modern scientific software development framework, MOOSE (Multi-Physics Object Oriented Simulation Environment). The overall design goal of RELAP-7 is to take advantage of the previous thirty years of advancements in computer architecture, software design, numerical integration methods, and physical models. The end result will be a reactor systems analysis capability that retains and improves upon RELAP5's capability and extends the analysis capability for all reactor system simulation scenarios. RELAP-7 utilizes a single phase and a novel seven-equation two-phase flow models as described in the RELAP-7 Theory Manual (INL/EXT-14-31366). The basic equation systems are hyperbolic, which generally require some type of stabilization (or artificial viscosity) to capture nonlinear discontinuities and to suppress advection-caused oscillations. This report documents one of the available options for this stabilization in RELAP-7 -- a new and novel approach known as the entropy viscosity method. Because the code is an ongoing development effort in which the physical sub models, numerics, and coding are evolving, so too must the specific details of the entropy viscosity stabilization method. Here the fundamentals of the method in their current state are presented.

42 ENGINEERING↗

Comparison of the Numerical Stability between CMFD and GCMR with Stabilization Techniques

The Coarse Mesh Finite Difference (CMFD) method and the Generalized Coarse Mesh Rebalance (GCMR) method have been applied to many reactor physics codes and these methods contribute for improvement of calculation speed. On the other hand, the numerical instability of these methods have been a crucial issue. In order to overcome this issue, some stabilization techniques such as damping factor and correction techniques of diffusion coefficient have been developed. The systematic comparison of the calculation stability and efficiency between GCMR and CMFD with various stabilization techniques has not been reported and these results are important for the improvement of nuclear reactor analysis. The present summary focuses on this point. Namely, calculation stability and efficiency of the CMFD and the GCMR are compared with investigation of the effect of stabilization techniques on these methods. We applied these methods and techniques to 2D geometries with and without voided regions. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Numerical stability analysis of the pseudo-spectral analytical time-domain PIC algorithm

The pseudo-spectral analytical time-domain (PSATD) particle-in-cell (PIC) algorithm solves the vacuum Maxwell's equations exactly, has no Courant time-step limit (as conventionally defined), and offers substantial flexibility in plasma and particle beam simulations. It is, however, not free of the usual numerical instabilities, including the numerical Cherenkov instability, when applied to relativistic beam simulations. This paper derives and solves the numerical dispersion relation for the PSATD algorithm and compares the results with corresponding behavior of the more conventional pseudo-spectral time-domain (PSTD) and finite difference time-domain (FDTD) algorithms. In general, PSATD offers superior stability properties over a reasonable range of time steps. More importantly, one version of the PSATD algorithm, when combined with digital filtering, is almost completely free of the numerical Cherenkov instability for time steps (scaled to the speed of light) comparable to or smaller than the axial cell size.

97 MATHEMATICS AND COMPUTING↗

Numerical Stability of Detonations in White Dwarf Simulations

Some simulations of SNe Ia feature self-consistent thermonuclear detonations. However, these detonations are not meaningful if the simulations are not resolved, so it is important to establish the requirements for achieving a numerically converged detonation. In this study we examine a test detonation problem inspired by collisions of white dwarfs. This test problem demonstrates that achieving a converged thermonuclear ignition requires a spatial resolution much finer than 1 km in the burning region. Current computational resource constraints place this stringent resolution requirement out of reach for multidimensional supernova simulations. Consequently, contemporary simulations that self-consistently demonstrate detonations are possibly not converged and should be treated with caution.

79 ASTRONOMY AND ASTROPHYSICS↗

Improving the Numerical Stability of Fast Matrix Multiplication

Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few fast algorithms have been efficiently implemented or used in practical applications. However, there exist many practical alternatives to Strassen's algorithm with varying performance and numerical properties. Fast algorithms are known to be numerically stable, but because their error bounds are slightly weaker than the classical algorithm, they are not used even in cases where they provide a performance benefit. We argue in this study that the numerical sacrifice of fast algorithms, particularly for the typical use cases of practical algorithms, is not prohibitive, and we explore ways to improve the accuracy both theoretically and empirically. The numerical accuracy of fast matrix multiplication depends on properties of the algorithm and of the input matrices, and we consider both contributions independently. We generalize and tighten previous error analyses of fast algorithms and compare their properties. We discuss algorithmic techniques for improving the error guarantees from two perspectives: manipulating the algorithms, and reducing input anomalies by various forms of diagonal scaling. In conclusion, we benchmark performance and demonstrate our improved numerical accuracy.

97 MATHEMATICS AND COMPUTING↗

Assessing the numerical stability of physics models to equilibrium variation through database comparisons on DIII-D

High fidelity kinetic equilibria are crucial for tokamak modeling and analysis. Manual workflows for constructing kinetic equilibria are time consuming and subject to user error, motivating development of automated equilibrium reconstruction tools to provide accurate and consistent reconstructions for downstream physics analysis. These automated tools also provide access to kinetic equilibria at large database scales, which enables the quantification of general uncertainties arising from equilibrium reconstruction techniques. In this paper, we compare a large database of DIII-D kinetic equilibria generated manually by physics experts to equilibria from automated kinetic reconstruction tools, assessing the impact of reconstruction method on equilibrium parameters and resulting magnetohydrodynamic stability calculations. We find agreement among scalar parameters, whereas profile quantities, such as the bootstrap current, show larger disagreements. We analyze ideal kink and classical tearing stability with DCON and STRIDE respectively, finding that the kink stability calculation is generally more robust than the tearing index Δ' calculation. We find that in 90% of cases, both kink stability classifications are unchanged between the manual expert and automated kinetic equilibria.

CAKE↗

Automated implementation of on-shell methods for one-loop amplitudes

We present the first results from BlackHat, an automated C++ program for calculating one-loop amplitudes. The program implements the unitarity method and on-shell recursion to construct amplitudes. As input to the calculation, it uses compact analytic formulae for tree amplitudes for four-dimensional helicity states. The program performs all related computations numerically. We make use of recently developed on-shell methods for evaluating coefficients of loop integrals, introducing a discrete Fourier projection as a means of improving efficiency and numerical stability. We illustrate the numerical stability of our approach by computing and analyzing six-, seven-, and eight-gluon amplitudes in QCD and comparing against previously obtained analytic results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗