• Login
    View Item 
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • 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

    Higher-order schemes for the Laplace transformation method for parabolic problems

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Douglas, C.
    Kim, I.
    Lee, H.
    Sheen, D.
    KAUST Grant Number
    KUS-C1-016-04
    Date
    2011-09-03
    Online Publication Date
    2011-09-03
    Print Publication Date
    2011-01
    Permanent link to this record
    http://hdl.handle.net/10754/598497
    
    Metadata
    Show full item record
    Abstract
    In this paper we solve linear parabolic problems using the three stage noble algorithms. First, the time discretization is approximated using the Laplace transformation method, which is both parallel in time (and can be in space, too) and extremely high order convergent. Second, higher-order compact schemes of order four and six are used for the the spatial discretization. Finally, the discretized linear algebraic systems are solved using multigrid to show the actual convergence rate for numerical examples, which are compared to other numerical solution methods. © 2011 Springer-Verlag.
    Citation
    Douglas C, Kim I, Lee H, Sheen D (2011) Higher-order schemes for the Laplace transformation method for parabolic problems. Computing and Visualization in Science 14: 39–47. Available: http://dx.doi.org/10.1007/s00791-011-0156-6.
    Sponsors
    The research by Prof. Douglas is based on work supported in part byNSF grants CNS-1018072 and CNS-1018079 and Award No. KUS-C1-016-04, made by the King Abdullah University of Science and Tech-nology (KAUST). The research by Prof. Sheen was partially supportedby NRF-2008-C00043 and NRF-2009-0080533, 0450-20090014. Theresearch by H. Lee was partially supported by Seoul R & D ProgramWR080951.
    Publisher
    Springer Nature
    Journal
    Computing and Visualization in Science
    DOI
    10.1007/s00791-011-0156-6
    ae974a485f413a2113503eed53cd6c53
    10.1007/s00791-011-0156-6
    Scopus Count
    Collections
    Publications Acknowledging KAUST Support

    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.