Coarse-grid preconditioner
Domain decomposition methods - Extended notions
Quizzed article REF: AF1376 V1
Coarse-grid preconditioner
Domain decomposition methods - Extended notions

Authors : Martin J. GANDER, Laurence HALPERN

Publication date: April 10, 2012, Review date: April 26, 2021 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

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.

...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?


Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us