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 55 records · Page 3

ARKODE: A Flexible IVP Solver Infrastructure for One-step Methods

We describe the ARKODE library of one-step time integration methods for ordinary differential equation (ODE) initial-value problems (IVPs). In addition to providing standard explicit and diagonally implicit Runge–Kutta methods, ARKODE supports one-step methods designed to treat additive splittings of the IVP, including implicit-explicit (ImEx) additive Runge–Kutta methods and multirate infinitesimal (MRI) methods. We present the role of ARKODE within the SUNDIALS suite of time integration and nonlinear solver libraries, the core ARKODE infrastructure for utilities common to large classes of one-step methods, as well as its use of “time stepper” modules enabling easy incorporation of novel algorithms into the library. Numerical results show example problems of increasing complexity, highlighting the algorithmic flexibility afforded through this infrastructure, and include a larger multiphysics application leveraging multiple algorithmic features from ARKODE and SUNDIALS.

97 MATHEMATICS AND COMPUTING↗

A multigrid method for a model of the implicit immersed boundary equations

Explicit time stepping schemes for the immersed boundary method require very small time steps in order to maintain stability. Solving the equations that arise from an implicit discretization is difficult. Recently, several different approaches have been proposed, but a complete understanding of this problem is still emerging. A multigrid method is developed and explored for solving the equations in an implicit time discretization of a model of the immersed boundary equations. The model problem consists of a scalar Poisson equation with conformation-dependent singular forces on an immersed boundary. This model does not include the inertial terms or the incompressibility constraint. The method is more efficient than an explicit method, but the efficiency gain is limited. The multigrid method alone may not be an effective solver, but when used as a preconditioner for Krylov methods, the speed-up over the explicit time method is substantial. For example, depending on the constitutive law for the boundary force, with a time step 100 times larger than the explicit method, the implicit method is about 15-100 times more efficient than the explicit method. A very attractive feature of this method is that the efficiency of the multigrid preconditioned Krylov solver is shown to be independent of the number of immersed boundary points.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the performance of exponential integrators for problems in magnetohydrodynamics

Exponential integrators have been introduced as an efficient alternative to explicit and implicit methods for integrating large stiff systems of differential equations. Over the past decades these methods have been studied theoretically and their performance was evaluated using a range of test problems. While the results of these investigations showed that exponential integrators can provide significant computational savings, the research on validating this hypothesis for large scale systems and understanding what classes of problems can particularly benefit from the use of the new techniques is in its initial stages. Resistive magnetohydrodynamic (MHD) modeling is widely used in studying large scale behavior of laboratory and astrophysical plasmas. In many problems numerical solution of MHD equations is a challenging task due to the temporal stiffness of this system in the parameter regimes of interest. In this paper we evaluate the performance of exponential integrators on large MHD problems and compare them to a state-of-the-art implicit time integrator. Both the variable and constant time step exponential methods of EPIRK-type are used to simulate magnetic reconnection and the Kevin–Helmholtz instability in plasma. Performance of these methods, which are part of the EPIC software package, is compared to the variable time step variable order BDF scheme included in the CVODE (part of SUNDIALS) library. We study performance of the methods on parallel architectures and with respect to magnitudes of important parameters such as Reynolds, Lundquist, and Prandtl numbers. We find that the exponential integrators provide superior or equal performance in most circumstances and conclude that further development of exponential methods for MHD problems is warranted and can lead to significant computational advantages for large scale stiff systems of differential equations such as MHD.

97 MATHEMATICS AND COMPUTING↗

A unified formulation of splitting-based implicit time integration schemes

Splitting-based time integration approaches such as fractional step, alternating direction implicit, operator splitting, and locally one dimensional methods partition the system of interest into components, and solve individual components implicitly in a cost-effective way. Here this work proposes a unified formulation of splitting time integration schemes in the framework of general-structure additive Runge–Kutta (GARK) methods. Specifically, we develop implicit-implicit (IMIM) GARK schemes, provide the order conditions for this class, and explain their application to partitioned systems of ordinary differential equations. We show that classical splitting methods belong to the IMIM GARK family, and therefore can be studied in this unified framework. New IMIM-GARK splitting methods are developed and tested using parabolic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FINAL REPORT: Multigrid for Systems and Time-Dependent PDEs

