Abstract
We discuss several algorithms for the solution of sparse linear systems on parallel architectures. We will be concerned primarily with shared memory machines and will consider both direct and iterative methods of solution. The direct methods are based on Gaussian elimination and exploit parallelism coming from both the sparsity and from a full matrix kernel. The iterative method is a block projection method using a direct solver within the blocks. We then discuss the development of two codes, one for the solution of general sparse equations, the other for sparse symmetric indefinite systems. Some results on vector multiprocessor supercomputers are presented to illustrate the behaviour of our approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amestoy, P. R. (1990). Factorization of large unsymmetric sparse matrices based on a multifrontal approach in a multiprocessor environment. PhD Thesis. CERFACS, Toulouse.
Amestoy, P.R. and Duff, I.S. (1989). Vectorization of a multiprocessor multifrontal code. Int. J. Supercomputer Applics. 3 (3), 41–59.
Amestoy, P. R. and Duff, I. S. (1991). Efficient and portable implementation of a multifrontal method on a range of MIMD computers. SIAM Symposium on sparse matrices, May 1989, Salishan, Oregon. To appear.
Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., DuCroz, J., Greenbaum, A., Hammarling, S., McKenney, A., and Sorensen, D. (1990). LAPACK: A portable linear algebra library for high-performance computers. LAPACK Working Note 20. Report CS-90–105, Computer Science Department, The University of Tennessee, Knoxville, Tennessee. To appear in Proceedings of Supercomputer’90, ACM Press, New York.
Arioli, M., Demmel, J. W., and Duff, I. S. (1989). Solving sparse linear systems with sparse backward error. SIAM J. Matrix Anal. and Applics. 10, 165–190.
Arioli M., Duff I. S., Noailles, J., and Ruiz, D. (1990). A block projection method for sparse matrices. Report RAL-90–093, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire OX11 0QX. Report TR/PA/90/31, CERFACS, Toulouse. To appear in SIAM J. Sci. Stat. Comput.
Arioli M., Duff I.S., and de Rijk P.P.M. (1989). On the augmented system approach to sparse least-squares problems. Numerische Math. 55, 667–684.
Arioli, M., Duff, I.S., and Ruiz, D. (1991). Stopping criteria for iterative solvers. Technical Report, CERFACS, Toulouse. To appear.
Bramley, R. and Sameh, A. (1990). Row projection methods for large nonsymmetric linear systems. Report, 957. Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign. To appear in SIAM J. Sci. Stat. Comput.
Davis, T.A. and Yew, P-C. (1990). A stable nondeterministic parallel algorithm for general unsymmetric sparse LU factorization. SIAM J. Matrix Anal. and Applies. 11, 383–402.
Davis, T.A. and Duff, I.S. (1991). Design and implementation of an unsymmetric multifrontal algorithm. Technical Report, CERFACS, Toulouse. To appear.
Daydé, M. and Duff, I. S. (1989). Use of Level 3 BLAS in LU factorization on the CRAY-2, the ETA 10-P, and the IBM 3090/VF. Int. J. Supercomputer Applies. 3 (2), 40–70.
Daydé, M. and Duff, I. S. (1990). Use of Level 3 BLAS in LU factorization in a multitasking environment on three vector multiprocessors, the CRAY-2, the IBM 3090 VF, and the Alliant FX/80. Technical Report RAL-90–083, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire OX11 0QX. Technical Report TR/PA/90/30, CERFACS, Toulouse.
Dongarra, J. J., Du Croz, J., Duff, I.S., and Hammarling, S. (1990). A set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Sofiw. 16, 1–17.
Dongarra, J. J., Du Croz, J., Hammarling, S., and Hanson, R. J. (1988). An extended set of Fortran Basic Linear Algebra Subprograms. ACM Trans. Math. Softw. 14, 1–17.
Duff, I. S. (1977). MA28 — a set of Fortran subroutines for sparse unsymmetric linear equations. AERE R8730, HMSO, London.
Duff, I.S., Gould, N.I.M., Reid, J.K., Scott, J. A., and Turner, K. (1991). Factorization of sparse symmetric indefinite matrices. Report RAL-90–066, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire OX11 0QX. To appear in IMA J. Numer. Anal. 11 (2)
Duff, I.S., Grimes, R.G., and Lewis, J.G. (1989). Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1–14.
Duff, I. S. and Johnsson, S. L. (1989). Node orderings and concurrency in structurally-symmetric sparse problems. In Parallel Supercomputing: Methods, Algorithms and Applications. G F Carey (ed.). John Wiley & Sons, Ltd., Chichester, New York, Brisbane, and Toronto, 177–189.
Duff, I. S. and Reid, J. K. (1982). MA27 — A set of Fortran subroutines for solving sparse symmetric sets of linear equations. AERE R10533, HMSO, London.
Duff, I. S. and Reid, J. K. (1983). The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302–325.
Duff, I. S. and Reid, J. K. (1984). The multifrontal solution of unsymmetric sets of linear systems. SIAM J. Sci. Stat. Comput. 5, 633–641.
Gay, D.M. (1985). Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter.
Gilbert, J.R. and Peierls, T. (1988). Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9, 862–874.
Hageman, L. A. and Young, D. M. (1981). Applied iterative methods. Academic Press, New York and London.
Kamath, C. and Samen, A. (1989). A projection method for solving nonsymmetric linear systems on multiprocessors. Parallel Computing 9, 291–312.
Sloboda F. (1988). A projection method of the Cimmino type for linear algebraic systems, Technical Report n. 16, Dipartimento di Matematica, University of Bergamo, Italy.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duff, I.S. (1991). Parallel Algorithms for General Sparse Systems. In: Spedicato, E. (eds) Computer Algorithms for Solving Linear Algebraic Equations. NATO ASI Series, vol 77. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76717-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-76717-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-76719-7
Online ISBN: 978-3-642-76717-3
eBook Packages: Springer Book Archive