Chapter 4: LU and PLU decompositions
Christoph Börgers
Abstract
Christoph Börgers
Abstract
You will see in this chapter that Gaussian elimination can be interpreted as decomposing the matrix A, or at least a matrix obtained from A by permuting rows, into triangular factors—a lower triangular factor L and an upper triangular factor U. This is a neat theoretical fact, but it is also practically useful. Once you have solved a system Ax = b, you know the decomposition into triangular factors, and, if you wanted to solve another system with the same matrix A, you could use that to make the computation much faster.
A significance statement is not available in the OpenAlex record.
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.
You will see in this chapter that Gaussian elimination can be interpreted as decomposing the matrix A, or at least a matrix obtained from A by permuting rows, into triangular factors—a lower triangular factor L and an upper triangular factor U. This is a neat theoretical fact, but it is also practically useful. Once you have solved a system Ax = b, you know the decomposition into triangular factors, and, if you wanted to solve another system with the same matrix A, you could use that to make the computation much faster.
Key concepts: Triangular matrix, LU decomposition, Gaussian elimination, Factor (programming language), Computation, Matrix (chemical analysis), Decomposition, Mathematics