This report has two sections. The first section is the motivation for looking at differing discretizations on coarse grids for solving a parabolic equation using multigrid in time. The second section contains selected numerical results from the many experiments conducted. The most interesting result is that for explicit fine grid discretizations, the best coarse discretization (i.e. smallest convergence rates) is a weighting between implicit and explicit methods.

97 MATHEMATICS AND COMPUTING↗

Addressing numerical challenges in introducing a reactive transport code into a land surface model: a biogeochemical modeling proof-of-concept with CLM–PFLOTRAN 1.0

Abstract. We explore coupling to a configurable subsurface reactive transport code as a flexible and extensible approach to biogeochemistry in land surface models. A reaction network with the Community Land Model carbon–nitrogen (CLM-CN) decomposition, nitrification, denitrification, and plant uptake is used as an example. We implement the reactions in the open-source PFLOTRAN (massively parallel subsurface flow and reactive transport) code and couple it with the CLM. To make the rate formulae designed for use in explicit time stepping in CLMs compatible with the implicit time stepping used in PFLOTRAN, the Monod substrate rate-limiting function with a residual concentration is used to represent the limitation of nitrogen availability on plant uptake and immobilization. We demonstrate that CLM–PFLOTRAN predictions (without invoking PFLOTRAN transport) are consistent with CLM4.5 for Arctic, temperate, and tropical sites.Switching from explicit to implicit method increases rigor but introduces numerical challenges. Care needs to be taken to use scaling, clipping, or log transformation to avoid negative concentrations during the Newton iterations. With a tight relative update tolerance (STOL) to avoid false convergence, an accurate solution can be achieved with about 50 % more computing time than CLM in point mode site simulations using either the scaling or clipping methods. The log transformation method takes 60–100 % more computing time than CLM. The computing time increases slightly for clipping and scaling; it increases substantially for log transformation for half saturation decrease from 10-3 to 10-9 mol m-3, which normally results in decreasing nitrogen concentrations. The frequent occurrence of very low concentrations (e.g. below nanomolar) can increase the computing time for clipping or scaling by about 20 %, double for log transformation. Overall, the log transformation method is accurate and robust, and the clipping and scaling methods are efficient. When the reaction network is highly nonlinear or the half saturation or residual concentration is very low, the allowable time-step cuts may need to be increased for robustness for the log transformation method, or STOL may need to be tightened for the clipping and scaling methods to avoid false convergence.As some biogeochemical processes (e.g., methane and nitrous oxide reactions) involve very low half saturation and thresholds, this work provides insights for addressing nonphysical negativity issues and facilitates the representation of a mechanistic biogeochemical description in Earth system models to reduce climate prediction uncertainty.

58 GEOSCIENCES↗

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods

We consider specific realizations of different implicit generalized Runge–Kutta methods as applied to the numerical integration with respect to time of initial-boundary-value problems for the second-order parabolic equations and investigate their spectral stability. It is shown that all implicit generalized Runge–Kutta methods are unconditionally spectrally stable but some of them have the conditional property of monotonicity of the numerical solution with respect to time. The functions of spectral stability of the implicit generalized Runge–Kutta methods are rational. We compare the analytic solution of the nonstationary one-dimensional problem of heat conduction with the numerical solutions of this problem obtained by different implicit generalized Runge–Kutta methods. It is shown that, in this case, the application of the one-stage Radau methods with subsequent discretization of the problem with respect to the space variable leads to the classical forward finite difference scheme (Laasonen scheme), whereas the use of the one-stage Gauss–Legendre method leads to a six-point symmetric scheme (Crank–Nicolson scheme). It is shown that diagonally implicit generalized Nørsett and Burrage methods are realized in almost the same way as the one-stage Radau and Gauss–Legendre methods but their accuracy in the time step is 10–1000 times higher. On the basis of comparison of the numerical and analytic solutions, we conclude that, in order to get practically suitable numerical solutions without any restrictions on the time step, it is reasonable to use one- and three-stage generalized Radau methods or two- and four-stage Lobatto IIIC methods. All other explicit and implicit generalized Runge–Kutta methods require certain restrictions imposed on the time step.

