A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

Garrett, C. Kristopher; Hauck, Cory D.

doi:10.1137/17M1134184

Title: A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework

Full Record
Other Related Research

Abstract

In this paper, we present a domain decomposition algorithm to accelerate the solution of Eulerian-type discretizations of the linear, steady-state Vlasov equation. The steady-state solver then forms a key component in the implementation of fully implicit or nearly fully implicit temporal integrators for the nonlinear Vlasov--Poisson system. The solver relies on a particular decomposition of phase space that enables the use of sweeping techniques commonly used in radiation transport applications. The original linear system for the phase space unknowns is then replaced by a smaller linear system involving only unknowns on the boundary between subdomains, which can then be solved efficiently with Krylov methods such as GMRES. Steady-state solves are combined to form an implicit Runge--Kutta time integrator, and the Vlasov equation is coupled self-consistently to the Poisson equation via a linearized procedure or a nonlinear fixed-point method for the electric field. Finally, numerical results for standard test problems demonstrate the efficiency of the domain decomposition approach when compared to the direct application of an iterative solver to the original linear system.

Authors:

Garrett, C. Kristopher ^[1]; Hauck, Cory D. ^[2]

Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

Publication Date:: Thu Apr 05 00:00:00 EDT 2018

Research Org.:: Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

Sponsoring Org.:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); ORNL Laboratory Directed Research and Development (LDRD) Program

OSTI Identifier:: 1435515

Report Number(s):: LA-UR-17-24638
Journal ID: ISSN 1064-8275

Grant/Contract Number:: AC52-06NA25396; AC05-00OR22725

Resource Type:: Accepted Manuscript

Journal Name:: SIAM Journal on Scientific Computing

Additional Journal Information:: Journal Volume: 40; Journal Issue: 2; Journal ID: ISSN 1064-8275

Publisher:: SIAM

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; Vlasov-Poisson; implicit time integration; domain decomposition

Citation Formats


                    Garrett, C. Kristopher, and Hauck, Cory D. A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework.  United States: N. p., 2018. 
Web.  doi:10.1137/17M1134184.

Copy to clipboard


                    Garrett, C. Kristopher, & Hauck, Cory D. A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework.  United States.  https://doi.org/10.1137/17M1134184

Copy to clipboard


                    Garrett, C. Kristopher, and Hauck, Cory D. Thu .  
"A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework".  United States.  https://doi.org/10.1137/17M1134184.  https://www.osti.gov/servlets/purl/1435515.

