zoukankan      html  css  js  c++  java
  • 【读书笔记】:MIT线性代数(3):Special Solution, Rank and RREF

    Special Solutions:

    Notice what is special about s 1 and S2. They have ones and zeros in the last two components. Those components are "free" and we choose them specially. Then the first components -2 and -3 are determined by the equation Ax = 0. The first component is pivot, so it is not free. Special solutions come from our special choices.

    A has rank=2, and the number of unknowns n=2, so the the number of free variables=n-r=0. Thus, no special solutions! What's more, A is invertible! B also doesn't have special solutions. But C has 2 special solutions.

     

    Rank:The numbers m and n give the size of a matrix-but not necessarily the true size of a linear system. An equation like 0 = 0 should not count, they can go up when elimination. The true size of A is given by its rank.

    RREF(Reduced Row Echelon Form):

  • 相关阅读:
    小阳买水果
    单调队列+dp
    最长的合法序列(栈+dp)
    A. 打印收费
    数位dp(K好数)
    Floyd(选地址)
    最短路计数
    线段树维护区间01
    解密(拓展欧几里的)
    树、森林的遍历
  • 原文地址:https://www.cnblogs.com/rhyswang/p/9509251.html
Copyright © 2011-2022 走看看