Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & Computing”

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,747 records · Page 97

A curvilinear, fully implicit, conservative electromagnetic PIC algorithm in multiple dimensions

Here, we extend a recently proposed fully implicit PIC algorithm for the Vlasov–Darwin model in multiple dimensions (Chen and Chacón (2015) [1]) to curvilinear geometry. As in the Cartesian case, the approach is based on a potential formulation (Φ, A), and overcomes many difficulties of traditional semi-implicit Darwin PIC algorithms. Conservation theorems for local charge and global energy are derived in curvilinear representation, and then enforced discretely by a careful choice of the discretization of field and particle equations. Additionally, the algorithm conserves canonical-momentum in any ignorable direction, and preserves the Coulomb gauge ∇ • A = 0 exactly. An asymptotically well-posed fluid preconditioner allows efficient use of large cell sizes, which are determined by accuracy considerations, not stability, and can be orders of magnitude larger than required in a standard explicit electromagnetic PIC simulation. We demonstrate the accuracy and efficiency properties of the algorithm with numerical experiments in mapped meshes in 1D-3V and 2D-3V.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A scalable, fully implicit algorithm for the reduced two-field low-β extended MHD model

Here, we demonstrate a scalable fully implicit algorithm for the two-field low-β extended MHD model. This reduced model describes plasma behavior in the presence of strong guide fields, and is of significant practical impact both in nature and in laboratory plasmas. The model displays strong hyperbolic behavior, as manifested by the presence of fast dispersive waves, which make a fully implicit treatment very challenging. In this study, we employ a Jacobian-free Newton–Krylov nonlinear solver, for which we propose a physics-based preconditioner that renders the linearized set of equations suitable for inversion with multigrid methods. As a result, the algorithm is shown to scale both algorithmically (i.e., the iteration count is insensitive to grid refinement and timestep size) and in parallel in a weak-scaling sense, with the wall-clock time scaling weakly with the number of cores for up to 4096 cores. For a 4096 × 4096 mesh, we demonstrate a wall-clock-time speedup of ~6700 with respect to explicit algorithms. The model is validated linearly (against linear theory predictions) and nonlinearly (against fully kinetic simulations), demonstrating excellent agreement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An asymptotic-preserving 2D-2P relativistic Drift-Kinetic-Equation solver for runaway electron simulations in axisymmetric tokamaks

We propose an asymptotic-preserving (AP), uniformly convergent numerical scheme for the relativistic collisional Drift-Kinetic Equation (rDKE) to simulate runaway electrons in axisymmetric toroidal magnetic field geometries typical of tokamak devices. The approach is derived from an exact Green's function solution with numerical approximations of quantifiable impact, and results in a simple, two-step operator-split algorithm, consisting of a collisional Eulerian step, and a Lagrangian orbit-integration step with analytically prescribed kernels. The AP character of the approach is demonstrated by analysis of the dominant numerical errors, as well as by numerical experiments. We demonstrate the ability of the algorithm to provide accurate answers regardless of plasma collisionality on a circular axisymmetric tokamak geometry.

97 MATHEMATICS AND COMPUTING↗

Local conservation of energy in fully implicit PIC algorithms

We consider the issue of strict, fully discrete local energy conservation for a whole class of fully implicit local-charge- and global-energy-conserving particle-in-cell (PIC) algorithms. Earlier studies demonstrated these algorithms feature strict global energy conservation. However, whether a local energy conservation theorem exists (in which the local energy update is governed by a flux balance equation at every mesh cell) for these schemes is unclear. In this study, we show that a local energy conservation theorem indeed exists. We begin our analysis with the 1D electrostatic PIC model without orbit-averaging, and then generalize our conclusions to account for orbit averaging, multiple dimensions, and electromagnetic models (Darwin). In all cases, a temporally, spatially, and particle-discrete local energy conservation theorem is shown to exist, proving that these formulations (as originally proposed in the literature), in addition to being locally charge conserving and globally energy conserving, are strictly locally energy conserving as well. In contrast to earlier proofs of local conservation in the literature, which only considered continuum time, our result is valid for the fully implicit time-discrete version of all models considered, including important features such as orbit averaging. We demonstrate the local-energy-conservation property numerically with a paradigmatic numerical example.

97 MATHEMATICS AND COMPUTING↗

Mobility assessment of the BCC and carbide phases in the C-Nb, C-U and Nb-U systems

