首页 / 资料库 / 文献详情

THE CONVERGENCE OF A DOMAIN DECOMPOSITION ALGORITHM FOR PARABOLIC PROBLEMS

储德林、周方俊

1993高等学校计算数学学报：英文版Engineering被引 1

摘要

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.

引用本文（GB/T 7714）