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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 39-47 |
| Number of pages | 9 |
| Journal | Computing and Visualization in Science |
| Volume | 14 |
| Issue number | 1 |
| DOIs | |
| State | Published - Sep 3 2011 |
| Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01Acknowledged KAUST grant number(s): KUS-C1-016-04
Acknowledgements: 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.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.