• 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Fully implicit time stepping can be efficient on parallel computers

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    275-1531-2-PB.pdf
    Size:
    482.9Kb
    Format:
    PDF
    Description:
    Published version
    Download
    Type
    Article
    Authors
    Cloutier, Brandon
    Muite, Benson K.
    Parsani, Matteo cc
    KAUST Department
    Applied Mathematics and Computational Science Program
    Extreme Computing Research Center
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2019-07-18
    Online Publication Date
    2019-07-18
    Print Publication Date
    2019-06
    Permanent link to this record
    http://hdl.handle.net/10754/656811
    
    Metadata
    Show full item record
    Abstract
    Benchmarks in high performance computing often involve a single component used in the full solution of a computational problem, such as the solution of a linear system of equations. In many cases, the choice of algorithm, which can determine the components used, is also important when solving a full problem. Numerical evidence suggests that for the Taylor-Green vortex problem at a Reynolds number of 1600, a second order implicit midpoint rule method can require less computational time than the often used linearly implicit Carpenter-Kennedy method for solving the equations of incompressible fluid dynamics for moderate levels of accuracy at the beginning of the flow evolution. The primary reason is that even though the implicit midpoint rule is fully implicit, it can use a small number of iterations per time step, and thus require less computational work per time step than the Carpenter-Kennedy method. For the same number of timesteps, the Carpenter-Kennedy method is more accurate since it uses a higher order timestepping method.
    Citation
    Fully Implicit Time Stepping Can Be Efficient on Parallel Computers. (2019). Supercomputing Frontiers and Innovations, 6(2). doi:10.14529/jsfi190206
    Sponsors
    We thank the reviewers for their constructive comments, and Koen Hillewaert and David Ketcheson for helpful advice. We thank the participants of the 2013 HiOCFD workshop [12] for feedback on an earlier version of this work that enabled greater examination of the numerical results. BKM thanks Arieh Iserles for pointing out the geometric properties of the implicit midpoint rule and Charles Doering, José Gracia, Hans Johnston, Ning Li, Peter Van Keken, Divakar Viswanath and Jared Whitehead for helpful discussion. BKM was partially supported by HPC Europa 3 (INFRAIA-2016-1-730897).
    Publisher
    South Ural State University, Publishing Center
    Journal
    Supercomputing Frontiers and Innovations
    DOI
    10.14529/jsfi190206
    10.14529/js190206
    Additional Links
    https://superfri.org/superfri/article/view/275
    ae974a485f413a2113503eed53cd6c53
    10.14529/jsfi190206
    Scopus Count
    Collections
    Articles; Applied Mathematics and Computational Science Program; Extreme Computing Research Center; 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.