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.展开更多
The convergence rate of a generalized additive Schwarz algorithm for solving boundary value problems of elliptic partial differential equations is studied. A quantitative analysis of the convergence rate is given for ...The convergence rate of a generalized additive Schwarz algorithm for solving boundary value problems of elliptic partial differential equations is studied. A quantitative analysis of the convergence rate is given for the model Dirichlet problem. It will be shown that a greater acceleration of the algorithm can be obtained by choosing the parameter suitably. Some numerical tests are also presented in this paper.展开更多
文摘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.
基金This work was supported by 973 project granted 2004CB719402 and national nature science foundation granted 10371035. We would like to thank the anonymous referees for their invaluable comments and suggestions, We would like also to thank the State Key Laboratory of Advanced Design and Manufacture for Vehicle Body of Hunan University since the work was done while the authors were working there.
文摘The convergence rate of a generalized additive Schwarz algorithm for solving boundary value problems of elliptic partial differential equations is studied. A quantitative analysis of the convergence rate is given for the model Dirichlet problem. It will be shown that a greater acceleration of the algorithm can be obtained by choosing the parameter suitably. Some numerical tests are also presented in this paper.
