On the Scalability of the Parallel Schwarz Method in One-Dimension

An algorithm is said to beweakly scalable if it can solve progressively larger problems with an increasing number of processors in a fixed amount of time. According to classical Schwarz theory, the parallel Schwarz method (PSM) is not scalable (see, e.g., [2, 7]).