In this paper, we develop a two-level additive Schwarz preconditioner for Morley element using nonnested meshes. We define an intergrid transfer operator that satisfies certain stable approximation properties by using...
详细信息
In this paper, we develop a two-level additive Schwarz preconditioner for Morley element using nonnested meshes. We define an intergrid transfer operator that satisfies certain stable approximation properties by using a conforming interpolation operator and construct a uniformly bounded decomposition for the finite element space. Both coarse and fine grid spaces are nonconforming. We get optimal convergence properties of the additive Schwarz algorithm that is constructed on nonnested meshes and with a not necessarily shape regular subdomain partitioning. Our analysis is based on the theory of Dryja and *** is interesting to mention that when coarse and fine spaces are all nonconforming, a natural intergrid operator seems to be one defined by taking averages of the nodal parameters. In this way, we obtain the stable factor (H/h)3/2, and show that this factor can not be improved. However, to get an optimal preconditioner,we need in general the stability with a factor C independent of mesh ***. the latter can not be used in this case.
This paper is devoted to study of an iterative procedure for domain decomposition method of second order elliptic problem with mixed boundary conditions (i.e., Dirichlet condition on a part of boundary and Neumann con...
详细信息
This paper is devoted to study of an iterative procedure for domain decomposition method of second order elliptic problem with mixed boundary conditions (i.e., Dirichlet condition on a part of boundary and Neumann condition on the another part of boundary). For the pure Dirichlet problem, Marini and Quarteroni [3], [4] considered a similar approach, which is extended to more complex problem in this paper.
A generalization of the multistart algorithm is proposed for finding the globalminimizer of a nonlinear function of n variables. Our method concentrates a quasirandomsample by performing a few inexpensive local search...
详细信息
A generalization of the multistart algorithm is proposed for finding the globalminimizer of a nonlinear function of n variables. Our method concentrates a quasirandomsample by performing a few inexpensive local searches. The sample is thed reduced byreplacing worse points by flew quasirandom points. A complete local search is performedonly on those points with small function values. This method performs favorably incomparison to other global optimization methods.
暂无评论