Computer Science – Mathematical Software
Scientific paper
2012-04-17
Computer Science
Mathematical Software
Scientific paper
Direct discretization of continuum kinetic equations, like the Vlasov equation, are under-utilized because the distribution function generally exists in a high-dimensional (>3D) space and computational cost increases geometrically with dimension. We propose to use high-order finite-volume techniques with block-structured adaptive mesh refinement (AMR) to reduce the computational cost. The primary complication comes from a solution state comprised of variables of different dimensions. We develop the algorithms required to extend standard single-dimension block structured AMR to the multi-dimension case. Specifically, algorithms for reduction and injection operations that transfer data between mesh hierarchies of different dimensions are explained in detail. In addition, modifications to the basic AMR algorithm that enable the use of high-order spatial and temporal discretizations are discussed. Preliminary results for a standard 1D+1V Vlasov-Poisson test problem are presented. Results indicate that there is potential for significant savings for some classes of Vlasov problems.
Banks J. W.
Hittinger J. A. F.
No associations
LandOfFree
Block-Structured Adaptive Mesh Refinement Algorithms for Vlasov Simulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Block-Structured Adaptive Mesh Refinement Algorithms for Vlasov Simulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block-Structured Adaptive Mesh Refinement Algorithms for Vlasov Simulation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-290465