Article | REF: AF1386 V1

Parallel Asynchronous Algorithms II. Implementation

Authors: Pierre SPITERI, Jean-Claude MIELLOU

Publication date: October 10, 2021

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

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.

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

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

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

Subscribe now!

Ongoing reading
Mathematical framework