60 likes | 205 Views
This introduction to LU Factorization explores its role as a matrix representation of Gaussian elimination. It covers essential concepts such as lower triangular matrices, row operations, and the principles behind LU factorization for systems of equations. The text includes propositions illustrating the mechanics of the factorization process, such as the representation of row operations by triangular matrices and the operation count necessary for solving n equations with n variables. This foundational knowledge is vital for students in mathematics and computer science.
E N D
Introduction to Numerical Analysis I LU Factorization MATH/CMPSC 455
LU Factorization LU-factorization is a matrix representation of Gaussian elimination
Example: Example:
Proposition: Let denote the lower triangular matrix whose only nonzero entries are 1’s on the main diagonal and –c in (i,j) position. The it represents the row operation “subtracting c times row j from row i.” Proposition: Proposition:
Operation Count The LU factorization for a system of n equations in n variables can be completed by operations