Please use this identifier to cite or link to this item:
|Title:||Block-marching in time with DQ discretization: An efficient method for time-dependent problems|
|Authors:||Shu, C. |
|Citation:||Shu, C., Yao, Q., Yeo, K.S. (2002-09-13). Block-marching in time with DQ discretization: An efficient method for time-dependent problems. Computer Methods in Applied Mechanics and Engineering 191 (41-42) : 4587-4597. ScholarBank@NUS Repository. https://doi.org/10.1016/S0045-7825(02)00387-0|
|Abstract:||In this paper, an efficient method is presented to solve time-dependent problems. The proposed method marches in the time direction block by block. In each block, there are several time levels, and the numerical results at these time levels are obtained simultaneously. The global method of differential quadrature is applied in each block to discretize both the spatial and temporal derivatives. The proposed method is validated by a sample problem, which has an exact solution for easy comparison. It was found that as compared to the conventional 4-stage Runge-Kutta method, the present method could give much higher order of accuracy for numerical results and require much less computational effort. © 2002 Elsevier Science B.V. All rights reserved.|
|Source Title:||Computer Methods in Applied Mechanics and Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 26, 2018
WEB OF SCIENCETM
checked on Apr 3, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.