Algorithmic Verification of Linearizability for Ordinary Differential Equations

DOI10.1145/3087604.3087626zbMath1454.34064arXiv1702.03829OpenAlexW2592179611MaRDI QIDQ5119952

Dmitry A. Lyakhov, Dominik L. Michels, Vladimir P. Gerdt

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.03829

zbMATH Keywords

ordinary differential equationspower series solutionspoint transformationdetermining equationsLie symmetry algebradifferential Thomas decompositionalgorithmic linearization test

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Transformation and reduction of ordinary differential equations and systems, normal forms (34C20) Symmetries, invariants of ordinary differential equations (34C14)

Related Items (3)

Equivalence classes and linearization of the Riccati and Abel chain ⋮ On the algorithmic linearizability of nonlinear ordinary differential equations ⋮ Symmetry-based algorithms for invertible mappings of polynomially nonlinear PDE to linear PDE

Uses Software

• SADE
• DifferentialThomas

This page was built for publication: Algorithmic Verification of Linearizability for Ordinary Differential Equations