Domain decomposition methods
Numerical algorithms for solving large systems
Article REF: AF502 V1
Domain decomposition methods
Numerical algorithms for solving large systems

Author : Pierre SPITERI

Publication date: October 10, 2002 | 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?

6. Domain decomposition methods

We have already seen that discretization of partial differential equations leads to the resolution of high-dimensional algebraic systems; the algorithms presented above are, in general and for most applications, the most efficient on traditional computers. Today, we are witnessing an evolution in machine architecture, and over the last twenty years or so, multiprocessors have appeared on the market, machines equipped with several processors designed to work in parallel on the same application. Naturally, algorithms for the numerical resolution of partial differential equations need to be adapted to this type of supercomputer. There are several possible solutions. Either we adapt the above algorithms by running all the independent phases of the program in parallel, in order to take maximum advantage of the machine's architecture; this aspect is more a matter of computer science techniques,...

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?


Ongoing reading
Domain decomposition methods

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