• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    On the algorithmic linearizability of nonlinear ordinary differential equations

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    ISSAC2017-Final-Lyakhov.pdf
    Size:
    309.0Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Lyakhov, Dmitry cc
    Gerdt, Vladimir P.
    Michels, Dominik L.
    KAUST Department
    Visual Computing Center (VCC)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2019-07-15
    Online Publication Date
    2019-07-15
    Print Publication Date
    2020-05
    Embargo End Date
    2021-07-15
    Permanent link to this record
    http://hdl.handle.net/10754/660360
    
    Metadata
    Show full item record
    Abstract
    Solving nonlinear ordinary differential equations is one of the fundamental and practically important research challenges in mathematics. However, the problem of their algorithmic linearizability so far remained unsolved. In this contribution, we propose a solution of this problem for a wide class of nonlinear ordinary differential equation of arbitrary order. We develop 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. In this regard, we have restricted ourselves to quasi-linear equations with a rational dependence on the occurring variables and to point transformations. While 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 our algorithms is discussed and evaluated using several examples.
    Citation
    Lyakhov, D. A., Gerdt, V. P., & Michels, D. L. (2020). On the algorithmic linearizability of nonlinear ordinary differential equations. Journal of Symbolic Computation, 98, 3–22. doi:10.1016/j.jsc.2019.07.004
    Sponsors
    The authors are grateful to Daniel Robertz and Greg Reid for helpful discussions and suggestions. This work has been partially supported by KAUST Baseline Funding (D. A. Lyakhov and D. L. Michels), by the RUDN University Program (5-100; V. P. Gerdt), and by Stanford University (D. L. Michels).
    Publisher
    Elsevier BV
    Journal
    Journal of Symbolic Computation
    DOI
    10.1016/j.jsc.2019.07.004
    Additional Links
    https://linkinghub.elsevier.com/retrieve/pii/S0747717119300689
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.jsc.2019.07.004
    Scopus Count
    Collections
    Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.