Re: [線代] 矩陣近似解
※ 引述《leo790124 (4浩)》之銘言：
: Find s,t such that [1 0][s] is as close as possible to [1]
: [0 1][t] [1]
: [1 1] [0].
: 不懂他的想要問什麼???
: 請大大幫忙解答
: 謝謝。
Suppose the data collected are a=(1,0),b=(0,1),c=(1,1)
then
[1 1] [1]
A= [0 1] y = [1]
[1 1] [0]
hence,A*A = [1 0 1] [1 1] = [2 2]
[1 1 1] [0 1] [2 3]
[1 1]
Thus, (A*A)^(-1)= (1/2)[ 3 -2]
[-2 2]
and [c] = (1/2)[ 3 -2][1 0 1][1] = [-1/2]
[d] [-2 2][1 1 1][1] [ 2 ]
[0]
應該是這樣...
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.38.162.84
討論串 (同標題文章)