scientific article; zbMATH DE number 4018302
From MaRDI portal
Publication:3030183
[For the entire collection see Zbl 0623.00018.] Schwarz-type iterative methods are considered. The convergence rate of the Schwarz algorithm for a model problem with and without relaxation factors is obtained. We discuss the convergence of the asynchronous parallel Schwarz algorithm S-COR for general problems. Numerical results can be found in the literature.
Recommendations
Cited in
(24)- Convergence and comparison analysis of some numerical Schwarz methods
- Multilevel parallel computations and domain decomposition
- Dimension-wise decompositions and their efficient parallelization
- On the relaxation factors of the parallel iterative domain decomposition method
- scientific article; zbMATH DE number 4141396 (Why is no real title available?)
- Fast Distributed Algorithms for Computing Separable Functions
- scientific article; zbMATH DE number 4052940 (Why is no real title available?)
- scientific article; zbMATH DE number 17442 (Why is no real title available?)
- Strategies of domain decomposition for the design of parallel algorithms
- Parallel asynchronous iterations for the solution of a 3D continuous flow electrophoresis problem
- scientific article; zbMATH DE number 4126638 (Why is no real title available?)
- Multi-agent parallel computational model based on DDM
- scientific article; zbMATH DE number 465375 (Why is no real title available?)
- Parallel schwarz algorithm with under-relaxed pseudo boundary conditions in domain decomposition method
- Parallel implementation of a Schwarz domain decomposition algorithm
- scientific article; zbMATH DE number 218075 (Why is no real title available?)
- scientific article; zbMATH DE number 749480 (Why is no real title available?)
- scientific article; zbMATH DE number 3994973 (Why is no real title available?)
- scientific article; zbMATH DE number 4113908 (Why is no real title available?)
- SYMMETRIC DOMAIN DECOMPOSITION METHOD FOR LARGE SCALE AND NONLINEAR EVOLUTION SYSTEMS
- THE CONVERGENCE OF ASYNCHRONOUS ITERATIONS FOR THE FIXED POINT OF A SPLITTING OPERATOR
- Synchronous and asynchronous optimized Schwarz methods for one‐way subdivision of bounded domains
- A study of domain decomposition and parallel computation
- Overlapping domain decomposition methods based on tensor format for solving high-dimensional partial differential equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030183)