The Spin-MInt algorithm is proven symplectic for general K electronic states via explicit verification of the condition MJM^T = J on the coadjoint orbit of the su(K) Lie-Poisson algebra.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
An optimization-driven parametric curve method using Fourier-Chebyshev basis simulates realistic limbless locomotion with energy constraints for physical plausibility.
citing papers explorer
-
On the Symplectic Propagation of the Spin-MInt Algorithm for Non-Adiabatic Quantum Dynamics
The Spin-MInt algorithm is proven symplectic for general K electronic states via explicit verification of the condition MJM^T = J on the coadjoint orbit of the su(K) Lie-Poisson algebra.
-
Geometric Shape Optimization for Limbless Locomotion
An optimization-driven parametric curve method using Fourier-Chebyshev basis simulates realistic limbless locomotion with energy constraints for physical plausibility.