Copy to clipboard


                    
@article{osti_1435515,

  title        = {A Fast Solver for Implicit Integration of the Vlasov--Poisson System in the Eulerian Framework},

  author       = {Garrett, C. Kristopher and Hauck, Cory D.},

  abstractNote = {In this paper, we present a domain decomposition algorithm to accelerate the solution of Eulerian-type discretizations of the linear, steady-state Vlasov equation. The steady-state solver then forms a key component in the implementation of fully implicit or nearly fully implicit temporal integrators for the nonlinear Vlasov--Poisson system. The solver relies on a particular decomposition of phase space that enables the use of sweeping techniques commonly used in radiation transport applications. The original linear system for the phase space unknowns is then replaced by a smaller linear system involving only unknowns on the boundary between subdomains, which can then be solved efficiently with Krylov methods such as GMRES. Steady-state solves are combined to form an implicit Runge--Kutta time integrator, and the Vlasov equation is coupled self-consistently to the Poisson equation via a linearized procedure or a nonlinear fixed-point method for the electric field. Finally, numerical results for standard test problems demonstrate the efficiency of the domain decomposition approach when compared to the direct application of an iterative solver to the original linear system.},

  doi          = {10.1137/17M1134184},

  journal      = {SIAM Journal on Scientific Computing},

  number       = 2,

  volume       = 40,

  place        = {United States},

  year         = {Thu Apr 05 00:00:00 EDT 2018},

  month        = {Thu Apr 05 00:00:00 EDT 2018}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1137/17M1134184

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 4 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

On performance of Krylov smoothing for fully-coupled AMG preconditioners for VMS resistive MHD

Program Document Lin, Paul T. ; Shadid, John N. ; Tsuji, Paul H.

Here, this study explores the performance and scaling of a GMRES Krylov method employed as a smoother for an algebraic multigrid (AMG) preconditioned Newton- Krylov solution approach applied to a fully-implicit variational multiscale (VMS) nite element (FE) resistive magnetohydrodynamics (MHD) formulation. In this context a Newton iteration is used for the nonlinear system and a Krylov (GMRES) method is employed for the linear subsystems. The efficiency of this approach is critically dependent on the scalability and performance of the AMG preconditioner for the linear solutions and the performance of the smoothers play a critical role. Krylov smoothers are considered inmore »« less
Recovery Discontinuous Galerkin Jacobian-Free Newton-Krylov Method for All-Speed Flows

Conference Park, HyeongKae ; Nourgaliev, Robert ; Mousseau, Vincent ; ...

A novel numerical algorithm (rDG-JFNK) for all-speed fluid flows with heat conduction and viscosity is introduced. The rDG-JFNK combines the Discontinuous Galerkin spatial discretization with the implicit Runge-Kutta time integration under the Jacobian-free Newton-Krylov framework. We solve fully-compressible Navier-Stokes equations without operator-splitting of hyperbolic, diffusion and reaction terms, which enables fully-coupled high-order temporal discretization. The stability constraint is removed due to the L-stable Explicit, Singly Diagonal Implicit Runge-Kutta (ESDIRK) scheme. The governing equations are solved in the conservative form, which allows one to accurately compute shock dynamics, as well as low-speed flows. For spatial discretization, we develop a “recovery” familymore »« less
Full Text Available
Terascale Optimal PDE Simulations (TOPS) Center

Technical Report Pothen, Alex

This report covers the period from Oct. 2002 to Sep. 2004 when Old Dominion University (ODU) was the lead institution for the TOPS ISIC, until in Oct. 2004 Columbia University replaced ODU as the lead institution. The TOPS members from ODU focused on various aspects of the linear and nonlinear solver infrastructure required by the partial differential equations simulation codes, working directly with SciDAC teams from the Fusion Energy Sciences program: the Center for Extended agnetohydrodynamic Modeling (CEMM) at Princeton, and with the Center for Magnetic Reconnection Studies (CMRS) at University of New Hampshire. With CEMM we worked with theirmore »« less
https://doi.org/10.2172/890547

Full Text Available
Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations

Journal Article Pazner, Will ; Persson, Per -Olof - Journal of Computational Physics

In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge–Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems, which has seen success for fluid flow problems and discontinuous Galerkin discretizations. By transforming the resulting linear system of equations, one can obtain a method which is much less computationally expensive than the untransformed formulation, and which compares competitively with other time-integration schemes, such as diagonally implicit Runge–Kutta (DIRK) methods. We develop and test several ILU-based preconditioners effective for these large systems. We additionallymore »« less
Cited by 32
https://doi.org/10.1016/j.jcp.2017.01.050

Full Text Available
A Legendre–Fourier spectral method with exact conservation laws for the Vlasov–Poisson system

Journal Article Manzini, Gianmarco ; Delzanno, Gian Luca ; Vencels, Juris ; ... - Journal of Computational Physics

In this study, we present the design and implementation of an L²-stable spectral method for the discretization of the Vlasov–Poisson model of a collisionless plasma in one space and velocity dimension. The velocity and space dependence of the Vlasov equation are resolved through a truncated spectral expansion based on Legendre and Fourier basis functions, respectively. The Poisson equation, which is coupled to the Vlasov equation, is also resolved through a Fourier expansion. The resulting system of ordinary differential equation is discretized by the implicit second-order accurate Crank–Nicolson time discretization. The non-linear dependence between the Vlasov and Poisson equations is iterativelymore »« less
Cited by 18
https://doi.org/10.1016/j.jcp.2016.03.069

Full Text Available

Similar Records