Some Condition-Number bounds for the Gaussian Elimination Process
C. G. BROYDN
Abstract
C. G. BROYDN
Abstract
It is well-known that Gaussian Elimination is equivalent to LU decomposition. This paper shows that if Gaussian Elimination is applied to a well-conditioned matrix, and if an increase in element size is observed during the elimination process, then both the triangular factors will be badly conditioned. It is further shown that the effect of partial pivoting is to place an upper bound upon the condition number of the lower triangular factor.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is well-known that Gaussian Elimination is equivalent to LU decomposition. This paper shows that if Gaussian Elimination is applied to a well-conditioned matrix, and if an increase in element size is observed during the elimination process, then both the triangular factors will be badly conditioned. It is further shown that the effect of partial pivoting is to place an upper bound upon the condition number of the lower triangular factor.
Key concepts: Gaussian elimination, Triangular matrix, Gaussian, Condition number, Mathematics, LU decomposition, Upper and lower bounds, Matrix (chemical analysis)