A. J. Macleod
Abstract
There has recently been an upsurge of work on the (by now) classical problem of the stability of Gaussian elimination e.g., the papers of Trefethen & Schreiber [5], and Higham and Higham [2]. This short note describes some experimental results in this area derived by the author. They are described more fully in a technical report [4].
- J. T. Goodman, C. B. Moler, Three numerical experiments with Gaussian elimination, LINPACK Working Note 8, Argonne National Laboratory, AMD Tech. Memo. 311.Google Scholar
- N. J. Higham, D. J. Higham, Large growth factors in Gaussian elimination with pivoting, S.I.A.M. Journal on Matrix Anal. and Appl., vol 10, 1989, pp 155--164.Google ScholarCross Ref
- N. L. Johnson, S. Kotz, Distributions in Statistics: Continuous Univariate Distributions vol 1, John Wiley, New York, 1970.Google Scholar
- A. J. MacLeod, The distribution of the growth factor in Gaussian elimination with partial pivoting. Unpublished technical report, available from author.Google Scholar
- L. N. Trefethen, R. S. Schreiber, Average-case stability of Gaussian elimination. N.A. Report 88-3, Dept. of Mathematics, M.I.T.Google Scholar
- J. H. Wilkinson, Rounding Errors in Algebraic Processes, H.M.S.O., London, 1963. Google ScholarDigital Library
Index Terms
- Some statistics on Gaussian elimination with partial pivoting
Recommendations
An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
In this paper, we consider the problem of solving a sparse nonsingular system of linear equations. We show that the structures of the triangular matrices obtained in the $LU$-decomposition of a sparse nonsingular matrix A using Gaussian elimination with ...
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
Let $Ax = b$ be a large sparse nonsingular system of linear equations to be solved using Gaussian elimination with partial pivoting. The factorization obtained can be expressed in the form $A = P_1 M_1 P_2 M_2 \cdots P_{n - 1} M_{n - 1} U$, where $P_k $...
Pivoting techniques for symmetric Gaussian elimination
In order to factorize an indefinite symmetric matrix G of the form G=LDL T where L is a trivially invertible matrix and D is a diagonal matrix, we introduce a new kind of pivoting operation. The algorithm suggested maintains the stability and ...
Comments