arXiv subjects

Mayya Tokman

Publications and source records attributed to Mayya Tokman.

13 recordsLinked to original sources

arXiv2025

Exploring exponential time integration for strongly magnetized charged particle motion

A fundamental task in particle-in-cell (PIC) simulations of plasma physics is solving for charged particle motion in electromagnetic fields. This problem is especially challenging when the plasma is strongly magnetized due to numerical stiffness arising from the wide separation in time scales between highly oscillatory gyromotion and overall macroscopic behavior of the system. In contrast to conventional finite difference schemes, we investigated exponential integration techniques to numerically simulate strongly magnetized charged particle motion. Numerical experiments with a uniform magnetic field show that exponential integrators yield superior performance for linear problems (i.e. configurations with an electric field given by a quadratic electric scalar potential) and are competitive with conventional methods for nonlinear problems with cubic and quartic electric scalar potentials.

physics.comp-ph↗

arXiv2025

Nystr\"om Type Exponential Integrators for Strongly Magnetized Charged Particle Dynamics

Solving for charged particle motion in electromagnetic fields (i.e. the particle pushing problem) is a computationally intensive component of particle-in-cell (PIC) methods for plasma physics simulations. This task is especially challenging when the plasma is strongly magnetized due numerical stiffness arising from the wide range of time scales between highly oscillatory gyromotion and long term macroscopic behavior. A promising approach to solve these problems is by a class of methods known as exponential integrators that can solve linear problems exactly and are A-stable. This work extends the standard exponential integration framework to derive Nystr\"om-type exponential integrators that integrates the Newtonian equations of motion as a second-order differential equation directly. In particular, we derive second-order and third-order Nystr\"om-type exponential integrators for strongly magnetized particle pushing problems. Numerical experiments show that the Nystr\"om-type exponential integators exhibit significant improvement in computation speed over the standard exponential integrators.

physics.comp-ph↗

arXiv2024

Low-synchronization Arnoldi Methods for the Matrix Exponential with Application to Exponential Integrators

High order exponential integrators require computing linear combination of exponential like $\varphi$-functions of large matrices $A$ times a vector $v$. Krylov projection methods are the most general and remain an efficient choice for computing the matrix-function-vector-product evaluation when the matrix is $A$ is large and unable to be explicitly stored, or when obtaining information about the spectrum is expensive. The Krylov approximation relies on the Gram-Schmidt (GS) orthogonalization procedure to produce the orthonormal basis $V_m$. In parallel, GS orthogonalization requires \textit{global synchronizations} for inner products and vector normalization in the orthogonalization process. Reducing the amount of global synchronizations is of paramount importance for the efficiency of a numerical algorithm in a massively parallel setting. We improve the parallel strong scaling properties of exponential integrators by addressing the underlying bottleneck in the linear algebra using low-synchronization GS methods. The resulting orthogonalization algorithms have an accuracy comparable to modified Gram-Schmidt yet are better suited for distributed architecture, as only one global communication is required per orthogonalization-step. We present geophysics-based numerical experiments and standard examples routinely used to test stiff time integrators, which validate that reducing global communication leads to better parallel scalability and reduced time-to-solution for exponential integrators.

math.NA↗

arXiv2023

Variable time-stepping exponential integrators for chemical reactors with analytical Jacobians

Computational chemical combustion problems are known to be stiff, and are typically solved with implicit time integration methods. A novel exponential time integrator, EPI3V, is introduced and applied to a spatially homogeneous isobaric reactive mixture. Three chemical mechanism of increasing complexity are considered, and in two cases the novel method can perform similar if not marginally better to a well-known implementation of a BDF implicit method. In one specific case we see relative performance degradation of the EPI3V to the implicit method. Despite this, the novel exponential method does converge for this case. A performance analysis of the exponential method is provided, demonstrating possible avenues for performance improvement.

math.NA↗

arXiv2022

A comparison of Leja- and Krylov-based iterative schemes for Exponential Integrators

Krylov-based algorithms have long been preferred to compute the matrix exponential and exponential-like functions appearing in exponential integrators. Of late, direct polynomial interpolation of the action of these exponential-like functions have been shown to be competitive with the Krylov methods. We analyse the performance of the state-of-the-art Krylov algorithm, KIOPS, and the method of polynomial interpolation at Leja points for a number of exponential integrators for various test problems and with varying amounts of stiffness. Additionally, we investigate the performance of an iterative scheme that combines both the KIOPS and Leja approach, named LeKry, that shows substantial improvements over both the Leja- and Krylov-based methods for certain exponential integrators. Whilst we do manage to single out a favoured iterative scheme for each of the exponential integrators that we consider in this study, we do not find any conclusive evidence for preferring either KIOPS or Leja for different classes of exponential integrators. We are unable to identify a superior exponential integrator, one that performs better than all others, for most, if not all of the problems under consideration. We, however, do find that the performance significantly depends on the interplay between the iterative scheme and the specific exponential integrator under consideration.

math.NA↗

arXiv2022

LeXInt: Package for Exponential Integrators employing Leja interpolation

