Search NASA⌕ Search

SEARCH · Search NASA

Results for “linearly implicit”

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 91 records · Page 5

SUPG Finite Element Simulations of Compressible Flows for Aerothermodynamic Applications

This viewgraph presentation reviews the Streamline-Upwind Petrov-Galerkin (SUPG) Finite Element Simulation. It covers the background, governing equations, weak formulation, shock capturing, inviscid flux discretization, time discretization, linearization, and implicit solution strategies. It also reviews some applications such as Type IV Shock Interaction, Forward-Facing Cavity and AEDC Sharp Double Cone.

Kirk, Benjamin S.↗

Additive Polynomial Time Integrators, Part I: Framework and Fully Implicit-Explicit Collocation Methods

In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with arbitrary order-of-accuracy and varying degree of implicitness. In this first work, we focus on a new class of implicit-explicit polynomial block methods that are based on fully implicit Runge–Kutta methods with Radau nodes and that possess high stage order. Here, we show that the new fully implicit-explicit (FIMEX) integrators have improved stability compared to existing IMEX Runge–Kutta methods, while also being more computationally efficient due to recent developments in preconditioning techniques for solving the associated systems of nonlinear equations. For PDEs on periodic domains where the implicit component is trivial to invert, we will show how parallelization of the right-hand side evaluations can be exploited to obtain significant speedup compared to existing serial IMEX Runge–Kutta methods. For parallel (in space) finite element discretizations, the new methods can achieve orders of magnitude better accuracy than existing IMEX Runge–Kutta methods and/or achieve a given accuracy several times times faster in terms of computational runtime.

97 MATHEMATICS AND COMPUTING↗

A projection preconditioner for solving the implicit immersed boundary equations

This study presents a method for solving the linear semi-implicit immersed boundary equations which avoids the severe time step restriction presented by explicit-time methods. The Lagrangian variables are eliminated via a Schur complement to form a purely Eulerian saddle point system, which is preconditioned by a projection operator and then solved by a Krylov subspace method. From the viewpoint of projection methods, we derive an ideal preconditioner for the saddle point problem and compare the efficiency of a number of simpler preconditioners that approximate this perfect one. For low Reynolds number and high stiffness, one particular projection preconditioner yields an efficiency improvement of the explicit IB method by a factor around thirty. Substantial speed-ups over explicit-time method are achieved for Reynolds number below 100. In conclusion, this speedup increases as the Eulerian grid size and/or the Reynolds number are further reduced.

42 ENGINEERING↗

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗

Strong Stability Preserving Integrating Factor Two-Step Runge-Kutta Methods

In this report, problems with components that feature significantly different time scales, where the stiff time-step restriction comes from a linear component, implicit-explicit (IMEX) methods alleviate this restriction if the concern is linear stability. However, when nonlinear non-inner-product stability properties are of interest, such as in the evolution of hyperbolic partial differential equations with shocks or sharp gradients, linear inner-product stability is no longer sufficient for convergence, and so strong stability preserving (SSP) methods are often needed. Where the SSP property is needed, IMEX SSP Runge-Kutta (SSP-IMEX) methods have very restrictive time-steps. An alternative to SSP-IMEX schemes is to adopt an integrating factor approach to handle the linear component exactly and step the transformed problem forward using some time-evolution method. The strong stability properties of integrating factor Runge-Kutta methods were established in Isherwood et al. (SIAM J Numer Anal 56(6):3276–3307, 2018), where it was shown that it is possible to define explicit integrating factor Runge-Kutta methods that preserve strong stability properties satisfied by each of the two components when coupled with forward Euler time-stepping. It was proved that the solution will be SSP if the transformed problem is stepped forward with an explicit SSP Runge-Kutta method that has non-decreasing abscissas. However, explicit SSP Runge-Kutta methods have an order barrier of p=4, and sometimes higher order is desired. In this work we consider explicit SSP two-step Runge-Kutta integrating factor methods to raise the order. We show that strong stability is ensured if the two-step Runge-Kutta method used to evolve the transformed problem is SSP and has non-decreasing abscissas. We find such methods up to eighth order and present their SSP coefficients. Adding a step allows us to break the fourth order barrier on explicit SSP Runge-Kutta methods; furthermore, our explicit SSP two-step Runge-Kutta methods with non-decreasing abscissas typically have larger SSP coefficients than the corresponding one-step methods. A selection of our methods are tested for convergence and demonstrate the design order. We also show, for selected methods, that the SSP time-step predicted by the theory is a lower bound of the allowable time-step for linear and nonlinear problems that satisfy the total variation diminishing (TVD) condition. We compare some of the non-decreasing abscissa SSP two-step Runge-Kutta methods to previously found methods that do not satisfy this criterion on linear and nonlinear TVD test cases to show that this non-decreasing abscissa condition is indeed necessary in practice as well as theory. We also compare these results to our SSP integrating factor Runge-Kutta methods designed in Isherwood et al. (2018).

