zoukankan      html  css  js  c++  java
  • A.Kaw矩阵代数初步学习笔记 6. Gaussian Elimination

    “矩阵代数初步”(Introduction to MATRIX ALGEBRA)课程由Prof. A.K.Kaw(University of South Florida)设计并讲授。
    PDF格式学习笔记下载(Academia.edu)
    第6章课程讲义下载(PDF)

    Summary

    • Gaussian elimination consists of two steps:
      • Forward Elimination of Unknowns
        In this step, the unknown is eliminated in each equation starting with the first equation. This way, the equations are reduced to one equation and one unknown in each equation.
      • Back Substitution
        In this step, starting from the last equation, each of the unknowns is found.
    • More about determinant
      • Let $[A]$ be a $n imes n$ matrix. Then if $[B]$ is a $n imes n$ matrix that results from adding or subtracting a multiple of one row (column) to another row (column), then $det(A) = det(B)$.
      • Let $[A]$ be a $n imes n$ matrix that is upper triangular, lower triangular or diagonal, then $$det(A) = a_{11} imes a_{22} imescdots imes a_{nn} = prod_{i=1}^{n}a_{ii}$$ This implies that if we apply the forward elimination steps of Gaussian elimination method, the determinant of the matrix stays the same according to the previous result. Then since at the end of the forward elimination steps, the resulting matrix is upper triangular, the determinant will be given by the above result.

    Selected Problems

    1. Using Gaussian elimination to solve $$egin{cases}4x_1+x_2-x_3=-2\ 5x_1+x_2+2x_3=4\ 6x_1+x_2+x_3=6end{cases}$$

    Solution:

    Forward elimination: $$egin{bmatrix}4& 1& -1& -2\ 5& 1& 2& 4\ 6& 1& 1& 6end{bmatrix}Rightarrow egin{cases} R_2-{5over4}R_1\ R_3-{3over2}R_1end{cases}egin{bmatrix}4& 1& -1& -2\ 0& -{1over4}& {13over4}& {13over2}\ 0& -{1over2}& {5over2}& 9end{bmatrix}$$ $$Rightarrow R_3-2R_2egin{bmatrix}4& 1& -1& -2\ 0& -{1over4}& {13over4}& {13over2}\ 0& 0& -4& -4end{bmatrix}$$ Back substitution: $$egin{cases}-4x_3=-4\ -{1over4}x_2+{13over4}x_3={13over2}\ 4x_1+x_2-x_3=-2end{cases} Rightarrow egin{cases}x_3=1\ -{1over4}x_2+{13over4}={13over2}\ 4x_1+x_2-1=-2end{cases}$$ $$Rightarrow egin{cases}x_3=1\ x_2 = -13\ 4x_1-13=-1 end{cases}Rightarrow egin{cases}x_1 = 3\ x_2=-13\ x_3=1 end{cases}$$

    2. Find the determinant of $$[A] = egin{bmatrix}25& 5& 1\ 64& 8& 1\ 144& 12& 1end{bmatrix}$$

    Solution:

    Forward elimination $$[A] = egin{bmatrix}25& 5& 1\ 64& 8& 1\ 144& 12& 1end{bmatrix}Rightarrowegin{cases}R_2 - {64over25}R_1\ R_3-{144over25}R_1end{cases} egin{bmatrix}25& 5& 1\ 0& -{24over5}& -{39over25}\ 0& -{84over5}& -{119over25} end{bmatrix}$$ $$Rightarrow R_3-{7over2}R_2 egin{bmatrix}25& 5& 1\ 0& -{24over5}& -{39over25}\ 0& 0 & {7over10} end{bmatrix}$$ This is an upper triangular matrix and its determinant is the product of the diagonal elements $$det(A) = 25 imes(-{24over5}) imes{7over10}=-84 $$

    3. Find the determinant of $$[A] = egin{bmatrix}10& -7& 0\ -3& 2.099& 6\ 5& -1& 5end{bmatrix}$$

    Solution:

    Forward elimination $$[A] = egin{bmatrix}10& -7& 0\ -3& 2.099& 6\ 5& -1& 5 end{bmatrix}Rightarrowegin{cases}R_2 + {3over 10}R_1\ R_3-{1over2}R_1end{cases} egin{bmatrix}10& -7& 0\ 0& -{1over1000}& 6\ 0& {5over2}& 5 end{bmatrix}$$ $$Rightarrow R_3+2500R_2 egin{bmatrix}10& -7& 0\ 0& -{1over1000}& 6\ 0& 0 & 15005 end{bmatrix}$$ This is an upper triangular matrix and its determinant is the product of the diagonal elements $$det(A) = 10 imes(-{1over1000}) imes15005=-150.05$$

    4. Using Gaussian elimination to solve $$egin{cases}3x_1-x_2 - 5x_3 = 9\ x_2-10x_3=0\ -2x_1+x_2=-6end{cases}$$

    Solution:

    Forward elimination: $$egin{bmatrix}3& -1& -5& 9\ 0& 1& -10& 0\ -2& 1& 0& -6end{bmatrix}Rightarrow R_3+{2over3}R_1 egin{bmatrix}3& -1& -5& 9\ 0& 1& -10& 0\ 0& {1over3}& -{10over3}& 0end{bmatrix}$$ $$Rightarrow R_3-{1over3}R_2 egin{bmatrix}3& -1& -5& 9\ 0& 1& -10& 0\ 0& 0 & 0 & 0end{bmatrix}$$ Back substitution: $$egin{cases}x_2-10x_3=0\ 3x_1-x_2-5x_3=9end{cases} Rightarrow egin{cases}x_2 = 10x_3\ 3x_1-15x_3 = 9end{cases} Rightarrow egin{cases}x_1 = 5x_3+3\ x_2 = 10x_3end{cases}$$ where $x_3$ is arbitrary.


    作者:赵胤
    出处:http://www.cnblogs.com/zhaoyin/
    本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。

  • 相关阅读:
    Recon-Erlang线上系统诊断工具
    erlang pool模块。
    深度学习Bible学习笔记:第二、三章 线性代数 概率与信息论
    LeetCode(5):最长回文子串
    LeetCode(4):两个排序数组的中位数
    LeetCode(3):无重复字符的最长子串
    LeetCode(2):Add Two Numbers 两数相加
    LeetCode(1):两数之和
    深度学习Bible学习笔记:第一章 前言
    2018年3月18日论文阅读
  • 原文地址:https://www.cnblogs.com/zhaoyin/p/4160799.html
Copyright © 2011-2022 走看看