障碍问题的分布式计算

Distributed Computation for Obstacle Problems

讨论障碍问题的分布式计算，它是以区域分裂法为基础的混乱块迭代．证明了这种混乱块迭代的收敛性；利用ＮＯＶＥＬＬ网实现了这种异步并行算法；给出了簿膜障碍及弹塑性杆的自由扭转等算例．

n this paper the distributed computation of obstacle problems is discussed.The block relaxation on the domain splitting is used,The convergence of the block chaotic relaxation is provcd,the asynchronous parallel algorithm is a achieved on a Novell network; numerical examples for the membrane obstacle problems and the free torsion of an elastoplastic cylindrical bar are given.