Duff, I. S.; Reid, J. K. The multifrontal solution of unsymmetric sets of linear equations. (English) Zbl 0557.65017 SIAM J. Sci. Stat. Comput. 5, 633-641 (1984). The authors extend their work in ACM Trans. Math. Software 9, 302-325 (1983; Zbl 0515.65022) for symmetric indefinite matrices to unsymmetric matrices. They assure that the pattern of non-zeros is symmetric or nearly so and make use of a multifrontal technique. They show that the time for analysis is small as compared to that for factorization and that the analysis can be done in a predictable amount of storage. Advantages of using the proposed scheme on a vector or parallel computer are pointed out. Results of computational experiments on sets of test matrices covering a wide range of sparsity patterns and applications are given. Reviewer: R.P.Tewarson Cited in 1 ReviewCited in 27 Documents MSC: 65F05 Direct numerical methods for linear systems and matrix inversion 65F50 Computational methods for sparse matrices Keywords:Gaussian elimination; unsymmetric matrices; multifrontal technique; factorization; computational experiments; test matrices; sparsity patterns Citations:Zbl 0515.65022 Software:MA32 PDFBibTeX XMLCite \textit{I. S. Duff} and \textit{J. K. Reid}, SIAM J. Sci. Stat. Comput. 5, 633--641 (1984; Zbl 0557.65017) Full Text: DOI