Non-stationary parallel multisplitting algorithms for almost linear systems
✍ Scribed by Josep Arnal; Violeta Migallón; José Penadés
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 100 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1070-5325
No coin nor oath required. For personal study only.
✦ Synopsis
Non-stationary parallel multisplitting iterative methods are introduced for the solution of almost linear systems. A non-stationary parallel algorithm based on the AOR-type methods and its extension to asynchronous models are considered. Convergence properties of the synchronous and asynchronous versions of these methods are studied for M-matrices and H -matrices. Furthermore, computational results about these methods on a distributed memory multiprocessor, which illustrate the performance of the algorithms studied, are discussed.
📜 SIMILAR VOLUMES
This paper analyzes the performance of two parallel algorithms for solving the linear-quadratic optimal control problem arising in discrete-time periodic linear systems. The algorithms perform a sequence of orthogonal reordering transformations on formal matrix products associated with the periodic
In this note the recent algorithm of Hassan and Singh is modified to provide a more powerful approach to the hierarchical optimisation of non-linear systems with quadratic performance indices. The new approach does not use the quadratic penalty terms in the cost function. This allows convergence ove