On the algorithmic linearizability of nonlinear ordinary differential equations
DOI10.1016/j.jsc.2019.07.004zbMath1454.34063OpenAlexW2961442536WikidataQ127478142 ScholiaQ127478142MaRDI QIDQ2284947
Dominik L. Michels, Vladimir P. Gerdt, Dmitry A. Lyakhov
Publication date: 15 January 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10754/660360
ordinary differential equationspoint transformationLie symmetry algebradifferential Thomas decompositionalgorithmic linearization testTremblay-Turbiner-Winternitz system
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 (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linearization of two second-order ordinary differential equations via fiber preserving point transformations
- Algorithmic Thomas decomposition of algebraic and differential systems
- Algebraic linearization criteria for systems of ordinary differential equations
- Formal algorithmic elimination for PDEs
- Algorithmic calculus for Lie determining systems
- [SADE a Maple package for the symmetry analysis of differential equations]
- Linearization of third-order ordinary differential equations by point and contact transformations
- On decomposition of algebraic PDE systems into simple subsystems
- Involution. The formal theory of differential equations and its applications in computer algebra
- Elimination methods
- Symmetry and integration methods for differential equations
- The differential counting polynomial
- Linearisable third-order ordinary differential equations and generalised sundman transformations: the case \(X=0\)
- Finding higher symmetries of differential equations using the MAPLE package DESOLVII
- Symbolic computation and differential equations: Lie symmetries
- New order bounds in differential elimination algorithms
- Symmetry Lie algebras of \(n\)th order ordinary differential equations
- Canonical forms for systems of two second-order ordinary differential equations
- Are all classical superintegrable systems in two-dimensional space linearizable?
- Linearization criteria for a system of two second-order ordinary differential equations
- Complexity of a standard basis of a $D$-module
- Linearization of fourth-order ordinary differential equations by point transformations
- Algorithms for reducing a system of PDEs to standard form, determining the dimension of its solution space and calculating its Taylor series solution
- Finding abstract Lie symmetry algebras of differential equations without integrating determining equations
- The Differential Dimension Polynomial for Characterizable Differential Ideals
- Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras
- Algorithmic Verification of Linearizability for Ordinary Differential Equations
- The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
This page was built for publication: On the algorithmic linearizability of nonlinear ordinary differential equations
