Parallelization methods for space-time problems
Domain decomposition methods - Extended notions

Add to my library

AF1376 V1 Quizzed article

Parallelization methods for space-time problems
Domain decomposition methods - Extended notions

Authors : Martin J. GANDER, Laurence HALPERN

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

Add to my library Add to my library

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

Already subscribed?

2. Parallelization methods for space-time problems

Let's now return to a time-evolution problem, of the heat, wave or even Schrödinger type. To calculate an approximate solution in space and time, we prefer to choose a scheme that is implicit in time in the first and third cases, and explicit in the second. A uniform time discretization over the domain will then produce a natural parallelization in the explicit case, without the need to iterate between processors. For an implicit scheme, on the other hand, we have to solve an elliptic equation at each time step (see the beginning of section 1.4 of [AF 1 375] ). This can...

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
Parallelization methods for space-time problems

Article included in this offer

"Mathematics"

( 168 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