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

THE CONVERGENCE OF A DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS
作者姓名:储德林  周方俊
作者单位:Department of Applied Mathematics,Tsinghua University,Beijing,100084,PRC.,Department of Applied Mathematics,Tsinghua University,Beijing,100084,PRC.
摘    要:At recent, Hourgat et gave a domain decomposition algorithm for elliptic problems which can be implemented in parallel. Many numerical experiments have illustrated its efficiency. In the present paper, we apply this algorithm to solve the discrete parabolic problems, analyse its convergence and show that its convergence rale is about (1 - 2p + σp2 ) which is nearly optimal and independent of the parameter τ, where σ τ O((1 +H )(1 + ln(H / h))2 ). 0 < p < 1 / σ,τ,h,H are the time step size, finite element parameter and subdomain diameter, respectively.


THE CONVERGENCE OF A DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS
Chu Dc-lin.THE CONVERGENCE OF A DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS[J].Numerical Mathematics A Journal of Chinese Universities English Series,1993(2).
Authors:Chu Dc-lin
Institution:Chu Dc-lin Department of Applied Mathematics,Tsinghua University,Beijing,100084,PRC. Zhou Fang-jun Department of Applied Mathematics,Tsinghua University,Beijing,100084,PRC.
Abstract:
Keywords:Domain decomposition  trace average operator  convergence  parabolic problem  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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