An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases

DOI10.1016/j.jcp.2023.112601MaRDI QIDQ6117702

No author found.

Publication date: 21 February 2024

Published in: Journal of Computational Physics (Search for Journal in Brave)

permutations optimization Gröbner bases resultants molecular dynamics Hamilton equations symplectic difference schemes

Algorithms in computer science (68Wxx) Numerical methods for ordinary differential equations (65Lxx) Computational aspects and applications of commutative rings (13Pxx)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Classification of explicit three-stage symplectic difference schemes for the numerical solution of natural Hamiltonian systems: a comparative study of the accuracy of high-order schemes on molecular dynamics problems
Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
Symplectic analytically integrable decomposition algorithms: classification, derivation, and application to molecular dynamics, quantum and celestial mechanics simulations
Fourth-order symplectic integration
Simplification of nested real radicals revisited
Optimal four-stage symplectic integrators for molecular dynamics problems
Minimal canonical comprehensive Gröbner systems
The Liouville theorem and accurate plasma simulation
Symplectic integrators for long-term integrations in celestial mechanics
Comprehensive Gröbner bases
Multigraded resultants of Sylvester type
Efficient computation of zero-dimensional Gröbner bases by change of ordering
Canonical Runge-Kutta-Nyström methods of orders five and six
A new algorithm for discussing Gröbner bases with parameters.
Practical symplectic partitioned Runge-Kutta and Runge-Kutta-Nyström methods
Optimized Forest-Ruth- and Suzuki-like algorithms for integration of motion in many-body systems
Comparative study of the accuracy of higher-order difference schemes for molecular dynamics problems using the computer algebra means
Higher-order symplectic integration techniques for molecular dynamics problems
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
Improving the DISPGB algorithm using the discriminant ideal
The evaluation of the zeros of ill-conditioned polynomials. I, II
A Concise Introduction to Geometric Numerical Integration
An Introduction to Automated Discovery in Geometry through Symbolic Computation
Comprehensive Involutive Systems
Particle Dynamics Methods of Blood Flow Simulations
The Development of Variable-Step Symplectic Integrators, with Application to the Two-Body Problem
Solving Ordinary Differential Equations I
Splitting methods
Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
Symplectic Geometric Algorithms for Hamiltonian Systems
The accuracy of symplectic integrators
Dixon-EDF: The Premier Method for Solution of Parametric Polynomial Systems
A package for solving parametric polynomial systems
Ideals, Varieties, and Algorithms
Geometric Numerical Integration
A Simplex Method for Function Minimization

This page was built for publication: An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases