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
Sensitivity Calculus and its Numerical Implementation for Multi-D Hyperbolic Balance Laws
Olivia Dreßen, Michael Herty, Adrian Kolb et al.
A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
Wanjie Lyu, Xiaojie Wang, Bin Yang
Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
Nilo Schwencke, Roland Maier
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Laura Grigori, Zhipeng Xue
A Hybrid High-Order Method for the Elasticity Problem with Linear Slip Interface
Erik Burman, Peiqi Huang
Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
Stefan Schnake, Miroslav Stoyanov, Eirik Endeve et al.