42 ENGINEERING↗

A Two-Step RKC Method for Time-Dependent PDEs

An integration method is discussed which has been designed to treat parabolic and hyperbolic terms explicitly and stiff reaction terms implicitly. The method is a special two-step form of the one-step IMEX (IMplicit-EXplicit) RKC (Runge-Kutta-Chebyshev) method. The special two-step form is introduced with the aim of getting a non-zero imaginary stability boundary which is zero for the one-step method. Having a non-zero imaginary stability boundary allows, for example, the integration of pure advection equations space-discretized with centered schemes, the integration of damped or viscous wave equations, the integration of coupled sound and heat flow equations, etc. For our class of methods it also simplifies the choice of temporal step sizes satisfying the von Neumann stability criterion, by embedding a thin long rectangle inside the stability region.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Lyapunov and Sacker–Sell spectral stability theory for one-step methods

Approximation theory for Lyapunov and Sacker–Sell spectra based upon QR techniques is used to analyze the stability of a one-step method solving a time-dependent (nonautonomous) linear ordinary differential equation (ODE) initial value problem in terms of the local error. Integral separation is used to characterize the conditioning of stability spectra calculations. The stability of the numerical solution by a one-step method of a nonautonomous linear ODE using real-valued, scalar, nonautonomous linear test equations is justified. This analysis is used to approximate exponential growth/decay rates on finite and infinite time intervals and establish global error bounds for one-step methods approximating uniformly, exponentially stable trajectories of nonautonomous and nonlinear ODEs. A time-dependent stiffness indicator and a one-step method that switches between explicit and implicit Runge–Kutta methods based upon time-dependent stiffness are developed based upon the theoretical results.

97 MATHEMATICS AND COMPUTING↗

A Second Order Self-Consistent IMEX Method for Radiation Hydrodynamics

We present a second order non-linearly consistent implicit/explicit (methods that use com- bination of implicit/explicit discretizations are often referred to as IMEX (IMplicit/EXplicit) methods [2,1,3]) time integration technique for solving radiation hydrodynamics problems. The idea is to hybridize an implicit and an explicit discretization in a nonlinearly consis- tent way in order to achieve second order time convergent calculations. In this scope, the hydrodynamics equations are discretized explicitly making use of the capability of well- understood explicit schemes. On the other hand , the radiation diffusion part is solved implicitly. In the view of the non-linearly consistent IMEX method, the hydrodynamics equations are solved as part of the non-linear function evaluation within the framework of the Jacobian-Free Newton Krylov (JFNK) method [16,14]. This is to avoid order reductions in time convergence due to the operator splitting. We present results from several test prob- lems in order to validate the numerical order of the scheme. For each test, we established second order time convergence.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Explicit Integration of Extremely Stiff Reaction Networks: Partial Equilibrium Methods

In two preceding papers [1,2] we have shown that, when reaction networks are well removed from equilibrium, explicit asymptotic and quasi-steady-state approximations can give algebraically stabilized integration schemes that rival standard implicit methods in accuracy and speed for extremely stiff systems. However, we also showed that these explicit methods remain accurate but are no longer competitive in speed as the network approaches equilibrium. In this paper we analyze this failure and show that it is associated with the presence of fast equilibration timescales that neither asymptotic nor quasi-steady-state approximations are able to remove efficiently from the numerical integration. Based on this understanding, we develop a partial equilibrium method to deal effectively with the new partial equilibrium methods, give an integration scheme that plausibly can deal with the stiffest networks, even in the approach to equilibrium, with accuracy and speed competitive with that of implicit methods. Thus we demonstrate that algebraically stabilized explicit methods may offer alternatives to implicit integration of even extremely stiff systems, and that these methods may permit integration of much larger networks than have been feasible previously in a variety of fields.

Guidry, Mike W↗

PIROCK: A swiss-knife partitioned implicit–explicit orthogonal Runge–Kutta Chebyshev integrator for stiff diffusion–advection–reaction problems with or without noise

