【算法笔记】再看线性基

线性基 -> 线性无关 -> 如果有一个新向量与当前的基线性无关,则加入后当前基底表示的空间更大
判断线性相关与否 -> 当前向量能否被当前基底表示 -> 如果不能,加入当前的基底中
线性基的大小 -> 空间的维度 -> 空间的大小 -> 空间最大,即线性基的个数越多 -> 线性基的大小与其插入顺序不相关 -> 线性基的插入顺序不会影响答案

因为线性基属于线性代数范畴,其深入理解又与拟阵挂钩,而拟阵则更为高深
所以今晚再一次回看线性基,仍然没有大彻大悟,不过确实有更深入的理解
感觉wiki上的这一段话或许能说明插入顺序不影响结果:
96453144

3 thoughts to “【算法笔记】再看线性基”

  1. Thank you for another wonderful article. Where else could anyone get that type of information in such an ideal way of writing? I have a presentation next week, and I am on the look for such information.

  2. A person essentially help to make seriously articles I would state. That is the first time I frequented your web page and thus far? I amazed with the analysis you made to create this actual publish extraordinary. Excellent activity!

  3. 39984 677856Wow, incredible weblog structure! How long have you been running a blog for? you made running a weblog appear straightforward. The entire appear of your web site is magnificent, neatly as the content material material! 486986

Leave a Reply

Your email address will not be published. Required fields are marked *