We present an algorithm for solving the heat equation on irregular time-dependent domains. It is based on the Cartesian grid embedded boundary algorithm of Johansen and Colella (J. Comput. Phys. 147(2):60-85) for discretizing Poisson's equation, combined with a second-order accurate discretization of the time derivative. This leads to a method that is second-order accurate in space and time. For the case where the boundary is moving, we convert the moving-boundary problem to a sequence of fixed-boundary problems, combined with an extrapolation procedure to initialize values that are uncovered as the boundary moves. We find that, in the moving boundary case, the use of Crank-Nicolson time discretization is unstable, requiring us to use the L0-stable implicit Runge-Kutta method of Twizell, Gumel, and Arigu.
Plasma simulations are often rendered challenging by the disparity of scales in time and in space which must be resolved. When these disparities are in distinctive zones of the simulation domain, a method which has proven to be effective in other areas (e.g. fluid dynamics simulations) is the mesh refinement technique. We briefly discuss the challenges posed by coupling this technique with
The numerical simulation of the driving beams in a heavy ion
fusion power plant is a challenging task, and simulation of
the power plant as a whole, or even of the driver, is not yet
possible. Despite the rapid progress in computer power, past
and anticipated, one must consider the use of the most advanced
numerical techniques, if we are to reach our goal expeditiously.
One of the difficulties of these simulations resides in the
disparity of scales, in time and in space, which must be resolved.
When these disparities are in distinctive zones of the simulation
region, a method which has proven to be effective in other areas
(e.g., fluid dynamics simulations) is the mesh refinement
technique. We discuss the challenges posed by the implementation
of this technique into plasma simulations (due to the presence
of particles and electromagnetic waves). We present the prospects
for and projected benefits of its application to heavy ion fusion,
in particular to the simulation of the ion source and the final
beam propagation in the chamber. A collaboration project is
under way at Lawrence Berkeley National Laboratory between the
Applied Numerical Algorithms Group (ANAG) and the Heavy Ion
Fusion group to couple the adaptive mesh refinement library
CHOMBO developed by the ANAG group to the particle-in-cell
accelerator code WARP developed by the Heavy Ion
Fusion–Virtual National Laboratory. We describe our progress
and present our initial findings.
It seems likely that improvements in arithmetic speed will continue to outpace advances in communications bandwidth. Furthermore, as more and more problems are working on huge datasets, it is becoming increasingly likely that data will be distributed across many processors because one processor does not have sufficient storage capacity. For these reasons, we propose that an inexact DFT such as an approximate matrixvector approach based on singular values or a variation of the Dutt-Rokhlin fastmultipole-based algorithm [9] may outperform any exact parallel FFT. The speedup may be as large as a factor of three in situations where FFT run time is dominated by communication. For the multipole idea we further propose that a method of "virtual charges" may improve accuracy, and we provide an analysis of the singular values that are needed for the approximate matrix-vector approaches.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.