摘要
Considering multiplicative Schwarz algorithm for solving algebraic obstacle problems, we show the geometric convergence of the algorithm by the use of discrete maximum principle. We also get a decay rate bound independent of the meshsize for the iterative error and illustrate the method by some numerical experiments.
Considering multiplicative Schwarz algorithm for solving algebraic obstacle problems, we show the geometric convergence of the algorithm by the use of discrete maximum principle. We also get a decay rate bound independent of the meshsize for the iterative error and illustrate the method by some numerical experiments.
基金
This research is supported by the National Natural Science Foundation of China and LSEC.