97 MATHEMATICS AND COMPUTING↗

Fast solvers for tokamak fluid models with PETSc

Multigrid (MG) is widely recognized as a highly effective solver for the model problem, the Laplacian, but textbook MG fails on most problems of interest. MG methods have been applied to complex, real-world applications with careful consideration of the physical model and discretization. In this work we develop the first step in applying MG methods to science and engineering relevant magnetohydrodynamics (MHD) tokamak models in the M3D-C1 (https://m3dc1.pppl.gov) fusion energy science code. The semi-implicit time integrator in M3D-C1 is composed of many linear solves. The implicit advance of the momentum equation is the most challenging and is the focus of this work. The current production solver in M3D-C1 is a block Jacobi (BJ) preconditioner within a Krylov solver, where blocks group degrees of freedom on planes of constant toroidal coordinate. BJ convergence degrades as the number of planes increases due to the spectral properties of the matrix preconditioned with BJ. The partially magnetic field-aligned, regular toroidal grid structure in M3D-C1 is amenable to semi-coarsening geometric MG in the toroidal direction. This paper develops such a solver and demonstrates competitive performance on a runaway electron model of a SPARC (https://cfs.energy/technology/sparc) disruption, and superior robustness on a stellarator model on which the BJ solver fails to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical approximation of boundary conditions with applications to inviscid equations of gas dynamics

A comprehensive overview of the state of the art of well-posedness and stability analysis of difference approximations for initial boundary value problems of the hyperbolic type is presented. The applicability of recent theoretical development to practical calculations for nonlinear gas dynamics is examined. The one dimensional inviscid gas dynamics equations in conservation law form are selected for numerical experiments. The class of implicit schemes developed from linear multistep methods in ordinary differential equations is chosen and the use of linear extrapolation as an explicit or implicit boundary scheme is emphasized. Specification of boundary data in the primitive variables and computation in terms of the conservative variables in the interior is discussed. Some numerical examples for the quasi-one-dimensional nozzle are given.

Yee, H. C.↗

The JOREK non-linear extended MHD code and applications to large-scale instabilities and their control in magnetically confined fusion plasmas

JOREK is a massively parallel fully implicit non-linear extended magneto-hydrodynamic (MHD) code for realistic tokamak X-point plasmas. It has become a widely used versatile simulation code for studying large-scale plasma instabilities and their control and is continuously developed in an international community with strong involvements in the European fusion research programme and ITER organization. This article gives a comprehensive overview of the physics models implemented, numerical methods applied for solving the equations and physics studies performed with the code. A dedicated section highlights some of the verification work done for the code. A hierarchy of different physics models is available including a free boundary and resistive wall extension and hybrid kinetic-fluid models. The code allows for flux-surface aligned iso-parametric finite element grids in single and double X-point plasmas which can be extended to the true physical walls and uses a robust fully implicit time stepping. Particular focus is laid on plasma edge and scrape-off layer (SOL) physics as well as disruption related phenomena. Among the key results obtained with JOREK regarding plasma edge and SOL, are deep insights into the dynamics of edge localized modes (ELMs), ELM cycles, and ELM control by resonant magnetic perturbations, pellet injection, as well as by vertical magnetic kicks. Also ELM free regimes, detachment physics, the generation and transport of impurities during an ELM, and electrostatic turbulence in the pedestal region are investigated. Regarding disruptions, the focus is on the dynamics of the thermal quench (TQ) and current quench triggered by massive gas injection and shattered pellet injection, runaway electron (RE) dynamics as well as the RE interaction with MHD modes, and vertical displacement events. Also the seeding and suppression of tearing modes (TMs), the dynamics of naturally occurring TQs triggered by locked modes, and radiative collapses are being studied.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Direct and implicit optical matrix-vector algorithms

New direct and implicit algorithms for optical matrix-vector and systolic array processors are considered. Direct rather than indirect algorithms to solve linear systems and implicit rather than explicit solutions to solve second-order partial differential equations are discussed. In many cases, such approaches more properly utilize the advantageous features of optical systolic array processors. The matrix-decomposition operation (rather than solution of the simplified matrix-vector equation that results) is recognized as the computationally burdensome aspect of such problems that should be computed on an optical system. The Householder QR matrix-decomposition algorithm is considered as a specific example of a direct solution. Extensions to eigenvalue computation and formation of matrices of special structure are also noted.

Casasent, D.↗

High-order, linearly stable, partitioned solvers for general multiphysics problems based on implicit–explicit Runge–Kutta schemes

This work introduces a general framework for constructing high-order, linearly stable, partitioned solvers for multiphysics problems from a monolithic implicit–explicit Runge–Kutta (IMEX-RK) discretization of the semi-discrete equations. The generic multiphysics problem is modeled as a system of n systems of partial differential equations where the i th subsystem is coupled to the other subsystems through a coupling term that can depend on the state of all the other subsystems. This coupled system of partial differential equations reduces to a coupled system of ordinary differential equations via the method of lines where an appropriate spatial discretization is applied to each subsystem. The coupled system of ordinary differential equations is taken as a monolithic system and discretized using an IMEX-RK discretization with a specific implicit–explicit decomposition that introduces the concept of a predictor for the coupling term. We propose four coupling predictors that enable the monolithic system to be solved in a partitioned manner, i.e., subsystem-by-subsystem, and preserve the IMEX-RK structure and therefore the design order of accuracy of the monolithic scheme. The four partitioned solvers that result from these predictors are high-order accurate, allow for maximum re-use of existing single-physics software, and two of the four solvers allow the subsystems to be solved in parallel at a given stage and time step. We also analyze the stability of a coupled, linear model problem with a specific coupling structure and show that one of the partitioned solvers achieves unconditional linear stability for this problem, while the others are unconditionally stable only for certain values of the coupling strength. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems including a simple linear system of ODEs, advection–diffusion–reaction systems, fluid–structure interaction problems, and particle-laden flows, where we verify the design order of the IMEX schemes and study various stability properties.

97 MATHEMATICS AND COMPUTING↗

Implicit and Implicit–Explicit Strong Stability Preserving Runge–Kutta Methods with High Linear Order

Strong stability preserving (SSP) time discretizations preserve the monotonicity properties satisfied by the spatial discretization when coupled with the first order forward Euler, under a certain time-step restriction. The search for high order strong stability preserving time-stepping methods with high order and large allowable time-step has been an active area of research. It is known that implicit SSP Runge–Kutta methods exist only up to sixth order; however, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and we can find implicit SSP Runge–Kutta methods of any linear order. In the current work we find implicit SSP Runge–Kutta methods with high linear order p lin ≤ 9 and nonlinear orders p = 2,3,4, that are optimal in terms of allowable SSP time-step. Next, we formulate a novel optimization problem for implicit–explicit (IMEX) SSP Runge–Kutta methods and find optimized IMEX SSP Runge–Kutta pairs that have high linear order p lin ≤ 7 and nonlinear orders up to p = 4. Here, we also find implicit methods with large linear stability regions that pair with known explicit SSP Runge–Kutta methods. These methods are then tested on sample problems to demonstrate the sharpness of the SSP coefficient and the typical behavior of these methods on test problems.

97 MATHEMATICS AND COMPUTING↗

Navier-Stokes analysis of solid propellant rocket motor internal flows

A multidimensional implicit Navier-Stokes analysis that uses numerical solution of the ensemble-averaged Navier-Stokes equations in a nonorthogonal, body-fitted, cylindrical coordinate system has been applied to the simulation of the steady mean flow in solid propellant rocket motor chambers. The calculation procedure incorporates a two-equation (k-epsilon) turbulence model and utilizes a consistently split, linearized block-implicit algorithm for numerical solution of the governing equations. The code was validated by comparing computed results with the experimental data obtained in cylindrical-port cold-flow tests. The agreement between the computed and experimentally measured mean axial velocities is excellent. The axial location of transition to turbulent flow predicted by the two-equation (k-epsilon) turbulence model used in the computations also agrees well with the experimental data. Computations performed to simulate the axisymmetric flowfield in the vicinity of the aft field joint in the Space Shuttle solid rocket motor using 14,725 grid points show the presence of a region of reversed axial flow near the downstream edge of the slot.

Sabnis, J. S.↗

Navier-Stokes analysis of two- and three-dimensional flow field in solid rocket motors with segment joints

A multidimensional implicit Navier-Stokes analysis which uses numerical solution of ensemble-averaged Navier-Stokes equations in a nonorthogonal bodyfitted cylindrical-polar coordinate system has been applied to simulation of the internal flow field in solid-propellant rocket motor chambers with segment joints. The calculation procedure incorporates a two-equation (k-epsilon) turbulence model and utilizes a consistently split, linearized block-implicit algorithm for numerical solution of the governing equations. Computations performed to simulate the axisymmetric flow field in the vicinity of the aft field joint in the Space Shuttle SRB using 14,725 grid points show the presence of a region of reversed axial flow near the downstream edge of the slot. Calculations were also performed for two cases involving asymmetric three-dimensional flow in the vicinity of the aft field joint in the SRB using 721,525 grid points to estimate circumferential velocities and pressure gradients at the joint.

Sabnis, J. S.↗

Multigrid Reduction in Time for Nonlinear Parabolic Problems

The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.

97 MATHEMATICS AND COMPUTING↗

A review of high order strong stability preserving two-derivative explicit, implicit, and IMEX methods

High order strong stability preserving time discretizations ensure the nonlinear non-inner-product strong stability properties of spatial discretizations suited for the stable simulation of hyperbolic PDEs in a wide variety of application areas including fluid dynamics, magnetohydrodynamics, semiconductor devices, electromagnetics, and astrophysics. Over the past decade multiderivative time-stepping have been increasingly used for the time-evolution hyperbolic PDEs, so that the strong stability properties of these methods have become important. In this work we review sufficient conditions for a two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and different conditions on the second derivative. In particular we present the strong stability preserving theory for explicit and implicit two-derivative Runge–Kutta schemes, including a special condition on the second derivative under which these implicit methods may be unconditionally strong stability preserving. This special condition is natural for the stiff component of wide range of plasma physics problems, and can be useful in the context of strong stability preserving implicit-explicit multi-derivative Runge–Kutta schemes, where the time-step restriction is then independent of the stiff term. Lastly, we present the strong stability preserving theory for implicit-explicit multi-derivative general linear methods, and some novel second and third order methods where the time-step restriction is independent of the stiff term.

97 MATHEMATICS AND COMPUTING↗

Numerical methods for one-dimensional reaction-diffusion equations arising in combustion theory

A review of numerical methods for one-dimensional reaction-diffusion equations arising in combustion theory is presented. The methods reviewed include explicit, implicit, quasi-linearization, time linearization, operator-splitting, random walk and finite-element techniques and methods of lines. Adaptive and nonadaptive procedures are also reviewed. These techniques are applied first to solve two model problems which have exact traveling wave solutions with which the numerical results can be compared. This comparison is performed in terms of both the wave profile and computed wave speed. It is shown that the computed wave speed is not a good indicator of the accuracy of a particular method. A fourth-order time-linearized, Hermitian compact operator technique is found to be the most accurate method for a variety of time and space sizes.

Ramos, J. I.↗

Least-squares finite element methods for compressible Euler equations

A method based on backward finite differencing in time and a least-squares finite element scheme for first-order systems of partial differential equations in space is applied to the Euler equations for gas dynamics. The scheme minimizes the L-sq-norm of the residual within each time step. The method naturally generates numerical dissipation proportional to the time step size. An implicit method employing linear elements has been implemented and proves robust. For high-order elements, computed solutions based on the L-sq method may have oscillations for calculations at similar time step sizes. To overcome this difficulty, a scheme which minimizes the weighted H1-norm of the residual is proposed and leads to a successful scheme with high-degree elements. Finally, a conservative least-squares finite element method is also developed. Numerical results for two-dimensional problems are given to demonstrate the shock resolution of the methods and compare different approaches.

Jiang, Bo-Nan↗