Uranium carbides with refractory metal additions are considered for Gen IV nuclear reactors and nuclear thermal propulsion as fuels for their high-temperature and corrosion resistant properties. Understanding kinetic effects that dictate microstructural evolution during fabrication and operating conditions is essential to advance technological development of these fuels. This work presents the development of an atomic mobility database for C-Nb-U systems based off available experimental data supported with ab-initio methods. The mobility assessments and uncertainty quantification (using Markov chain Monte Carlo) were conducted in the Kawin software. Carbon diffusion is considered dominant, as metal diffusion is much slower, with niobium diffusion being even slower and rate limiting than uranium metal. We provide a comprehensive and self-consistent thermo-kinetic database that is validated by diffusion couple simulations through Kawin. In conclusion, this enables prediction of microstructural and phase evolution critical for the development and lifetime assessment of next generation nuclear fuels.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

MOOSE: A parallel computational framework for coupled systems of nonlinear equations.

Systems of coupled, nonlinear partial differential equations (PDEs) often arise in simulation of nuclear processes. MOOSE: Multiphysics Object Oriented Simulation Environment, a parallel computational framework targeted at the solution of such systems, is presented. As opposed to traditional data-flow oriented computational frameworks, MOOSE is instead founded on the mathematical principle of Jacobian-free Newton-Krylov (JFNK) solution methods. Utilizing the mathematical structure present in JFNK, physics expressions are modularized into `Kernels,'' allowing for rapid production of new simulation tools. In addition, systems are solved implicitly and fully coupled, employing physics based preconditioning, which provides great flexibility even with large variance in time scales. A summary of the mathematics, an overview of the structure of MOOSE, and several representative solutions from applications built on the framework are presented.

97 MATHEMATICS AND COMPUTING↗

Comparing numerical accuracy and stability for different horizontal discretizations in MPAS-Ocean

This manuscript investigates the effectiveness of two possible horizontal discretizations for the global ocean model MPAS-Ocean, both applied to Spherical Centroidal Voronoi Tessellations (SCVTs). The first discretization is TRiSK, a C-grid, finite-volume method, that possesses many desirable mimetic properties, but has a low order accuracy. The second discretization was introduced for the first time by Peixoto (2016), and consists of modifications to the TRiSK scheme designed to achieve at least first-order accuracy in the L ∞ norm, with the loss of some of the mimetic properties. Tests on shallow-water and primitive-equation models show that the scheme due to Peixoto is indeed more accurate, but presents stability issues with respect to TRiSK. Here, TRiSK is indeed found to be often more stable in time and more robust with respect to errors in the geometric properties of the grid.

97 MATHEMATICS AND COMPUTING↗

Operator splitting method for simulation of dynamic flows in natural gas pipeline networks

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme is unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hands-on Performance Tuning of 3D Finite Difference Earthquake Simulation on GPU Fermi Chipset

3D simulation of earthquake ground motion is one of the most challenging computational problems in science. The emergence of graphic processing units (GPU) as an effective alternative to traditional general purpose processors has become increasingly capable in terms of accelerating scientific computing research. In this paper, we describe our experiences in porting AWP-ODC, a 3D finite difference seismic wave propagation code, to the latest GPU Fermi chipset. We completely rewrote this Fortran-based 13-point asymmetric stencil computation code in C and MPI-CUDA in order to take advantage of the powerful GPU computing capabilities. Our new CUDA code implemented the asymmetric 3D stencil on Fermi to make the best use of GPU on-chip memory for an aggressive parallel efficiency. Benchmark on NVIDIA Tesla M2090 demonstrated 10x speedup versus the original fully optimized AWP-ODC FORTRAN MPI code running on a single Intel Nehalem 2.4 GHz CPU socket (4 cores/CPU), and 15x speedup versus the same MPI code running on a single AMD Istanbul 2.6 GHz CPU socket (6 cores/CPU). Sustained single-GPU performance of 143.8 GFLOPS in single precision is benchmarked for the testing case of 128x128x960 mesh size.

3D Stencil Computation↗

Assessment of HRA method predictions against operating crew performance: Part II: Overall simulator data, HRA method predictions, and intra-method comparisons

This is the third in a series of four papers documenting two large-scale human reliability analysis (HRA) empirical studies – the International HRA Empirical Study and the US HRA Empirical Study. Here, the goal of the two studies was to develop an empirically-based understanding of the performance, strengths, and weaknesses of HRA methods by comparing HRA method predictions against actual operator performance in simulated accident scenarios on nuclear power plant (NPP) simulators. However, since in most cases only a single HRA team applied a given method in the International study, it was often difficult to separate analyst effects from variability in results related to the methods themselves. Since at least two HRA teams used each of the HRA methods in the US Study, intra-method comparisons were performed to identify method strengths and weaknesses independent of analyst specific effects where possible. This paper first summarizes the intra-method comparison results from the U.S. Study. Then, it discusses the reasons for the observed HRA predictive differences and the underlying methodological and guidance limitations that permitted the differences to arise. In the fourth paper, this information is combined wit h the results of the comparisons of method predictions to the actual crew data, from both the International and U.S. Studies, to develop the final conclusions about overall strengths and weaknesses of HRA methods.

97 MATHEMATICS AND COMPUTING↗

Poincaré complex diagonals and the Bass trace conjecture

For a finitely dominated Poincaré duality space M, we show how the first author's total obstruction μ M to the existence of a Poincaré embedding of the diagonal map M→M×M relates to the Reidemeister trace of the identity map of M. We then apply this relationship to show that μ M vanishes when suitable conditions on the fundamental group of M are satisfied.

97 MATHEMATICS AND COMPUTING↗

Upstreamness and downstreamness in input–output analysis from local and aggregate information

Abstract Ranking sectors and countries within global value chains is of paramount importance to estimate risks and forecast growth in large economies. However, this task is often non-trivial due to the lack of complete and accurate information on the flows of money and goods between sectors and countries, which are encoded in input–output (I–O) tables. In this work, we show that an accurate estimation of the role played by sectors and countries in supply chain networks can be achieved without full knowledge of the I–O tables, but only relying on local and aggregate information, e.g., the total intermediate demand per sector. Our method, based on a rank-1 approximation to the I–O table, shows consistently good performance in reconstructing rankings (i.e., upstreamness and downstreamness measures for countries and sectors) when tested on empirical data from the world input–output database. Moreover, we connect the accuracy of our approximate framework with the spectral properties of the I–O tables, which ordinarily exhibit relatively large spectral gaps. Our approach provides a fast and analytically tractable framework to rank constituents of a complex economy without the need of matrix inversions and the knowledge of finer intersectorial details.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mean-field limit of a hybrid system for multi-lane multi-class traffic

This article aims to study coupled mean-field equation and ODEs with discrete events motivated by vehicular traffic flow. Precisely, multi-lane traffic flow in presence of human-driven and autonomous vehicles is considered, with autonomous vehicles possibly influenced by external policymakers. First, a finite-dimensional hybrid system is developed based on the continuous Bando-Follow-the-Leader dynamics coupled with discrete events due to lane-change maneuvers. Then the mean-field limit of the finite-dimensional hybrid system is rigorously derived for the dynamics of the human-driven vehicles. The microscopic lane-change maneuvers of the human-driven vehicles generate a source term for the mean-field PDE. This leads to an infinite-dimensional hybrid system described by coupled Vlasov-type PDE, ODEs, and discrete events.

97 MATHEMATICS AND COMPUTING↗

Cumulants and the moment algebra: Tools for analyzing weak measurements

Recently it has been shown that cumulants significantly simplify the analysis of multipartite weak measurements. Here we consider the mathematical structure that underlies this and find that it can be formulated in terms of what we call the moment algebra. Apart from resulting in simpler proofs, the flexibility of this structure allows generalizations of the original results to a number of weak measurement scenarios, including one where the weakly interacting pointers reach thermal equilibrium with the probed system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Delta distributions supported on quadratic O(p,q)-invariant surfaces

An important subset of distributions encountered in physics is the set of multiplet delta distributions {delta}{sub c{sub y}}{sup (k)}, with support a quadratic O(p,q)-invariant surface c{sub y}{delta}-bar{l_brace}x is an element of R{sup n}:P(x)=y{r_brace}, n=p+q. The evaluation of these distributions for a general test function is not always sufficiently detailed in the classical literature, especially for those distributions that are defined as a regularization and/or when one needs their causal or anticausal version (for p=1 or q=1). This work intends to improve this situation by deriving explicit expressions for <{delta}{sub c{sub y}}{sup (k)},{phi}>, for all p,q is an element of Z{sub +}, for all k is an element of N, for all y is an element of R, and for all {phi} is an element of D(R{sup n}), in a form suitable for practical applications. In addition, we also apply to these distributions a new approach to regularization. Distributions that need to be regularized are (equivalently) defined as extensions of a partial distribution. This extension process reveals in a natural way that regularized multiplet delta distributions are in general, uncountably multivalued. In the work of Gel'fand and Shilov [Generalized Functions (Academic, New York, 1964), Vol. 1] four types of multiplet delta distributions with support the null space c{sub 0} were introduced: {delta}{sub 1}{sup (k)}(P), {delta}{sub 2}{sup (k)}(P) and {delta}{sup (k)}(P{sub +}), {delta}{sup (k)}(P{sub -}). Our regularization method explains why this particular nonuniqueness was observed and further discloses the full extent of this nonuniqueness.

97 MATHEMATICS AND COMPUTING↗