A partitioned implicit–explicit orthogonal Runge–Kutta method (PIROCK) is proposed for the time integration of diffusion–advection–reaction problems with possibly severely stiff reaction terms and stiff stochastic terms. The diffusion terms are solved by the explicit second order orthogonal Chebyshev method (ROCK2), while the stiff reaction terms (solved implicitly) and the advection and noise terms (solved explicitly) are integrated in the algorithm as finishing procedures. It is shown that the various coupling (between diffusion, reaction, advection and noise) can be stabilized in the PIROCK method. The method, implemented in a single black-box code that is fully adaptive, provides error estimators for the various terms present in the problem, and requires from the user solely the right-hand side of the differential equation. Numerical experiments and comparisons with existing Chebyshev methods, IMEX methods and partitioned methods show the efficiency and flexibility of our new algorithm.

97 MATHEMATICS AND COMPUTING↗

Fast explicit solutions for neutrino-electron scattering: Explicit asymptotic methods

Here, we present results of explicit asymptotic approximations applied to neutrino-electron scattering in a representative model of neutrino population evolution under conditions characteristic of core-collapse supernova explosions or binary neutron star mergers. It is shown that this approach provides stable solutions of these stiff systems of equations, with accuracy and time stepping comparable to that for standard implicit treatments such as backward Euler, fixed point iteration, and Anderson-accelerated fixed point iteration. Because each time step can be computed more rapidly with the explicit asymptotic approximation than with implicit methods, this suggests that algebraically stabilized explicit integration methods could be used to compute neutrino evolution coupled to hydrodynamics more efficiently in stellar explosions and mergers than the methods currently in use.

79 ASTRONOMY AND ASTROPHYSICS↗

Numerical Methods for the Wave Equation

We examine a variety of numerical methods, both explicit and implicit, for the wave equation. Numerical dispersion relations are used to determine stability and to analyse the linear group velocity. We find that although implicit methods can allow for large time step, the group velocity becomes increasingly inaccurate with increasing step-size.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Interpenetrating Plasma Simulations

This project investigated multifluid models for simulating interpenetrating plasmas. These models solve the Euler equations for each plasma stream along with an appropriate model for electron dynamics. The project developed a novel code, Euclid, that simulates these models using high-order conservative spatial discretization methods and explicit and semi-implicit time integration methods. Euclid was used to solve several multifluid test cases representative of plasma dynamics in high-energy density physics experiments. Kinetic simulations of interpenetrating flows using the LOKI code revealed novel physical effects of the ion-ion streaming instability. A new multi-flow collision operator was developed for the LOKI code. A simple model of the ion-ion streaming instability was also developed. Several presentations were given on the project results; three journal articles have been published, one has been submitted, and two are planned.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗

Formulation and numerical analysis of a fully-coupled dynamically deforming electromagnetic wire

Here, an electromagnetic beam model is developed for the simulation of actuated electronic textiles. The beam is solved using a nonlinear director-based kinematic description with additional temperature and electric potential fields along its length. The three fields are fully coupled by mutual dependences on the deformation, Lorenz force, back electromotive force, temperature dependent constitutive responses, and the Seebeck effect. Instead of solving Maxwell's equations in full detail, a quasistatic approximation is used to solve the electric potential in the presence of a moving material medium. The current-carrying beam approximation is used to further simplify the solution space for the potential. While this formulation alleviates the spatial and temporal discretization restrictions, the coupled problem is an index-1 semi-explicit Differential Algebraic Equation requiring special treatment. The time dependent problem is solved using different Runge-Kutta methods. Diagonally implicit Runge-Kutta methods and explicit Runge-Kutta methods using implicit solution of the electric potential problem are explored. The finite element model is implemented using the open source package FEniCS, which is able to automatically generate the linearizations of the multiphysics equations required for the implicit solutions. A model problem is constructed with which to test and analyze the physical formulation and numerical solution techniques. The time stepping methods are verified using the convergence orders of the higher-order Runge-Kutta methods. Runtime comparisons show that the explicit methods are generally more computationally efficient than the implicit schemes used for this problem. For the implicit schemes, a staggered solution is significantly faster than a monolithic solution at most time step sizes. However, at very large time steps, such as those that would be used for dynamic relaxation, the monolithic solution can be more efficient than the staggered solution.

36 MATERIALS SCIENCE↗