论文信息 - The Use of multiple fronts in Gaussian elimination

The Use of multiple fronts in Gaussian elimination

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.

I. Duff | J. Scott

[1] Bruce M. Irons,et al. A frontal solution program for finite element analysis , 1970 .

[2] Iain S. Duff,et al. Design features of a frontal code for solving sparse unsymmetric linear systems out-of-core , 1984 .

[3] Iain S. Duff,et al. Concurrent Multifrontal Methods: Shared Memory, Cache, and Frontwidth Issues , 1987 .

[4] I. Duff,et al. THE USE OF PROFILE REDUCTION ALGORITHMS WITH A FRONTAL CODE , 1989 .

[5] Jack J. Dongarra,et al. A set of level 3 basic linear algebra subprograms , 1990, TOMS.

[6] E. Lui,et al. A parallel frontal solver on the alliant FX/80 , 1991 .

[7] Iain S. Duff,et al. Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .

[8] Jack Dongarra,et al. Pvm 3 user's guide and reference manual , 1993 .

[9] Jennifer A. Scott,et al. MA42 - A new frontal code for solving sparse unsymmetric systems , 1993 .

[10] Iain S. Duff. Exploitation of parallelism in direct and semi-direct solution of large sparse systems , 1994 .