Professional Documents
Culture Documents
𝑉 𝑀
𝐸[𝑥|𝑧] = 𝑥̅ + 𝑧 −→ 𝑧
𝑀+𝑉 𝑀+𝑉
𝑉 𝑀
𝐸[𝑥|𝑧] = 𝑥̅ + 𝑧−→ 𝑥̅
𝑀+𝑉 𝑀+𝑉
𝑥𝑘 = x1 , x2 , … , xn
1
𝑠̅ = (𝑥 + 𝑥2 + ⋯ + 𝑥𝑛 ) (1)
𝑛 1
Define
𝑘
1
s𝑘 = ∑ 𝑥𝑘
𝑘
𝑖=1
Then
𝑘+1 𝑘
1 1 1
s𝑘+1 = ∑ 𝑥𝑘 = 𝑥𝑘 + ∑ 𝑥𝑘
𝑘+1 𝑘+1 𝑘+1
𝑖=1 𝑖=1
1 𝑘
= 𝑥𝑘 + 𝑠
𝑘+1 𝑘+1 𝑘
k 1
= 𝑠𝑘 + 𝑥 (2)
k+1 𝑘 + 1 𝑘+1
2.3 Merits for recursive way
3. (3.20) example
z = x + v , x~N(2,1), 𝑣~𝑁(0,1/2)
1) Algorithm
Where
1
M = 1, H = 1, V =
2
−1
1 −1
- 𝑃 = (𝑀−1 + 𝐻𝑇 𝑉 −1 𝐻)−1 = (1−1 + ( ) ) = 1/3
2
- 𝐸[𝑥|𝑧1 = 1] = 𝑥̂ = 𝑥̅ + 𝑃𝐻 𝑇 𝑉 −1 (𝑧 − 𝐻𝑥̅ )
1 1 −1 2 4
= 2 + ( ) ( ) (1 − 2) = 2 + (−1) =
3 2 3 3
3) two measurements
𝑧1 1 1
[𝑧 ] = [ ] 𝑥 + [ ] 𝑣
2 1 1
−1
1 −1 1 1
P = (M −1 + 𝐻𝑇 𝑉 −1 𝐻)−1 = (1−1 + [1 1] ( ) [ ]) = (1 + 4)−1 =
2 1 5
1 1 −1 1 1 2 −1
𝑥̂ = 𝑥̅ + 𝑃𝐻𝑇 𝑉 −1 (𝑧 − 𝐻𝑥̅ ) = 2 + ( ) [1 1] ( ) ([ ] − [ ] 2) = 2 + ( ) [1 1] ([ ])
5 2 −1 1 5 −3
2 8 2
= 2 + ( ) [−1 − 3] = 2 − =
5 5 5
4) Three measurements
(z1 , 𝑧2 , 𝑧3 ) = (1, −1,3) −→ 𝐸[𝑥|𝑧1 , 𝑧2 , 𝑧3 ]
1 −1
1 −1 1
P = (M −1 + 𝐻𝑇 𝑉 −1 𝐻)−1 = (1−1 + [1 1 1] ( ) [1]) = (1 + 6)−1 =
2 7
1
1 1 −1
1 1 2
−1
𝑥̂ = 𝑥̅ + 𝑃𝐻𝑇 𝑉 −1 (𝑧 − 𝐻𝑥̅ ) = 2 + [1 1 1] ( ) ([−1] − [1] 2) = 2 + [1 1 1] ( [−3])
7 2 7
3 1 1
2 8
= 2 + (−3) =
7 7
1) Algorithm
𝑥̂1 = 𝑥̅ + 𝐾1 (𝑧1 − 𝐻1 𝑥̅ )
K1 = (𝑀−1 + 𝐻1𝑇 𝑉1−1 𝐻1 )−1 𝐻1𝑇 𝑉1−1
P1−1 = 𝑀−1 + 𝐻1𝑇 𝑉1−1 𝐻1
k=2
1 −1
P1−1 = (1−1 + (1) ( ) (1)) = 3
2
1 1 −1 2 4
𝑥̂1 = 𝑥̅ + 𝐾1 (𝑧1 − 𝐻1 𝑥̅ ) = 2 + ( ) ( ) (1 − 2) = 2 − =
3 2 3 3
1 −1
P2−1 = 𝑃1−1 + 𝐻2𝑇 𝑉2−1 𝐻2 = 3 + (1) ( ) (1) = 5
2
4 1 1 −1 4 4 2 7 4 14 6 2
𝑥̂2 = 𝑥̂1 + 𝐾2 (𝑧2 − 𝐻2 𝑥̂1 ) = + ( ) ( ) (−1 − ) = + (− ) = − = =
3 5 2 3 3 5 3 3 15 15 5
3) dsa
Sda