New concepts:
Bordered matrix for a linear system
Similarity transformations of a linear system
Gaussian elimination
Idea: make one fewer unknown appear in each equation. Use first equation to eliminate x1 in equations 2,3
Use second equation to eliminate x2 in equation 3
Start finding components from last to first to obtain x3=1, x2=1,x1=1
Explicitly writing the unknowns x1,x2,x3 is not necessary. Intoduce the “bordered” matrix
Define allowed operations:
multiply a row by a non-zero scalar
add a row to another
Bordered matrices obtained by the allowed operations are said to be similar, in that the solution of the linear system stays the same
To find solution, use allowed operations to make an identity matrix appear
The above constitute “Gaussian elimination”
>>
A=[1 2 -1 2; 2 -1 1 2; 3 -1 -1 1]; A(2,:)=A(2,:)-2*A(1,:); A(3,:)=A(3,:)-3*A(1,:); disp(A)
1 2 -1 2 0 -5 3 -2 0 -7 2 -5
1 2 -1 2
0 -5 3 -2
0 -7 2 -5
Form the bordered matrix in both cases, and reduce to triangular form