A scalable, fully implicit algorithm for the reduced two-field low-\(\beta\) extended MHD model
From MaRDI portal
Publication:1674701
DOI10.1016/j.jcp.2016.09.007zbMath1373.76340OpenAlexW2519317691MaRDI QIDQ1674701
Publication date: 26 October 2017
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2016.09.007
Jacobian-free Newton-Krylov solverimplicit algorithmsextended magnetohydrodynamicsphysics-based preconditioningparallel multigrid
Related Items (7)
An adaptive scalable fully implicit algorithm based on stabilized finite element for reduced visco-resistive MHD ⋮ A multigrid AMR algorithm for the study of magnetic reconnection ⋮ A multilevel block preconditioner for the HDG trace system applied to incompressible resistive MHD ⋮ Multigrid treatment of implicit continuum diffusion ⋮ INVITED: Slow manifold reduction for plasma science ⋮ Preconditioning a Newton-Krylov solver for all-speed melt pool flow physics ⋮ Isogeometric analysis for 2D and 3D curl-div problems: spectral symbols and fast iterative solvers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variational integrators for reduced magnetohydrodynamics
- A 2D high-\(\beta\) hall MHD implicit nonlinear solver.
- An implicit, nonlinear reduced resistive MHD solver
- Additive Schwarz-based fully coupled implicit methods for resistive Hall magnetohydrodynamic problems
- A four-field model for tokamak plasma dynamics
- Inexact Newton Methods
- A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations
- Magnetic Reconnection
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
This page was built for publication: A scalable, fully implicit algorithm for the reduced two-field low-\(\beta\) extended MHD model
