Systolic preconditioning algorithms for the jacobi iterative solution of sparse linear systems

Evans, David J. and Megson, Graham M. (1989) Systolic preconditioning algorithms for the jacobi iterative solution of sparse linear systems. In: Parcella '88: 4th International workshop on parallel processing by cellular automata and arrays: Berlin, GDR, October 17–21, 1988: proceedings. Lecture notes in computer science (342). Springer-Verlag, Berlin, pp. 256-265. ISBN 9783540506478

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3-540-50647-0_116

Abstract

Systolic algorithms for preconditioned iterative procedures are described and discussed in relation to existing systolic arrays for iterative methods applied to the systems of linear equations arising from the solution of partial differential equations. In boundary value problems it is shown that if the cost of the preconditioned systolic arrays in terms of hardware is related to the (standard) iterative methods, then savings in the number of array cells can be made when the system involved is large and sparse (narrow bandwidth) with a significant improvement in convergence rate.

Item Type: Book Section
Subjects: University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)
Depositing User: Miss Nina Watts
Date Deposited: 03 Feb 2009 11:56
Last Modified: 19 Oct 2009 14:43
URI: http://westminsterresearch.wmin.ac.uk/id/eprint/5791

Actions (login required)

Edit Item (Repository staff only) Edit Item (Repository staff only)