Bogfjellmo, Geir Curry, Charles and Manchon, Dominique 2017. Hamiltonian B-series and a Lie algebra of non-rooted trees. Numerische Mathematik, Vol. 135, Issue. 1, p. 97.
Hosseini Nasab, M. Hojjati, G. and Abdi, A. 2017. G-symplectic second derivative general linear methods for Hamiltonian problems. Journal of Computational and Applied Mathematics, Vol. 313, p. 486.
Chen, Zhaoxia Zhang, Ruqiang Shi, Wei and You, Xiong 2016. New optimized symmetric and symplectic trigonometrically fitted RKN methods for second-order oscillatory differential equations. International Journal of Computer Mathematics, p. 1.
Mei, Lijie and Wu, Xinyuan 2016. The construction of arbitrary order ERKN methods based on group theory for solving oscillatory Hamiltonian systems with applications. Journal of Computational Physics, Vol. 323, p. 171.
Tao, Molei 2016. Explicit high-order symplectic integrators for charged particles in general electromagnetic fields. Journal of Computational Physics, Vol. 327, p. 245.
Tao, Molei 2016. Explicit symplectic approximation of nonseparable Hamiltonians: Algorithm and long time performance. Physical Review E, Vol. 94, Issue. 4,
Wang, Lijin Hong, Jialin and Sun, Liying 2016. Modified equations for weakly convergent stochastic symplectic schemes via their generating functions. BIT Numerical Mathematics, Vol. 56, Issue. 3, p. 1131.
Wang, Bin Iserles, Arieh and Wu, Xinyuan 2016. Arbitrary-Order Trigonometric Fourier Collocation Methods for Multi-Frequency Oscillatory Systems. Foundations of Computational Mathematics, Vol. 16, Issue. 1, p. 151.
2016. A Concise Introduction to Geometric Numerical Integration.
Butcher, J. C. 2015. The cohesiveness of G-symplectic methods. Numerical Algorithms, Vol. 70, Issue. 3, p. 607.
Butcher, John C. and Imran, Gulshad 2015. Order conditions for G-symplectic methods. BIT Numerical Mathematics, Vol. 55, Issue. 4, p. 927.
Butcher, John C. Habib, Yousaf Hill, Adrian T. and Norton, Terence J. T. 2014. The Control of Parasitism in $G$-symplectic Methods. SIAM Journal on Numerical Analysis, Vol. 52, Issue. 5, p. 2440.
Franco, J.M. and Gómez, I. 2014. Symplectic explicit methods of Runge–Kutta–Nyström type for solving perturbed oscillators. Journal of Computational and Applied Mathematics, Vol. 260, p. 482.
Peinado, Jesús Alonso, Pedro Ibáñez, Javier Hernández, Vicente and Boratto, Murilo 2014. Solving time-invariant differential matrix Riccati equations using GPGPU computing. The Journal of Supercomputing, Vol. 70, Issue. 2, p. 623.
Toxvaerd, Søren 2014. Discrete dynamics versus analytic dynamics. The Journal of Chemical Physics, Vol. 140, Issue. 4, p. 044102.
Wang, Bin and Wu, Xinyuan 2014. A highly accurate explicit symplectic ERKN method for multi-frequency and multidimensional oscillatory Hamiltonian systems. Numerical Algorithms, Vol. 65, Issue. 3, p. 705.
Zhao, Shan and Wei, G. W. 2014. A unified discontinuous Galerkin framework for time integration. Mathematical Methods in the Applied Sciences, Vol. 37, Issue. 7, p. 1042.
Franco, J.M. and Gómez, I. 2013. Construction of explicit symmetric and symplectic methods of Runge–Kutta–Nyström type for solving perturbed oscillators. Applied Mathematics and Computation, Vol. 219, Issue. 9, p. 4637.
Franco, J.M. and Gómez, I. 2013. Some procedures for the construction of high-order exponentially fitted Runge–Kutta–Nyström methods of explicit type. Computer Physics Communications, Vol. 184, Issue. 4, p. 1310.
Liu, Kai Shi, Wei and Wu, Xinyuan 2013. An extended discrete gradient formula for oscillatory Hamiltonian systems. Journal of Physics A: Mathematical and Theoretical, Vol. 46, Issue. 16, p. 165203.
In the sciences, situations where dissipation is not significant may invariably be modelled by Hamiltonian systems of ordinary, or partial, differential equations. Symplectic integrators are numerical methods specifically aimed at advancing in time the solution of Hamiltonian systems. Roughly speaking, ‘symplecticness’ is a characteristic property possessed by the solutions of Hamiltonian problems. A numerical method is called symplectic if, when applied to Hamiltonian problems, it generates numerical solutions which inherit the property of symplecticness.
This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
Full text views reflects the number of PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.
Abstract views reflect the number of visits to the article landing page.
* Views captured on Cambridge Core between September 2016 - 27th May 2017. This data will be updated every 24 hours.