Algorithmes mixtes asynchrones. Étude de convergence monotone (Q1060540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmes mixtes asynchrones. Étude de convergence monotone |
scientific article; zbMATH DE number 3907667
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmes mixtes asynchrones. Étude de convergence monotone |
scientific article; zbMATH DE number 3907667 |
Statements
Algorithmes mixtes asynchrones. Étude de convergence monotone (English)
0 references
1984
0 references
This paper proposes two classes of ''asynchronous mixed algorithms'' for solving the equations \(0\in M(u)+F(u)\) where F(u) is a mapping and M(u) denotes a multivalued application. There is no proof, and the reader is referred to the doctoral thesis of the author.
0 references
asynchronous mixed algorithms
0 references
convergence
0 references
Newton-relaxation algorithms
0 references
