Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, using characteristic transmission conditions, and it has been observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for ...

We propose an iterative algorithm for high-dimensional sparse grid regression with penalty. The algorithm is of additive Schwarz type and is thus parallel. We show that the convergence of the algorithm is better than additive Schwarz and examples demonstrate that convergence is between that of additive Schwarz and multiplicative Schwarz procedures. Similarly, the method shows improved performan...

We propose a modiied approach to the abstract convergence theory of the additive and multiplicative Schwarz iterative methods associated with a subspace splitting for solving symmetric positive deenit linear problems. In particular, we obtain a satisfactory bound for the convergence rate of the appropriately scaled multiplicative Schwarz method directly in terms of the condition number of the c...

Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, using characteristic transmission conditions, and it has been observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for ...

The classical Schwarz method is a domain decomposition method to solve elliptic partial differential equations in parallel. Convergence is achieved through overlap of the subdomains. We study in this paper a variant of the Schwarz method which converges without overlap for the Helmholtz equation. We show that the key ingredients for such an algorithm are the transmission conditions. We derive o...

The Additive Schwarz Method with Harmonic Extension (ASH) was introduced by Cai and Sarkis (1999) as an efficient variant of the additive Schwarz method that converges faster and requires less communication. We show how ASH, which is defined at the matrix level, can be reformulated as an iteration that bears a close resemblance to the parallel Schwarz method at the continuous level, provided th...