The Use of multiple fronts in Gaussian elimination
Iain Duff, J. A. Scott · 1994
We examine a method for extending a frontal solution scheme principally so that parallelism can be exploited in the solution process. We see also that this technique can reduce the amount of work required and enable the solution of very large problems even on uniprocessors. Keywords: sparse matrices, frontal methods, parallel processing, PVM, domain decomposition. AMS(MOS) subject classifications: 65F05, 65F50. 1 Extended and revised version of paper in Proceedings of the Fifth SIAM Conference on Applied Linear Algebra. Edited by John Lewis. SIAM Press, 567-571. 2 Current reports available by anonymous ftp from camelot.cc.rl.ac.uk (internet 130.246.8.61) in the directory "pub/reports". This report is in file dsRAL94040.ps.Z. Central Computing Department Atlas Centre Rutherford Appleton Laboratory Oxon OX11 0QX September 13, 1994. Contents 1 Introduction 1 2 Frontal schemes 1 3 The use of multiple fronts 3 4 The use of MA42 for multiple front algorithms 4 4.1 MA42 code : :...