2020 | OriginalPaper | Chapter
On the Scalability of the Parallel Schwarz Method in One-Dimension
Authors : Gabriele Ciaramella, Muhammad Hassan, Benjamin Stamm
Published in: Domain Decomposition Methods in Science and Engineering XXV
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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]).