Symplectic finite-difference methods for solving partial differential equations

arXiv1206.1743MaRDI QIDQ6233545FDOQ6233545

Publication date: 8 June 2012

Abstract: The usual explicit finite-difference method of solving partial differential equations is limited in stability because it approximates the exact amplification factor by power-series. By adapting the same exponential-splitting method of deriving symplectic integrators, explicit symplectic finite-difference methods produce Saul'yev-type schemes which approximate the exact amplification factor by rational-functions. As with conventional symplectic integrators, these symplectic finite-difference algorithms preserve important qualitative features of the exact solution. Thus the symplectic diffusing algorithm is {it unconditionally stable} and the symplectic advection algorithm is {it unitary}. There is a one-to-one correspondence between symplectic integrators and symplectic finite-difference methods, including the key idea that one can systematically improve an algorithm by matching its modified Hamiltonian more closely to the original Hamiltonian. Consequently, the entire arsenal of symplectic integrators can be used to produce arbitrary high order time-marching algorithms for solving the diffusion and the advection equation.

Mathematics Subject Classification ID

Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Finite difference methods for boundary value problems involving PDEs (65N06) Diffusion (76R50) Canonical and symplectic transformations for problems in Hamiltonian and Lagrangian mechanics (70H15)

This page was built for publication: Symplectic finite-difference methods for solving partial differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233545)