4pgnotes - STEPS IN GAUSSIAN ELIMINATION The steps in...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: STEPS IN GAUSSIAN ELIMINATION The steps in Gaussian elimination can be summarized as follows: Stage 1: (Forward Elimination Phase) 1. Search the first column of [ A | b ] from the top to the bottom for the first non-zero entry, and then if necessary, the second column (the case where all the coefficients corresponding to the first variable are zero), and then the third column, and so on. The entry thus found is called the current pivot . 2. Interchange, if necessary, the row containing the current pivot with the first row. 3. Keeping the row containing the pivot (that is, the first row) untouched, subtract appropriate multiples of the first row from all the other rows to obtain all zeroes below the current pivot in its column. 4. Repeat the preceding steps on the submatrix consisting of all those elements which are below and to the right of the current pivot. 5. Stop when no further pivot can be found. Remark : The forward elimination phase of the Gauss elimination method leads to the row echelon form of a matrix which can be defined as follows: A matrix is said to...
View Full Document

This note was uploaded on 01/27/2010 for the course EE 4343 taught by Professor Asdfasdsas during the Spring '10 term at Aarhus Universitet.

Page1 / 2

4pgnotes - STEPS IN GAUSSIAN ELIMINATION The steps in...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online