本文研究了一类求解双障碍问题的松弛型二级多分裂并行算法.运用矩阵多分裂理论,在一定条件下证明了算法的收敛性.数值算例说明算法是有效的和稳健的.
A relaxed two-stage multi-splitting algorithm for bi-obstacle problems is presented. By using the theory of matrix multisphtting,the convergence of the algorithm under some conditions is discussed.Numerical results show that the algorithm is effective and robust.