Author:
Scott Jennifer,Tůma Miroslav
Abstract
AbstractThis chapter introduces the basic concepts of Gaussian elimination and its formulation as a matrix factorization that can be expressed in a number of mathematically equivalent but algorithmically different ways.
Publisher
Springer International Publishing
Reference28 articles.
1. Ashcraft, C. (1995). Compressed graphs and the minimum degree algorithm. SIAM Journal on Scientific Computing, 16(6), 1404–1411.
2. Brayton, R. K., Gustavson, F. G., & Willoughby, R. A. (1970). Some results on sparse matrices. Mathematics of Computation, 24, 937–954.
3. Brualdi, R. A. & Ryser, H. J. (1991). Combinatorial Matrix Theory. Cambridge: Cambridge University Press.
4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). Cambridge, MA: MIT Press.
5. Davis, T. A., Rajamanickam, S., & Sid-Lakhdar, W. M. (2016). A survey of direct methods for sparse linear systems. Acta Numerica, 25, 383–566.