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 indepen...
详细信息
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.
Some new characterizations and immediate explicit expressions of best L(1≤p≤∞) approximation and their deviations by an n-dimensional subspace on a set of n+1 points are given.
Some new characterizations and immediate explicit expressions of best L(1≤p≤∞) approximation and their deviations by an n-dimensional subspace on a set of n+1 points are given.
暂无评论