Virginia Tech
    • Log in
    View Item 
    •   VTechWorks Home
    • VTechWorks Archives
    • VTechWorks Administration
    • All Faculty Deposits
    • View Item
    •   VTechWorks Home
    • VTechWorks Archives
    • VTechWorks Administration
    • All Faculty Deposits
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    EPIRK-W and EPIRK-K time discretization methods

    Thumbnail
    View/Open
    Submitted Version (1.726Mb)
    Downloads: 161
    Date
    2017-01-26
    Author
    Narayanamurthi, M.
    Tranquilli, Paul
    Sandu, Adrian
    Tokman, M.
    Metadata
    Show full item record
    Abstract
    Exponential integrators are special time discretization methods where the traditional linear system solves used by implicit schemes are replaced with computing the action of matrix exponential-like functions on a vector. A very general formulation of exponential integrators is offered by the Exponential Propagation Iterative methods of Runge-Kutta type (EPIRK) family of schemes. The use of Jacobian approximations is an important strategy to drastically reduce the overall computational costs of implicit schemes while maintaining the quality of their solutions. This paper extends the EPIRK class to allow the use of inexact Jacobians as arguments of the matrix exponential-like functions. Specifically, we develop two new families of methods: EPIRK-W integrators that can accommodate any approximation of the Jacobian, and EPIRK-K integrators that rely on a specific Krylov-subspace projection of the exact Jacobian. Classical order conditions theories are constructed for these families. A practical EPIRK-W method of order three and an EPIRK-K method of order four are developed. Numerical experiments indicate that the methods proposed herein are computationally favorable when compared to existing exponential integrators.
    URI
    http://hdl.handle.net/10919/75256
    Collections
    • All Faculty Deposits [4506]
    • Scholarly Works, Computational Science Laboratory [131]
    • Scholarly Works, Computer Science [522]

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us
     

     

    VTechWorks

    AboutPoliciesHelp

    Browse

    All of VTechWorksCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Log inRegister

    Statistics

    View Usage Statistics

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us