Search NASA⌕ Search

SEARCH · Search NASA

Results for “explicit and implicit methods”

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 469 records · Page 26

Data-driven linear time advance operators for the acceleration of plasma physics simulation

In this study, we demonstrate the application of data-driven linear operator construction for time advance with a goal of accelerating plasma physics simulation. We apply dynamic mode decomposition (DMD) to data produced by the nonlinear SOLPS-ITER (Scrape-off Layer Plasma Simulator - International Thermonuclear Experimental Reactor) plasma boundary code suite in order to estimate a series of linear operators and monitor their predictive accuracy via online error analysis. We find that this approach defines when these dynamics can be represented by a sequence of approximate linear operators and is essential for providing consistent projections when compared to an unconstrained application. For linear diffusion and advection–diffusion fluid test problems, we construct and apply operators within explicit and implicit time advance schemes, demonstrating that stability can be robustly guaranteed in each case. We further investigate the use of the linear time advance operators within several integration methods including forward Euler, backward Euler, and the matrix exponential. The application of this method to simulation data from SOLPS-ITER, with varying levels of Markov chain Monte Carlo numerical noise, shows that constrained DMD operators yield a capability to identify, extract, and integrate a (slow) subset of the present timescales. Example applications show that for projected speedup factors of [Formula: see text], and [Formula: see text], a mean relative error of 3%, 5%, and 8% and maximum relative error less than 20% are achievable, which appears acceptable for typical SOLPS-ITER steady-state simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Semi-implicit continuum kinetic modeling of weakly collisional parallel transport in a magnetic mirror

We present implicit-explicit (IMEX) kinetic simulations of weakly collisional parallel plasma transport in magnetic mirror configurations using the continuum code COGENT. The numerical scheme employs a Jacobian-free Newton–Krylov method with algebraic multigrid preconditioning to overcome the severe time step limitations imposed by strong mirror forces in fully explicit schemes. Applied to parameters relevant to the Wisconsin HTS Axisymmetric Mirror experiment, the IMEX approach enables time steps up to 2.5×10 4 times larger than those permitted by explicit methods, resulting in a 2500× speedup in 1D–2V simulations of parallel transport with kinetic ions and Boltzmann electrons. Additionally, a reduced bounce-averaged model for a square mirror is implemented to support the computationally intensive fully kinetic simulations. The bounce-averaged formulation is used to evaluate the numerical convergence of the velocity-space discretization algorithms and to assess the role of the collision model by comparing simulations employing the nonlinear Fokker–Planck and the simplified Lenard–Bernstein–Dougherty collision operators.

Collision theories↗

Predictive formulation of the Nambu-Jona-Lasinio model

A novel strategy to handle divergences typical of perturbative calculations is implemented for the Nambu-Jona-Lasinio model and its phenomenological consequences investigated. The central idea of the method is to avoid the critical step involved in the regularization process, namely, the explicit evaluation of divergent integrals. This goal is achieved by assuming a regularization distribution in an implicit way and making use, in intermediary steps, only of very general properties of such regularization. The finite parts are separated from the divergent ones and integrated free from effects of the regularization. The divergent parts are organized in terms of standard objects, which are independent of the (arbitrary) momenta running in internal lines of loop graphs. Through the analysis of symmetry relations, a set of properties for the divergent objects are identified, which we denominate consistency relations, reducing the number of divergent objects to only a few. The calculational strategy eliminates unphysical dependencies of the arbitrary choices for the routing of internal momenta, leading to ambiguity-free, and symmetry-preserving physical amplitudes. We show that the imposition of scale properties for the basic divergent objects leads to a critical condition for the constituent quark mass such that the remaining arbitrariness is removed. The model becomes predictive in the sense that its phenomenological consequences do not depend on possible choices made in intermediary steps. Numerical results are obtained for physical quantities at the one-loop level for the pion and sigma masses and pion-quark and sigma-quark coupling constants.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Nonlinear Asymptotic Integration Algorithms for One-dimensional Autonomous Dissipative First-order Odes

