• Login
    View Item 
    •   Home
    • Research
    • Technical Reports
    • View Item
    •   Home
    • Research
    • Technical Reports
    • 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

    Propagation of internal errors in explicit Runge–Kutta methods and internal stability of SSP and extrapolation methods

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1309.1317v3.pdf
    Size:
    987.4Kb
    Format:
    PDF
    Description:
    Technical Report - Full Text
    Download
    Type
    Technical Report
    Authors
    Ketcheson, David I. cc
    Loczi, Lajos cc
    Parsani, Matteo cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Numerical Mathematics Group
    Date
    2014-04-11
    Permanent link to this record
    http://hdl.handle.net/10754/333680
    
    Metadata
    Show full item record
    Abstract
    In practical computation with Runge--Kutta methods, the stage equations are not satisfied exactly, due to roundoff errors, algebraic solver errors, and so forth. We show by example that propagation of such errors within a single step can have catastrophic effects for otherwise practical and well-known methods. We perform a general analysis of internal error propagation, emphasizing that it depends significantly on how the method is implemented. We show that for a fixed method, essentially any set of internal stability polynomials can be obtained by modifying the implementation details. We provide bounds on the internal error amplification constants for some classes of methods with many stages, including strong stability preserving methods and extrapolation methods. These results are used to prove error bounds in the presence of roundoff or other internal errors.
    Sponsors
    This publication is based on work supported by Award No. FIC/2010/05 2000000231, made by KAUST.
    Additional Links
    http://arxiv.org/abs/1309.1317
    Collections
    Numerical Mathematics Group; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Technical Reports

    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.