DOE OSTI · 1864994
A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem
Abstract
A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Liu, Shuang, Tang, Qi, Tang, Xian-zhu. 2021-12-13. A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem. https://doi.org/10.1137/20m1385470. https://searchnasa.com/record/osti%3A1864994/a-parallel-cut-cell-algorithm-for-the-free-boundary-grad-shafranov-problem
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.