Nonlinear asymptotic integrators are applied to one-dimensional, nonlinear, autonomous, dissipative, ordinary differential equations. These integrators, including a one-step explicit, a one-step implicit, and a one- and two-step midpoint algorithm, are designed to follow the asymptotic behavior of a system approaching a steady state. The methods require that the differential equation be written in a particular asymptotic form. This is always possible for a one-dimensional equation with a globally asymptotic steady state. In this case, conditions are obtained to guarantee that the implicit algorithms are well defined. Further conditions are determined for the implicit methods to be contractive. These methods are all first order accurate, while under certain conditions the midpoint algorithms may also become second order accurate. The stability of each method is investigated and an estimate of the local error is provided.

Haslach, Henry W., Jr.↗

Generalized Linear Covariance Analysis

This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

Navagation↗

Generalized Linear Covariance Analysis

This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

n/a↗

Buffered freepointer management memory system

A system and method of buffered freepointer management to handle burst traffic to fixed size structures in an external memory system. A circular queue stores implicitly linked free memory locations, along with an explicitly linked list in memory. The queue is updated at the head with newly released locations, and new locations from memory are added at the tail. When a freed location in the queue is reused, external memory need not be updated. When the queue is full, the system attempts to release some of the freepointers such as by dropping them if they are already linked, updating the linked list in memory only if those dropped are not already linked. Latency can be further reduced by loading new locations from memory when the queue is nearly empty, rather than waiting for empty condition, and by writing unlinked locations to memory when the queue is nearly full.

Jacob, Philip↗

A Matrix Computation View of the FastMap and RobustMap Dimension Reduction Algorithms

Given a set of pairwise object distances and a dimension $k$, FastMap and RobustMap algorithms compute a set of $k$-dimensional coordinates for the objects. These metric space embedding methods implicitly assume a higher-dimensional coordinate representation and are a sequence of translations and orthogonal projections based on a sequence of object pair selections (called pivot pairs). We develop a matrix computation viewpoint of these algorithms that operates on the coordinate representation explicitly using Householder reflections. The resulting Coordinate Mapping Algorithm (CMA) is a fast approximate alternative to truncated principal component analysis (PCA) and it brings the FastMap and RobustMap algorithms into the mainstream of numerical computation where standard BLAS building blocks are used. Motivated by the geometric nature of the embedding methods, we further show that truncated PCA can be computed with CMA by specific pivot pair selections. Describing FastMap, RobustMap, and PCA as CMA computations with different pivot pair choices unifies the methods along a pivot pair selection spectrum. We also sketch connections to the semi-discrete decomposition and the QLP decomposition.

99 GENERAL AND MISCELLANEOUS↗

Improving ADAM through an implicit-explicit (IMEX) time-stepping approach

The ADAM optimizer, often used in machine learning for neural network training, corresponds to an underlying ordinary differential equation (ODE) in the limit of very small learning rates. Here, this work shows that the classical ADAM algorithm is a first-order implicit-explicit (IMEX) Euler discretization of the underlying ODE. Employing the time discretization point of view, we propose new extensions of the ADAM scheme obtained by using higher-order IMEX methods to solve the ODE. Based on this approach, we derive a new optimization algorithm for neural network training that performs better than classical ADAM on several regression and classification problems.

97 MATHEMATICS AND COMPUTING↗

A framework to evaluate IMEX schemes for atmospheric models

We present a new evaluation framework for implicit and explicit (IMEX) Runge–Kutta time-stepping schemes. The new framework uses a linearized nonhydrostatic system of normal modes. We utilize the framework to investigate the stability of IMEX methods and their dispersion and dissipation of gravity, Rossby, and acoustic waves. We test the new framework on a variety of IMEX schemes and use it to develop and analyze a set of second-order low-storage IMEX Runge–Kutta methods with a high Courant–Friedrichs–Lewy (CFL) number. We show that the new framework is more selective than the 2-D acoustic system previously used in the literature. Schemes that are stable for the 2-D acoustic system are not stable for the system of normal modes.

