English
Related papers

Related papers: Explicit non-canonical symplectic algorithms for c…

200 papers

Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…

Numerical Analysis · Mathematics 2024-03-28 P. N. Vabishchevich

A new geometric procedure to construct symplectic methods for constrained mechanical systems is developed in this paper. The definition of a map coming from the notion of retraction maps allows to adapt the continuous problem to the…

Numerical Analysis · Mathematics 2024-12-10 María Barbero Liñán , David Martín de Diego , Rodrigo T. Sato Martín de Almagro

Continuous Galerkin Petrov time discretization scheme is tested on some Hamiltonian systems including simple harmonic oscillator, Kepler's problem with different eccentricities and molecular dynamics problem. In particular, we implement the…

Numerical Analysis · Mathematics 2015-08-19 M. A. Qureshi , S. Hussain , Ghulam Shabbir

We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs (thermal) state. The classical analog of this problem, known as learning graphical models or Boltzmann machines, is a well-studied…

Quantum Physics · Physics 2021-05-26 Anurag Anshu , Srinivasan Arunachalam , Tomotaka Kuwahara , Mehdi Soleimanifar

We present a brief tutorial on the nuts and bolts computation of a multisymplectic particle-in-cell algorithm using the discretized Lagrangian approach. This approach, originated by Marsden, Shadwick, and others, brings the benefits of…

Plasma Physics · Physics 2014-09-18 Stephen D. Webb

We propose a new method to prove the partitioned Runge--Kutta methods with symplectic conditions for determinate and stochastic Hamiltonian systems are symplectic. We utilize Gr\"obner basis technology which is the one of symbolic…

Numerical Analysis · Mathematics 2025-09-16 Xiaojing Zhang

In this paper, we introduces a Pseudo-Symplectic Neural Network (PSNN) for learning general Hamiltonian systems (both separable and non-separable) from data. To address the limitations of existing structure-preserving methods (e.g.,…

Numerical Analysis · Mathematics 2025-03-07 Xupeng Cheng , Lijin Wang , Yanzhao Cao , Chen Chen

An equation containing a fractional power of an elliptic operator of second order is studied for Dirichlet boundary conditions. Finite difference approximations in space are employed. The proposed numerical algorithm is based on solving an…

Numerical Analysis · Computer Science 2015-05-18 Petr N. Vabishchevich

We introduce the Euler-Lagrange cohomology to study the symplectic and multisymplectic structures and their preserving properties in finite and infinite dimensional Lagrangian systems respectively. We also explore their certain difference…

High Energy Physics - Phenomenology · Physics 2016-09-06 H. Y. Guo , Y. Q. Li , K. Wu

We present an approach to construct appropriate and efficient emulators for Hamiltonian flow maps. Intended future applications are long-term tracing of fast charged particles in accelerators and magnetic plasma confinement configurations.…

Computational Physics · Physics 2021-06-02 Katharina Rath , Christopher G. Albert , Bernd Bischl , Udo von Toussaint

This paper investigates the problem of data-driven modeling of port-Hamiltonian systems while preserving their intrinsic Hamiltonian structure and stability properties. We propose a novel neural-network-based port-Hamiltonian modeling…

Systems and Control · Electrical Eng. & Systems 2026-04-16 Binh Nguyen , Nam T. Nguyen , Truong X. Nghiem

This article presents a new numerical scheme for the discretization of dissipative particle dynamics with conserved energy. The key idea is to reduce elementary pairwise stochastic dynamics (either fluctuation/dissipation or thermal…

Statistical Mechanics · Physics 2017-04-26 Gabriel Stoltz

Symplectic N-body integrators are widely used to study problems in celestial mechanics. The most popular algorithms are of 2nd and 4th order, requiring 2 and 6 substeps per timestep, respectively. The number of substeps increases rapidly…

Astrophysics · Physics 2009-10-31 J. E. Chambers , M. A. Murison

Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…

Statistical Mechanics · Physics 2026-02-10 Feng He , Arthur Hutsalyuk , Giuseppe Mussardo , Andrea Stampiggi

Many experimental techniques aim at determining the Hamiltonian of a given system. The Hamiltonian describes the system's evolution in the absence of dissipation, and is often central to control or interpret an experiment. Here, we…

Mesoscale and Nanoscale Physics · Physics 2025-01-08 Vincent Dumont , Markus Bestler , Letizia Catalini , Gabriel Margiani , Oded Zilberberg , Alexander Eichler

Unsupervised machine learning methods are used to identify structural changes using the melting point transition in classical molecular dynamics simulations as an example application of the approach. Dimensionality reduction and clustering…

Computational Physics · Physics 2018-12-06 Nicholas Walker , Ka-Ming Tam , Brian Novak , M. Jarrell

The discrete non-commutative Darboux system of equations with self-consistent sources is constructed, utilizing both the vectorial fundamental (binary Darboux) transformation and the method of additional independent variables. Then the…

Exactly Solvable and Integrable Systems · Physics 2021-02-09 Adam Doliwa , Runliang Lin , Zhe Wang

Hamilton's equations of motion form a fundamental framework in various branches of physics, including astronomy, quantum mechanics, particle physics, and climate science. Classical numerical solvers are typically employed to compute the…

Machine Learning · Computer Science 2024-10-25 Priscilla Canizares , Davide Murari , Carola-Bibiane Schönlieb , Ferdia Sherry , Zakhar Shumaylov

We analyze the asymptotic behavior of discrete-time, Markovian quantum systems with respect to a subspace of interest. Global asymptotic stability of subspaces is relevant to quantum information processing, in particular for initializing…

Quantum Physics · Physics 2014-08-07 Saverio Bolognani , Francesco Ticozzi

The reduction of Hamiltonian systems aims to build smaller reduced models, valid over a certain range of time and parameters, in order to reduce computing time. By maintaining the Hamiltonian structure in the reduced model, certain…

Numerical Analysis · Mathematics 2024-09-17 Raphaël Côte , Emmanuel Franck , Laurent Navoret , Guillaume Steimer , Vincent Vigon