Mathematical framework
Parallel Asynchronous Algorithms II. Implementation
Article REF: AF1386 V1
Mathematical framework
Parallel Asynchronous Algorithms II. Implementation

Authors : Pierre SPITERI, Jean-Claude MIELLOU

Publication date: October 10, 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. Mathematical framework

The aim of this section is to recall properties that will be useful for the implementation of asynchronous parallel algorithms, and in particular the implementation of efficient iteration stopping tests. As mentioned above, we will consider contraction techniques, monotonic convergence techniques and finally techniques using nested sets.

1.1 Analysis using contraction techniques

Since the operator V →Φ(V) perturbed by the affine application (AU – G) and associated with the problem (1) (respectively V →∂Ψ(V) associated with the problem

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