期刊文献+

TIME-EXTRAPOLATION ALGORITHM (TEA) FOR LINEAR PARABOLIC PROBLEMS 被引量:2

TIME-EXTRAPOLATION ALGORITHM (TEA) FOR LINEAR PARABOLIC PROBLEMS
原文传递
导出
摘要 The fast solutions of Crank-Nicolson scheme on quasi-uniform mesh for parabolic prob- lems are discussed. First, to decrease regularity requirements of solutions, some new error estimates are proved. Second, we analyze the two characteristics of parabolic discrete scheme, and find that the efficiency of Multigrid Method (MG) is greatly reduced. Nu- merical experiments compare the efficiency of Direct Conjugate Gradient Method (DCG) and Extrapolation Cascadic Multigrid Method (EXCMG). Last, we propose a Time- Extrapolation Algorithm (TEA), which takes a linear combination of previous several level solutions as good initial values to accelerate the rate of convergence. Some typical extrapolation formulas are compared numerically. And we find that under certain accuracy requirement, the CG iteration count for the 3-order and 7-level extrapolation formula is about 1/3 of that of DCG's. Since the TEA algorithm is independent of the space dimension, it is still valid for quasi-uniform meshes. As only the finest grid is needed, the proposed method is regarded very effective for nonlinear parabolic problems. The fast solutions of Crank-Nicolson scheme on quasi-uniform mesh for parabolic prob- lems are discussed. First, to decrease regularity requirements of solutions, some new error estimates are proved. Second, we analyze the two characteristics of parabolic discrete scheme, and find that the efficiency of Multigrid Method (MG) is greatly reduced. Nu- merical experiments compare the efficiency of Direct Conjugate Gradient Method (DCG) and Extrapolation Cascadic Multigrid Method (EXCMG). Last, we propose a Time- Extrapolation Algorithm (TEA), which takes a linear combination of previous several level solutions as good initial values to accelerate the rate of convergence. Some typical extrapolation formulas are compared numerically. And we find that under certain accuracy requirement, the CG iteration count for the 3-order and 7-level extrapolation formula is about 1/3 of that of DCG's. Since the TEA algorithm is independent of the space dimension, it is still valid for quasi-uniform meshes. As only the finest grid is needed, the proposed method is regarded very effective for nonlinear parabolic problems.
出处 《Journal of Computational Mathematics》 SCIE CSCD 2014年第2期183-194,共12页 计算数学(英文)
基金 This work was supported by the National Natural Science Foundation of China (No. 11071067, 41204082, 11301176), the Research Fund for the Doctoral Program of Higher Education of China (No. 20120162120036), the Hunan Provincial Natural Science Foundation of China (No. 14JJ3070) and the Construct Program of the Key Discipline in Hunan Province.
关键词 Parabolic problem Crank-Nicolson scheme Error estimates Time-extrapolationalgorithm CG-iteration. Parabolic problem, Crank-Nicolson scheme, Error estimates, Time-extrapolationalgorithm, CG-iteration.
  • 相关文献

参考文献8

二级参考文献42

共引文献62

同被引文献3

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部