For the solution of non-symmetric or indefinite linear systems arising from discretizations of elliptic problems, two-level additive Schwarz preconditioners are known to be optimal in the sense that convergence bounds for the preconditioned problem are independent of the mesh and the number of subdomains. These bounds are based on some kind of energy norm. However, in practice, iterative method...

During the last two decades many domain decomposition algorithms have been con8 structed and lot of techniques have been developed to prove the convergence of the 9 algorithms at the continuous level. Among the techniques used to prove the conver10 gence of classical Schwarz algorithms, the first technique is the maximum principle 11 used by Schwarz. Adopting this technique M. Gander and H. Zha...

We generalize the method of quantizing effective strings proposed by Polchinski and Strominger to superstrings. The Ramond-Neveu-Schwarz string is different from the Green-Schwarz string in non-critical dimensions. Both are anomaly-free and Poincare invariant. Some implications of the results are discussed. The formal analogy with 4D (super)gravity is pointed out.

This paper proposes an additive Schwarz method for variational inequalities and their approximations by finite element methods. The Schwarz domain decomposition method is proved to converge with a geometric rate depending on the decomposition of the domain. The result is based on an abstract framework of convergence analysis established for general variational inequalities in Hilbert spaces.