Algorithmic verification of linearizability for ordinary differential equations

DOI10.1145/3087604.3087626MaRDI QIDQ5119952zbMATH OpenOpenAlexFDO

Authors D. A. Lyakhov, Dominik L. Michels, Vladimir 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, http://hdl.handle.net/10754/626089

zbMATH Keywords

ordinary differential equationspoint transformationpower series solutionsdetermining equationsLie symmetry algebradifferential Thomas decompositionalgorithmic linearization test

Mathematics Subject Classification ID

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

Abstract: For a nonlinear ordinary differential equation solved with respect to the highest order derivative and rational in the other derivatives and in the independent variable, we devise two algorithms to check if the equation can be reduced to a linear one by a point transformation of the dependent and independent variables. The first algorithm is based on a construction of the Lie point symmetry algebra and on the computation of its derived algebra. The second algorithm exploits the differential Thomas decomposition and allows not only to test the linearizability, but also to generate a system of nonlinear partial differential equations that determines the point transformation and the coefficients of the linearized equation. Both algorithms have been implemented in Maple and their application is illustrated using several examples.

Recommendations

• On the algorithmic linearizability of nonlinear ordinary differential equations
• On linearization of third-order ordinary differential equations
• On computing linearizing coordinates from the symmetry algebra
• Algebraic linearization criteria for systems of ordinary differential equations
• A systematic method of finding linearizing transformations for nonlinear ordinary differential equations. I: Scalar case

Cited in

(4)

• Symmetry-based algorithms for invertible mappings of polynomially nonlinear PDE to linear PDE
• Verified integration of linear \(n\)th order ODEs using large steps
• Equivalence classes and linearization of the Riccati and Abel chain
• On the algorithmic linearizability of nonlinear ordinary differential equations

Describes a project that uses

Uses Software

• SADE
• DifferentialThomas

This page was built for publication: Algorithmic verification of linearizability for ordinary differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119952)