toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS
Authors:
Deren Wang a;
Zhongzhi Bai a;
D. J. Evans b
| Affiliations: | a Shanghai University of Science and Technology, Shanghai 201800, P.R. China |
| b Parallel Algorithms Research Centre, Loughborough University of Technology, Loughborough, Leicestershire, UK LE11 3TU |
DOI:
10.1080/10637199408915415
Publication Frequency:
6 issues per year
Published in:
International Journal of Parallel, Emergent and Distributed Systems,
Volume
2,
Issue
3
1994
, pages 173
- 192
International Journal of Parallel, Emergent and Distributed Systems,
Volume
2,
Issue
3
1994
, pages 173
- 192
Subjects:
Algorithms & Complexity;
Computer Engineering;
Computer Science (General);
Distributed Network Systems;
Distributed Systems;
Internet & Multimedia;
Neural Networks;
Parallel Algorithms;
Parallel Systems;
Programming & Programming Languages;
Quantum Information;
Systems & Computer Architecture;
Formats available:
PDF
(English)
Previously published as:
Parallel Algorithms and Applications
(1063-7192)
until 2005
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
In this paper, a class of asynchronous parallel matrix multisplitting relaxation methods suitable to the MIMD-systems are constructed. The convergence and the convergence rate of it are discussed in a detailed manner under the condition that the coefficient matrix A is a monotone matrix. Moreover, when the matrix A is an L-matrix, we give sufficient and necessary conditions ensuring the convergence of the methods, too.
|
| Keywords: System of linear equations; asynchronous parallel; matrix multisplitting; relaxation; convergence; divergence |
| C. R. CATEGORIES: 65F10; G.1.3 |
| view references (10) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
