# Algorithmic Verification of Linearizability for Ordinary Differential Equations

@article{Lyakhov2017AlgorithmicVO, title={Algorithmic Verification of Linearizability for Ordinary Differential Equations}, author={Dmitry A. Lyakhov and Vladimir P. Gerdt and Dominik Ludewig Michels}, journal={Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation}, year={2017} }

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… Expand

#### Tables and Topics from this paper

#### 12 Citations

On the algorithmic linearizability of nonlinear ordinary differential equations

- Computer Science, Mathematics
- J. Symb. Comput.
- 2020

Two algorithms to check if a nonlinear differential equation can be reduced to a linear one by a point transformation of the dependent and independent variables and to point transformations are developed. Expand

Algorithms for Mappings and Symmetries of Differential Equations

- Mathematics
- 2019

Differential Equations are used to mathematically express the laws of physics and models in biology, finance, and many other fields. Examining the solutions of related differential equation systems… Expand

Ordinary and partial differential equations

- Mathematics
- 2015

When they exist, 2F1, 1F1 and 0F1 hypergeometric solutions for order linear ODEs are now computable in a rather general case. An equation with 3 regular singularities and any number of apparent… Expand

Symmetry-Based Algorithms for Invertible Mappings of Polynomially Nonlinear PDE to Linear PDE

- Computer Science, Mathematics
- Math. Comput. Sci.
- 2021

This paper extends MapDE to determine if a source nonlinear DPS can be mapped to a linear differential system, and illustrates the powerful maximal symmetry groups facility as a natural tool to be used in conjunction with MapDE. Expand

Extensions of the MapDE algorithm for mappings relating differential equations

- Computer Science, Mathematics
- 2019

This paper extends MapDE to determine if a source nonlinear DPS can be mapped to a linear differential system, and combines aspects of the Bluman-Kumei mapping approach, together with techniques introduced by Lyakhov et al, for the determination of exact linearizations of ODE. Expand

The Lie Algebra of Vector Fields Package with Applications to Mappings of Differential Equations

- Computer Science
- MC
- 2019

The LAVF package introduces a powerful algorithmic calculus for doing calculations with differential equations without the heuristics of integration to calculate efficiently many properties of such systems. Expand

Equivalence classes and linearization of the Riccati and Abel chain

- Mathematics
- 2019

Abstract The problem of linearization by point transformations is solved for equations in the generalized Riccati and Abel chain of order not exceeding the fourth. It is shown in particular that… Expand

Introduction of the MapDE Algorithm for Determination of Mappings Relating Differential Equations

- Computer Science, Mathematics
- ISSAC
- 2019

Algorithm MapDE applies a differential-elimination algorithm to the defining systems for infinitesimal symmetries of R, \hatR, and also to the nonlinear mapping equations, giving them in a form which includes its integrability conditions and for which an existence uniqueness theorem is available. Expand

On the chordality of ordinary differential triangular decomposition in top-down style

- Computer Science, Mathematics
- ISSAC
- 2020

It is proved that when the input differential polynomial set has a chordal differential associatedgraph G and one perfect elimination ordering of G is used, the differential associated graph of any polynometric set in the decomposition process by these two algorithms is a subgraph of G. Expand

Maple in Mathematics Education and Research: Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15–17, 2019, Proceedings

- Computer Science
- MC
- 2020

A new formulation for the conversion matrix for constructing Legendre-Sobolev representation of the coordinate functions from their moment integrals is proposed, which allows one to study the geometrical features of handwritten characters as a whole. Expand

#### References

SHOWING 1-10 OF 46 REFERENCES

Formal Algorithmic Elimination for PDEs

- Computer Science, Mathematics
- ISSAC
- 2016

This tutorial discusses aspects of this correspondence between radical differential ideals and their analytic solution sets in differential algebra involving symbolic computation, and an introduction to the Thomas decomposition method is given. Expand

Linearization of Two Second-Order Ordinary Differential Equations via Fiber Preserving Point Transformations

- Mathematics
- 2011

The necessary form of a linearizable system of two second-order ordinary differential equations 𝑦1=𝑓1(𝑥,𝑦1,𝑦2,𝑦1,𝑦2), 𝑦2=𝑓2(𝑥,𝑦1,𝑦2,𝑦1,𝑦2) is obtained. Some other necessary… Expand

Algebraic linearization criteria for systems of ordinary differential equations

- Mathematics
- 2012

Algebraic linearization criteria by means of general point transformations for systems of two second-order nonlinear ordinary differential equations (ODEs) are revisited. In previous work due to Wafo… Expand

Linearization criteria for a system of two second-order ordinary differential equations

- Mathematics
- 2010

For a system of second-order ordinary differential equations conditions of linearizability to the form x'' = 0 are well known. However, an arbitrary linear system need not be equivalent via an… Expand

Algorithmic Thomas decomposition of algebraic and differential systems

- Computer Science, Mathematics
- J. Symb. Comput.
- 2012

The present paper is a revised version of Bachler et al. (2010) and includes the proofs of correctness and termination of the decomposition algorithm and illustrates the algorithm with further instructive examples and describes its Maple implementation. Expand

Linearization of fourth-order ordinary differential equations by point transformations

- Mathematics
- 2004

The solution of the problem on linearization of fourth-order equations by means of point transformations is presented here. We show that all fourth-order equations that are linearizable by point… Expand

Canonical forms for systems of two second-order ordinary differential equations

- Mathematics
- 2001

We obtain non-similar classes of realizations for real three- and four-dimensional Lie algebras in the space of vector fields in three variables. This is applied to the classification and integration… Expand

Finding abstract Lie symmetry algebras of differential equations without integrating determining equations

- Mathematics
- 1991

There are symbolic programs based on heuristics that sometimes, but not always, explicitly integrate the determining equations for the infinitesimal Lie symmetries admitted by systems of differential… Expand

Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra

- Mathematics, Computer Science
- Algorithms and computation in mathematics
- 2010

The book provides a self-contained account of the formal theory of general, i.e. also under- and overdetermined, systems of differential equations which in its central notion of involution combines… Expand

Symbolic Computation and Differential Equations: Lie Symmetries

- Computer Science, Mathematics
- J. Symb. Comput.
- 2000

The package DESOLV written for the algebraic computing system MAPLE has routines which will systematically obtain with considerably flexibility, all resulting integrability conditions for any system of linear, coupled, partial differential equations. Expand