推 skciv :看basis 11/13 00:08
推 mp8113f :V的basis要[1 0 1 0 1 ] ? 11/13 00:14
推 powerkshs :[1 0 1 0 1 ]跟[1 0 0 0 0 ]仍然是基底啊 11/13 11:27
如題
V = span(v1, v2, v3, ..., vn)
U = span(u1, u2, u3, ..., un)
如果要找 V 跟 U 的交集
有什麼有系統的找法嗎?
例題:
[1] [0]
[0] [0]
V = span([0], [1])
[0] [0]
[0] [1]
[ 2] [ 1] [1]
[-2] [ 0] [0]
U = span([ 0], [-1], [1])
[ 2] [ 0] [0]
[ 1] [ 0] [1]
[1]
[0]
V∩U = span([1])
[0]
[1]
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.118.107.91