Theorem 3.1: Let be such that Gaussian elimination yields nonzero diagonal A elements , Then is nonsingular and k=1, 2, n. A …, . Also, is upper triangular and has the factorization A , where is lower triangular with elements The vector . Proof: Note that once is proven, , so follows.
Theorem 3.1: Let A be such that Gaussian elimination yields nonzero diagonal elements , k=1, 2, …, n. Then A is nonsingular and . Also, is upper triangular and A has the factorization , where is lower triangular with elements The vector . Proof: Note that once is proven, , so follows.
2013sw.docx