Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 International Journal of Applied Mathematics and Computer Science

2 2007

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Vlasov-Poisson equation

Sortuj według:

Ogranicz wyniki do:

Hermite spline interpolation on patches for parallelly solving the Vlasov-Poisson equation

Crouseilles N., Latu G., Sonnendrücker E.

International Journal of Applied Mathematics and Computer Science

2007

Vol. 17, no 3

335-349

This work is devoted to the numerical simulation of the Vlasov equation using a phase space grid. In contrast to Particle- In-Cell (PIC) methods, which are known to be noisy, we propose a semi-Lagrangian-type method to discretize the Vlasov equation in the two-dimensional phase space. As this kind of method requires a huge computational effort, one has to carry out the simulations on parallel machines. For this purpose, we present a method using patches decomposing the phase domain, each patch being devoted to a processor. Some Hermite boundary conditions allow for the reconstruction of a good approximation of the global solution. Several numerical results demonstrate the accuracy and the good scalability of the method with up to 64 processors. This work is a part of the CALVI project.

A direct and accurate adaptive semi-Lagrangian scheme for the Vlasov-Poisson equation

Campos Pinto M. M.

International Journal of Applied Mathematics and Computer Science

2007

Vol. 17, no 3

351-359

This article aims at giving a simplified presentation of a new adaptive semi-Lagrangian scheme for solving the (1 + 1)- dimensional Vlasov-Poisson system, which was developed in 2005 with Michel Mehrenberger and first described in (Campos Pinto and Mehrenberger, 2007). The main steps of the analysis are also given, which yield the first error estimate for an adaptive scheme in the context of the Vlasov equation. This article focuses on a key feature of our method, which is a new algorithm to transport multiscale meshes along a smooth flow, in a way that can be said optimal in the sense that it satisfies both accuracy and complexity estimates which are likely to lead to optimal convergence rates for the whole numerical scheme. From the regularity analysis of the numerical solution and how it gets transported by the numerical flow, it is shown that the accuracy of our scheme is monitored by a prescribed tolerance parameter \epsilon which represents the local interpolation error at each time step. As a consequence, the numerical solutions are proved to converge in L\infty towards the exact ones as \epsilon and \delta t tend to zero, and in addition to the numerical tests presented in (Campos Pinto and Mehrenberger, 2007), some complexity bounds are established which are likely to prove the optimality of the meshes.