首页 | 本学科首页   官方微博 | 高级检索  
     

基于时间分解求解时间依赖问题的并行算法研究
引用本文:李永刚,欧阳洁,肖曼玉. 基于时间分解求解时间依赖问题的并行算法研究[J]. 数值计算与计算机应用, 2007, 28(1): 27-37
作者姓名:李永刚  欧阳洁  肖曼玉
作者单位:西北工业大学应用数学系,西安,710072
摘    要:基于Lions等建立的Parareal模型,提出了改进的时间分解并行算法,并给出收敛性证明.采用主从模式构造了通用的MPI算法流程,通过分析算法的并行加速比给出了最佳的粗细网格步长之比.在集群系统下分别对热传导方程和对流扩散方程进行并行计算,证明了算法无论对线性还是非线性的问题均具有良好的适应性和扩展性.数值模拟结果表明:时间分解并行算法仅需极少的迭代次数即能取得很高的计算精度,且具有较好的并行加速比和并行效率.

关 键 词:时间分解  实时并行  并行计算
修稿时间:2005-08-31

A TIME DECOMPOSITION PARALLEL ALGORITHM FOR SOLVING TIME-DEPENDENT PROBLEMS
Li Yonggang,Ouyang Jie,Xiao Manyu. A TIME DECOMPOSITION PARALLEL ALGORITHM FOR SOLVING TIME-DEPENDENT PROBLEMS[J]. Journal on Numerical Methods and Computer Applications, 2007, 28(1): 27-37
Authors:Li Yonggang  Ouyang Jie  Xiao Manyu
Abstract:A time decomposition parallel algorithm is developed based on the parareal model proposed by J Lions.The convergence of algorithm is also proved.The general MPI flow process is constructed in Master/Slave mode.Analysis of par- allel speed-up indicates the optimal time-step sizes ratio between the coarse and fine grids.The well adaptability and expansibility of algorithm to both linear and nonlinear cases have been certified by computing the heat conduction and convective-diffusion equations on PC cluster.The numerical simulation results demonstrate that very high accuracy can be acquired by few times of iteration,so that better parallel speed-up is obtained.
Keywords:Time Decomposition  Parareal  Parallel Computation
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号