We present a publicly available software for exponential integrators that computes the $\varphi_l(z)$ functions using polynomial interpolation. The interpolation method at Leja points have recently been shown to be competitive with the traditionally-used Krylov subspace method. The developed framework facilitates easy adaptation into any Python software package for time integration.

math.NA↗

arXiv2022

Exponential integrators for non-linear diffusion

The goal of this project is to compare the performance of exponential time integrators with traditional methods such as diagonally implicit Runge-Kutta methods in the context of solving the system of reduced magnetohydrodynamics (RMHD). In this report, we present initial results of a proof of concept study that shows that exponential integrators can be an efficient alternative to traditional integration schemes.

math.NA↗

arXiv2021

KIOPS: A fast adaptive Krylov subspace solver for exponential integrators

This paper presents a new algorithm KIOPS for computing linear combinations of $φ$-functions that appear in exponential integrators. This algorithm is suitable for large-scale problems in computational physics where little or no information about the spectrum or norm of the Jacobian matrix is known a priori. We first show that such problems can be solved efficiently by computing a single exponential of a modified matrix. Then our approach is to compute an appropriate basis for the Krylov subspace using the incomplete orthogonalization procedure and project the matrix exponential on this subspace. We also present a novel adaptive procedure that significantly reduces the computational complexity of exponential integrators. Our numerical experiments demonstrate that KIOPS outperforms the current state-of-the-art adaptive Krylov algorithm phipm.

math.NA↗

arXiv2021

High-order numerical solutions to the shallow-water equations on the rotated cubed-sphere grid

A novel numerical approach to solving the shallow-water equations on the sphere using high-order numerical discretizations in both space and time is proposed. A space-time tensor formalism is used to express the equations of motion covariantly and to describe the geometry of the rotated cubed-sphere grid. The spatial discretization is done with the direct flux reconstruction method, which is an alternative formulation to the discontinuous Galerkin approach. The equations of motion are solved in differential form and the resulting discretization is free from quadrature rules. It is well known that the time step of traditional explicit methods is limited by the phase velocity of the fastest waves. Exponential integration is employed to enable integrations with significantly larger time step sizes and improve the efficiency of the overall time integration. New multistep-type exponential propagation iterative methods of orders 4, 5 and 6 are constructed and applied to integrate the shallow-water equations in time. These new schemes enable time integration with high-order accuracy but without significant increases in computational time compared to low-order methods. The exponential matrix functions-vector products used in the exponential schemes are approximated using the complex-step approximation of the Jacobian in the Krylov-based KIOPS (Krylov with incomplete orthogonalization procedure solver) algorithm. Performance of the new numerical methods is evaluated using a set of standard benchmark tests.

math.NA↗

arXiv2017

EPIRK-W and EPIRK-K time discretization methods

Exponential integrators are special time discretization methods where the traditional linear system solves used by implicit schemes are replaced with computing the action of matrix exponential-like functions on a vector. A very general formulation of exponential integrators is offered by the Exponential Propagation Iterative methods of Runge-Kutta type (EPIRK) family of schemes. The use of Jacobian approximations is an important strategy to drastically reduce the overall computational costs of implicit schemes while maintaining the quality of their solutions. This paper extends the EPIRK class to allow the use of inexact Jacobians as arguments of the matrix exponential-like functions. Specifically, we develop two new families of methods: EPIRK-W integrators that can accommodate any approximation of the Jacobian, and EPIRK-K integrators that rely on a specific Krylov-subspace projection of the exact Jacobian. Classical order conditions theories are constructed for these families. A practical EPIRK-W method of order three and an EPIRK-K method of order four are developed. Numerical experiments indicate that the methods proposed herein are computationally favorable when compared to existing exponential integrators.

math.NA↗

arXiv2016

Preconditioned Implicit-Exponential (IMEXP) Time Integrators for Stiff Differential Equations

We propose two new classes of time integrators for stiff DEs: the implicit-explicit exponential (IMEXP) and the hybrid exponential methods. In contrast to the existing exponential schemes, the new methods offer significant computational advantages when used with preconditioners. Any preconditioner can be used with any of these new schemes. This leads to a broader applicability of exponential methods. The proof of stability and convergence of these integrators and numerical demonstration of their efficiency are presented.

math.NA↗

arXiv2016

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 Kelvin--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.

math.NA↗

arXiv2016

A new approach to constructing efficient stiffly accurate exponential propagation iterative methods of Runge-Kutta type (EPIRK)

The structural flexibility of the exponential propagation iterative methods of Runge-Kutta type (EPIRK) enables construction of particularly efficient exponential time integrators. While the EPIRK methods have been shown to perform well on stiff problems, all of the schemes proposed up to now have been derived using classical order conditions. In this paper we extend the stiff order conditions and the convergence theory developed for the exponential Rosenbrock methods to the EPIRK integrators. We derive stiff order conditions for the EPIRK methods and develop algorithms to solve them to obtain specific schemes. Moreover, we propose a new approach to constructing particularly efficient EPIRK integrators that are optimized to work with an adaptive Krylov algorithm. We use a set of numerical examples to illustrate the computational advantages that the newly constructed EPIRK methods offer compared to previously proposed exponential integrators.

math.NA↗