๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Iterative algorithms for semi-linear quasi complementarity problems

โœ Scribed by Muhammad Aslam Noor

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
552 KB
Volume
145
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Modulus-based matrix splitting iteration
Modulus-based matrix splitting iteration methods for linear complementarity problems
โœ Zhong-Zhi Bai ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 133 KB

For the large sparse linear complementarity problems, by reformulating them as implicit fixed-point equations based on splittings of the system matrices, we establish a class of modulus-based matrix splitting iteration methods and prove their convergence when the system matrices are positive-definit

Asynchronous Iterative Algorithms for No
Asynchronous Iterative Algorithms for Nonexpansive Linear Systems
โœ Jacques M. Bahi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

In this paper we give a convergence result for parallel synchronous or asynchronous algorithms with bounded delays, associated with nonexpansive linear systems which are not necessarily contractive. This result allows us to apply these algorithms to consistent singular linear systems and to finite h