The inverse problem of the Birkhoff-Gustavson normalization and ANFER, Algorithm of Normal Form Expansion and Restoration
Yoshio Uwano
Abstract
In the series of papers [1-4], the inverse problem of the Birkhoff-Gustavson normalization was posed and studied. To solve the inverse problem, the symbolic-computing program named ANFER (Algorithm of Normal Form Expansion and Restoration) is written up, with which a new aspect of the Bertrand and Darboux integrability condition is found Uwano2000. In this paper, the procedure in ANFER is presented in mathematical terminology, which is organized on the basis of the composition of canonical transformations.
Create a lesson
Related papers
Hybrid Newton-BFGS high-index saddle dynamics for accelerating saddle-point searches
Jianyuan Yin, Lei Zhang, Shixue Zhang
Randomly shifted lattice rules for SDEs with constant diffusion: error bounds uniform in time discretization and dimension
Du Ouyang, Josef Dick, Ziyang Ye
Asymptotic-Preserving Tensor Neural Networks for 3D High-Field Kinetic Equations with Applications to Uncertainty Quantification
Shi Jin, Tian-ai Zhang
Energy-conserving scheme for a shallow-water model with capillary effects
Sudarshan Kumar K, Boniface Nkonga, Praveen Chandrashekar
A physics-based adaptive low-rank method for 6D Vlasov simulations
Fabio Cassini, Lukas Einkemmer
To lift or not to lift: Operator inference for nonlinear PDEs with boundary control
Zhuoyuan Wang, Yorie Nakahira, Wael H. Ali et al.