• Login
    View Item 
    •   Home
    • Research
    • Preprints
    • View Item
    •   Home
    • Research
    • Preprints
    • 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    An Algebraic Approach to Exact Linearization

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    ALGLIN.pdf
    Size:
    555.1Kb
    Format:
    PDF
    Description:
    Preprint
    Download
    Type
    Preprint
    Authors
    Liu, Yang
    Lyakhov, Dmitry cc
    Michels, Dominik L.
    KAUST Department
    Computational Sciences Group
    Visual Computing Center (VCC)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2020
    Permanent link to this record
    http://hdl.handle.net/10754/665992
    
    Metadata
    Show full item record
    Abstract
    An algebraic framework is proposed for determining if a scalar ordinary differential equation could be mapped into a linear one. We call this property linearizability or exact linearization. The problem is split into two parts: (I) obtain a certificate which ensures the existence of a linearizing mapping and (II) construct the determining system for it. The complexity bottleneck of this technique is the completion to a standard basis (Riquier basis of symmetry infinitesimals for problem (I)) and the Thomas Decomposition of the nonlinear determining system of the linearizing mapping for problem (II). In both cases, the numbers of dependent and independent variables remain fixed which defines an upper complexity bound of the corresponding algorithms. The main difference is the transformation of the infinitesimal symmetry generators by means of Bluman-Kumei equations. We prove a theorem on the construction of finite-dimensional linearizing systems, which is important in theory and application. Moreover, we illustrate our approach with several examples which admit exact linearization by point or contact transformations.
    Sponsors
    This work has been funded by KAUST (baseline funding).
    Collections
    Preprints; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    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.