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

Handle URI:
http://hdl.handle.net/10754/598497
Title:
Higher-order schemes for the Laplace transformation method for parabolic problems
Authors:
Douglas, C.; Kim, I.; Lee, H.; Sheen, D.
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.
Publisher:
Springer Nature
Journal:
Computing and Visualization in Science
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
Jan-2011
DOI:
10.1007/s00791-011-0156-6
Type:
Article
ISSN:
1432-9360; 1433-0369
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.
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorDouglas, C.en
dc.contributor.authorKim, I.en
dc.contributor.authorLee, H.en
dc.contributor.authorSheen, D.en
dc.date.accessioned2016-02-25T13:31:02Zen
dc.date.available2016-02-25T13:31:02Zen
dc.date.issued2011-01en
dc.identifier.citationDouglas 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.en
dc.identifier.issn1432-9360en
dc.identifier.issn1433-0369en
dc.identifier.doi10.1007/s00791-011-0156-6en
dc.identifier.urihttp://hdl.handle.net/10754/598497en
dc.description.abstractIn 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.en
dc.description.sponsorshipThe 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.en
dc.publisherSpringer Natureen
dc.subjectHigher-order schemesen
dc.subjectLaplace inversionen
dc.subjectMadpacken
dc.subjectMultigriden
dc.subjectTime+space parallel methoden
dc.titleHigher-order schemes for the Laplace transformation method for parabolic problemsen
dc.typeArticleen
dc.identifier.journalComputing and Visualization in Scienceen
dc.contributor.institutionUniversity of Wyoming, Laramie, United Statesen
dc.contributor.institutionAlcatel-Lucent, Paris, Franceen
dc.contributor.institutionSeoul National University, Seoul, South Koreaen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.