On the Algorithmic Recovering of Coefficients in Linearizable Differential Equations

We investigate the problem of recovering coefficients in scalar nonlinear ordinary differential equations that can be exactly linearized. This contribution builds upon prior work by Lyakhov, Gerdt, and Michels, which focused on obtaining a linearizability certificate through point transformations. O...

Full description

Saved in:
Bibliographic Details
Main Authors Lyakhov, Dmitry A, Michels, Dominik L
Format Journal Article
LanguageEnglish
Published 02.04.2024
Subjects
Computer Science - Symbolic Computation
Mathematics - Group Theory
Mathematics - Rings and Algebras
Online AccessGet full text

Cover

More Information
Summary:We investigate the problem of recovering coefficients in scalar nonlinear ordinary differential equations that can be exactly linearized. This contribution builds upon prior work by Lyakhov, Gerdt, and Michels, which focused on obtaining a linearizability certificate through point transformations. Our focus is on quasi-linear equations, specifically those solved for the highest derivative with a rational dependence on the variables involved. Our novel algorithm for coefficient recovery relies on basic operations on Lie algebras, such as computing the derived algebra and the dimension of the symmetry algebra. This algorithmic approach is efficient, although finding the linearization transformation necessitates computing at least one solution of the corresponding Bluman-Kumei equation system.
DOI:10.48550/arxiv.2404.01798