You are on page 1of 1

HW4

Problem 1:

In Gaussian elimination, the coefficient matrix will eventually be transformed to an upper triangular
matrix.

For example:

a 4 by 4 coefficient matrix is transformed to a 4 by 4 upper triangular matrix:

a11 a12 a13 a14 a 11 a 12 a13 a14


Row/pivot operations
a 21 a22 a23 a24 0 a 22 ' a23 ' a24 '
a 31 a32 a33 a34 0 0 a33 ' a34 '
a 41 a42 a43 a 44 0 0 0 a 44 '

The method of the transformation is provided by the script of Gaussian elimination in our textbook. It is
also discussed in today’s lecture video.

Similarly, please develop your own script/function file that can transfer a coefficient matrix of any
dimension to a lower triangular matrix by using row/pivot operations. The for loops should be close to
those in forward elimination part in the script of Gauss elimination.

a11 a12 a13 a14 a 11 ' 0 0 0


Row/pivot operations
a 21 a22 a23 a24 a 21 ' a22 ' 0 0
a 31 a32 a33 a34 a 31 ' a32 ' a33 ' 0
a 41 a42 a43 a 44 a 41 a42 a 43 a44

You might also like