Hostname: page-component-7479d7b7d-c9gpj Total loading time: 0 Render date: 2024-07-12T16:14:31.364Z Has data issue: false hasContentIssue false

Convergence of relaxed chaotic parallel iterative methods

Published online by Cambridge University Press:  17 April 2009

Peter E. Kloeden
Affiliation:
School of Computing and Mathematics Deakin UniversityGeelong Vic 3217, Australia
Dong-Jin Yuan
Affiliation:
Yangzhou Teachers' CollegeYangzhouPeoples Republic of China
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Sufficient conditions involving uniform multisplittings are established for the convergence of relaxed and AOR versions of asynchronous or chaotic parallel iterative methods for solving a large scale nonsingular system of linear equations Ax = b.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1994

References

[1]Bru, R., Elsner, L. and Neumann, M., ‘Models of parallel chaotic iterative methods’, Linear Algebra Appl. 103 (1988), 175192.CrossRefGoogle Scholar
[2]Chazan, D. and Miranker, W., ‘Chaotic relaxation’, Linear Algebra Appl. 2 (1969), 199222.CrossRefGoogle Scholar
[3]Elsner, L., Neumann, M. and Vemmer, B., ‘The effect of the number of processors on the convergence of the parallel block Jacobi method’, Linear Algebra Appl. 154/156 (1991), 311330.CrossRefGoogle Scholar
[4]Elsner, L. and Neumann, M., ‘Monotone sequences and rates of convergence of asynchronous iterative methods’, Linear Algebra Appl. 180 (1993), 1733.CrossRefGoogle Scholar
[5]Su, Y. and Zhu, S., ‘Models of parallel multisplitting chaotic iterations methods’, (in Chinese), J. Fudan Univ. Natur. Sci. 30 (1991), 444450.Google Scholar
[6]Young, D.M., Iterative solution of large linear systems (Academic Press, New York, 1971).Google Scholar