54 ENVIRONMENTAL SCIENCES↗

On a class of TVD schemes for gas dynamic calculations

The purpose of this paper is to review a class of explicit and implicit second-order accurate Total Variation Diminishing (TVD) schemes and to show by numerical experiments, the performance of these schemes to the Euler equations of gas dynamics. The method of constructing these second-order accurate TVD schemes is sometimes known as the modified flux approach.

Yee, H. C.↗

The role of topography in geodetic gravity field modelling

Masses associated with the topography, bathymetry, and its isostatic compensation are a dominant source of gravity field variations, especially at shorter wavelengths. On global scales the topographic/isostatic effects are also significant, except for the lowest harmonics. In practice, though, global effects need not be taken into account as such effects are included in the coefficients of the geopotential reference fields. On local scales, the short-wavelength gravity variations due to the topography may, in rugged terrain, be an order of magnitude larger than other effects. In such cases, explicit or implicit terrain reduction procedures are mandatory in order to obtain good prediction results. Such effects may be computed by space-domain integration or by fast Fourier transformation (FFT) methods. Numerical examples are given for areas of the Canadian Rockies. In principle, good knowledge of the topographic densities is required to produce the smoothest residual field. Densities may be determined from sample measurements or by gravimetric means, but both are somewhat troublesome methods in practice. The use of a standard density, e.g., 2.67 g/cu cm, may often yield satisfactory results and may be put within a consistent theoretical framework. The independence of density assumptions is the key point of the classical Molodensky approach to the geodetic boundary value problem. The Molodensky solutions take into account that land gravity field observations are done on a non-level surface. Molodensky's problem may be solved by integral expansions or more effective FFT methods, but the solution should not be intermixed with the use of terrain reductions. The methods are actually complimentary and may both be required in order to obtain the smoothest possible signal, least prone to aliasing and other effects coming from sparse data coverage, typical of rugged topography.

Forsberg, R.↗

Verification of a fully implicit particle-in-cell method for the <!--${MathJax: TeX-AMS-MML_HTMLorMML}--> v &#x2225; -formalism of electromagnetic gyrokinetics in the XGC code

A fully implicit particle-in-cell method for handling the v ∥ -formalism of electromagnetic gyrokinetics has been implemented in XGC. By choosing the v ∥ -formalism, here we avoid introducing the nonphysical skin terms in Ampère's law, which are responsible for the well-known “cancellation problem” in the p ∥ -formalism. The v ∥ -formalism, however, is known to suffer from a numerical instability when explicit time integration schemes are used due to the appearance of a time derivative in the particle equations of motion from the inductive component of the electric field. Here, using the conventional δf scheme, we demonstrate that our implicitly discretized algorithm can provide numerically stable simulation results with accurate dispersive properties. We verify the algorithm using a test case for shear Alfvén wave propagation in addition to a case demonstrating the ion temperature gradient-kinetic ballooning mode (ITG-KBM) transition. The ITG-KBM transition case is compared to results obtained from other δf gyrokinetic codes/schemes, whose verification has already been archived in the literature.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development of an implicit electromagnetic capability for a hybrid gyrokinetic ion-fluid electron model

Here we report on the development and implementation of a hybrid kinetic ion–fluid electron model for electromagnetic COGENT simulations of edge plasmas. COGENT is a finite-volume gyrokinetic code that employs a locally field-aligned coordinate system combined with a mapped multi-block grid technology to handle strongly anisotropic edge plasma turbulence. The simulation model involves the long-wavelength limit of the ion gyrokinetic equation coupled to the vorticity and Ohm's law equations for the electromagnetic field perturbations. In order to handle the fast Alfvén wave time scales, an implicit-explicit time integration approach with a physics-based preconditioner is used. The model is successfully applied to the simulations of ion-scale resistive-drift ballooning turbulence in a toroidal annulus geometry. Substantial speed-up over a fully explicit time integration approach is observed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implicit TVD schemes for hyperbolic conservation laws in curvilinear coordinates

