skip to main content
10.1145/3087604.3087626acmotherconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
research-article

Algorithmic Verification of Linearizability for Ordinary Differential Equations

Authors Info & Claims
Published:23 July 2017Publication History

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. The implementation of both algorithms is discussed and their application is illustrated using several examples.

References

  1. Vladimir Arnold. Ordinary Differential Equations. Springer, Berlin, 1992.Google ScholarGoogle Scholar
  2. Muhammad Ayub, Masood Khan, and Fazal Mahomed. Algebraic linearization criteria for systems of ordinary differential equations. Nonlinear Dynamics 67, no. 3 (2012): 2053--2062.Google ScholarGoogle ScholarCross RefCross Ref
  3. Thomas Bachler, Vladimir Gerdt, Markus Lange-Hegermann, and Daniel Robertz. Algorithmic Thomas decomposition of algebraic and differential systems. Journal of Symbolic Computation 47, no. 10 (2012): 1233--1266. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Julia Bagderina. Linearization Criteria for a System of Two Second-Order Ordinary Differential Equations. Journal of Physics A: Mathematical and Theoretical 43, no. 46 (2010): 465201.Google ScholarGoogle ScholarCross RefCross Ref
  5. George Bluman and Stephen Anco. Symmetry and Integration Methods for Differential Equations. Springer, New York, 2001.Google ScholarGoogle Scholar
  6. John Carminati and Khai Vu. Symbolic Computation and Differential Equations:Lie Symmetries. Journal of Symbolic Computation 29, no. 1 (2000): 95--116. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Manuel Ceballos, Juan Núnez, and Angel Tenorio. Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras. International Journal of Computer Mathematics 89, no. 10 (2012): 1388--1411. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Norbert Euler, Thomas Wolf, Peter Leach, and Marianna Euler. Linearizable Third-Order Ordinary DifferentialEquations and The Generalised Sundman Transformations: The Case X prime prime prime=0. Acta Applicandae Mathematicae 76, no. 1 (2003): 89--115.Google ScholarGoogle ScholarCross RefCross Ref
  9. Tarcisio Filho and Annibal Figueiredo. {SADE} a Maple package for the symmetryanalysis of differential equations. Computer Physics Communications 182, no. 2 (2011): 467--476.Google ScholarGoogle ScholarCross RefCross Ref
  10. Vladimir Gerdt. On decomposition of algebraic PDE systems into simple subsystems. Acta Applicandae Mathematicae 101, no. 1 (2008): 39--51.Google ScholarGoogle ScholarCross RefCross Ref
  11. Evelyne Hubert. Notes on triangular sets and triangulation-decomposition algorithms. II Differential systems. In: Franz Winkler, and Ulrich Langer (Editors), Symbolic and Numerical Scientific Computation, Hagenberg, 2001, Lecture Notes in Computer Science, Vol. 2630, Springer, Berlin, 2003, pp. 40--87. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Nail Ibragimov and Sergey Meleshko. Linearization of third-order ordinary differential equations by point and contact transformations. Journal of Mathematical Analysis and Applications 308, no. 1 (2005): 266--289.Google ScholarGoogle ScholarCross RefCross Ref
  13. Nail Ibragimov, Sergey Meleshko, and Supaporn Suksern. Linearization of fourth-order ordinary differential equations by point transformations. Journal of Physics A: Mathematical and Theoretical 41, no. 23 (2008): 235206.Google ScholarGoogle ScholarCross RefCross Ref
  14. Nail Ibragimov. A Practical Course in Differential Equations and Mathematical Modelling. Classical and New Methods. Nonlinear Mathematical Models. Symmetry and In variance Principles. Higher Education Press, World Scientific, New Jersey, 2009.Google ScholarGoogle Scholar
  15. Markus Lange-Hegermann. The Differential Dimension Polynomial for Characterizable Differential Ideals. arXiv:math-AC/1401.5959.Google ScholarGoogle Scholar
  16. Markus Lange-Hegermann. Differential Thomas: Thomas decomposition of differential systems. http://wwwb.math.rwth-aachen.de/thomasdecomposition/.Google ScholarGoogle Scholar
  17. Ziming Li and Dongming Wang. Coherent, Regular and Simple Systems in Zero Decompositions of Partial Differential Systems. Systems Science and Mathematical Sciences 12, no. 5 (1999): 43--60.Google ScholarGoogle Scholar
  18. Sophus Lie. Klassifikation und Integration von gewöhnlichen Differential gleichungenzwischen x, y, die eine Gruppe von Transformationen gestatten. III. Archivfor Matematik og Naturvidenskab, 8(4), 1883, 371--458. Reprinted in Lie's Gesammelte Abhandlungen, 5, paper XIY, 1924, 362--427.Google ScholarGoogle Scholar
  19. Sophus Lie. Vorlesungen über kontinuierliche Gruppen mit geometrischen und anderen Anwendungen. Bearbeitet und herausgegeben von Dr. G. Schefferes. Teubner, Leipzig, 1883.Google ScholarGoogle Scholar
  20. Fazal Mahomed and Peter Leach. Symmetry Lie Algebra of nth Order Ordinary Differential Equations. Journal of Mathematical Analysis and Applications 151, no. 1 (1990): 80--107.Google ScholarGoogle ScholarCross RefCross Ref
  21. Peter Olver. Applications of Lie Groups to Differential Equations, 2nd Edition.Graduate Texts in Mathematics, Vol. 107, Springer, New York, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  22. Peter Olver. Equivalence, Invariance and Symmetry. Cambridge University Press, 1995.Google ScholarGoogle Scholar
  23. Lev Ovsyannikov. Group Analysis of Differential Equations. Academic Press, New York, 1992.Google ScholarGoogle Scholar
  24. Greg Reid. Algorithms for reducing a system of PDEs to standard form, determining the dimension of its solution space and calculating its Taylor series solution. European Journal of Applied Mathematics 2, no. 4 (1991): 293--318.Google ScholarGoogle ScholarCross RefCross Ref
  25. Greg Reid. Finding abstract Lie symmetry algebras of differential equations without integrating determining equations. European Journal of Applied Mathematics 2, no. 04 (1991): 319--340.Google ScholarGoogle ScholarCross RefCross Ref
  26. Daniel Robertz. Formal Algorithmic Elimination for PDEs. Lecture Notes in Mathematics, Vol. 2121, Springer, 2014.Google ScholarGoogle Scholar
  27. Oritz Schwarz. Algorithmic Lie Theory for solving ordinary Differential Equations.Chapman & HallCRS, Boca Raton, 2008.Google ScholarGoogle Scholar
  28. Werner Seiler. Involution: The Formal Theory of Differential Equations and its Applications in Computer Algebra. Algorithms and Computation in Mathematics 24. Springer, Heidelberg, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Celestin Soh and Fazal Mahomed. Canonical forms for systems of two second-order ordinary differential equations. Journal of Physics A: Mathematical and General 34 (2001): 2883--2991.Google ScholarGoogle ScholarCross RefCross Ref
  30. Sakka Sookmee and Sergey Meleshko. Linearization of Two Second-Order Ordinary Differential Equations via Fiber Preserving Point Transformations. ISRN Mathematical Analysis, Article ID: 452689, 2011.Google ScholarGoogle Scholar
  31. Joseph Thomas. Differential Systems. AMS Colloquium Publications, Vol. XXI, AMS,New York, 1937.Google ScholarGoogle Scholar
  32. Joseph Thomas. Systems and Roots. William Byrd Press, Richmond, 1962.Google ScholarGoogle Scholar
  33. Khai Vu, Grace Jefersson, and John Carminati. Finding higher symmetries of differential equations using the MAPLE package DESOLVII. Computer Physics Communications 183, no. 4 (2012): 1044--1054.Google ScholarGoogle ScholarCross RefCross Ref
  34. Dongming Wang. Elimination Methods. Springer, Wien, 2001.Google ScholarGoogle Scholar

Index Terms

  1. Algorithmic Verification of Linearizability for Ordinary Differential Equations

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          ISSAC '17: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation
          July 2017
          466 pages
          ISBN:9781450350648
          DOI:10.1145/3087604

          Copyright © 2017 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 July 2017

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate395of838submissions,47%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader