1. Coarse-grid preconditioner
To set out the various methods in a simple framework, we have considered decompositions into two sub-domains in the previous sections. In reality, parallel computers have thousands or even hundreds of thousands of processors, and domains need to be decomposed into as many sub-domains as possible to ensure that the resolution process is properly parallelized. But all the iterative methods we've seen lose their efficiency as the number of sub-domains increases. These methods are said to be unscalable. We need to add a new component to all these methods to obtain scalable methods, and this is the subject of this section.
1.1 Scalability problems
There are two types of scalability for an algorithm: strong scalability and weak scalability.
...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Coarse-grid preconditioner
Bibliography
Websites
First papers from the international conference on domain decomposition methods
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference