Additive Schwarz algorithms for solving the discrete problems of twrvside obstacle problems are proposed. The monotone convergence of the algorithms is established for M-matrix and the h-independent convergence rate i...Additive Schwarz algorithms for solving the discrete problems of twrvside obstacle problems are proposed. The monotone convergence of the algorithms is established for M-matrix and the h-independent convergence rate is proved for S-matrix. The so-called finite step convergence for coincident components is discussed for nondegenerate discreted problems.展开更多
文摘Additive Schwarz algorithms for solving the discrete problems of twrvside obstacle problems are proposed. The monotone convergence of the algorithms is established for M-matrix and the h-independent convergence rate is proved for S-matrix. The so-called finite step convergence for coincident components is discussed for nondegenerate discreted problems.