The Harten (1983, 1984) total variation-diminishing (TVD) schemes, constituting a one-parameter explicit and implicit, second-order-accurate family, have the property of not generating spurious oscillations when applied to one-dimensional, nonlinear scalar hyperbolic conservation laws and constant coefficient hyperbolic systems. These methods are presently extended to the multidimensional hyperbolic conservation laws in curvilinear coordinates. Means by which to linearize the implicit operator and solution strategies, in order to improve the computation efficiency of the implicit algorithm, are discussed. Numerical experiments with steady state airfoil calculations indicate that the proposed linearized implicit TVD schemes are accurate and robust.

Yee, H. C.↗

Extension of the noise propagation matrix method for higher mode solutions

The noise propagation matrix method (NPMM) has been extended to get higher mode solutions. Previous studies show that the NPMM can be used to compute the dominance ratio of a system. It is essentially the same as the Coarse Mesh Projection Method (CMPM), both of which use the noise propagation matrix (NPM) to determine the dominance ratio, either after finishing the Monte Carlo simulation or on-the-fly during the simulation. Since only the fundamental fission source information is explicitly utilized while the higher mode information is implicitly contained in the statistical noises, the NPMM can usually only give an approximate estimation of the dominance ratio after thousands of cycles. In this study, the NPMM is extended by simulating the higher modes explicitly, so that the dominance ratio estimation can be more accurate and efficient. Besides, the higher mode solutions can be obtained at the same time with good accuracy and efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-scale simulation of reaction, transport and deactivation in a SBA-16 supported catalyst for the conversion of ethanol to butadiene

Effective design of heterogeneous catalytic systems requires careful coordination of physiochemical phenomena that span orders or magnitude in length and time scales. Multiscale modelling and simulation tools can provide useful insight for understanding and improving the performance of such systems. Mesoporous silica catalyst support materials present a versatile platform wherein support attributes may be tuned to control transport phenomena throughout the system. In this study we develop an integrated multiscale modelling approach for the conversion of ethanol to butadiene over a SBA-16 mesoporous silica supported catalyst. We use molecular dynamics simulations to calculate domain specific diffusivities of reactants and products in the various domains of SBA-16's nanostructure. This is used to calculate a resultant effective diffusivity through its microstructure using finite element method (FEM) models of the tessellated unit cell. The resultant intraparticle effective diffusivity enables the development of a reduced-order reactor level FEM model that is able to implicitly account for the SBA-16's transport effects without the explicit consideration of its detailed geometry. Experimental bench-scale conversion data for the ethanol to butadiene process over SBA-16 is used to extract intrinsic kinetic rate constants for a simplified reaction mechanism using this reduced order bench-scale reactor FEM model. The model is able to reproduce experimental trends in conversion and activity lifetimes. The impact of varying key support attributes such as pore-size and particle size on catalytic activity lifetimes is then explored. We demonstrate the utility of this multi-scale modelling strategy in guiding catalyst design for the development of rational strategies to improve the performance of heterogeneous supported catalytic systems.

09 BIOMASS FUELS↗

Time-stepping DPG formulations for the heat equation

For a wide range of PDEs, the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan provides discrete stability starting from a coarse mesh and minimization of the residual in a user-controlled norm, among other appealing features. Research on DPG for transient problems has mainly focused on spacetime discretizations, which has theoretical advantages, but practical costs for computations and software implementations. The sole examination of time-stepping DPG formulations was performed by Führer, Heuer, and Gupta, who applied Rothe’s method to an ultraweak formulation of the heat equation to develop an implicit time-stepping scheme; their work emphasized theoretical results, including error estimates in time and space. Here, we follow Führer, Heuer, and Gupta in examining the heat equation; our focus is on numerical experiments, examining the stability and accuracy of several formulations, including primal as well as ultraweak, and explicit as well as implicit and Crank–Nicolson time-stepping schemes. We are additionally interested in communication-avoiding algorithms, and we therefore include a highly experimental formulation that places all the trace terms on the right-hand side of the equation.

97 MATHEMATICS AND COMPUTING↗