Professional Documents
Culture Documents
Thesis
Thesis
2
1 НОТАТКИ
𝑛
∑︁
(𝑥(𝑗) − 𝑥(𝑗 − 1) + 𝛼∇𝑥(𝑗 − 1))2 =
𝑗=1
𝑛 𝑁
∑︁ ∑︁−1
(𝑥𝑙 (𝑗) − 𝑥𝑙 (𝑗 − 1) + 𝛼∇𝑙 (𝑗 − 1))2
𝑗=1 𝑙=1
⃒
⃒ 𝑑
Щоб знайти мiнiмум, продиференцiюємо рiвнiсть за ⃒
⃒ 𝑑𝛼 i
прирiвняємо до нуля
𝑛 𝑁
∑︁ ∑︁−1
2 (𝑥𝑙 (𝑗) − 𝑥𝑙 (𝑗 − 1) + 𝛼∇𝑙 (𝑗 − 1)) ∇𝑙 (𝑗 − 1) = 0
𝑗=1 𝑙=1
𝑛 𝑁
∑︁ ∑︁−1 𝑛 𝑁
∑︁ ∑︁−1
2 (𝑥𝑙 (𝑗) − 𝑥𝑙 (𝑗 − 1)) ∇𝑙 (𝑗 − 1) + 𝛼∇2𝑙 (𝑗 − 1) = 0
𝑗=1 𝑙=1 𝑗=1 𝑙=1
∑︀𝑛 ∑︀𝑁 −1
𝑗=1 𝑙=1 2 (𝑥𝑙 (𝑗) − 𝑥𝑙 (𝑗 − 1)) ∇𝑙 (𝑗 − 1)
𝛼= ∑︀𝑛 ∑︀𝑁 −1 2
𝑗=1 𝑙=1 ∇𝑙 (𝑗 − 1)
Твердження 1.1.
𝑛
∑︁
𝑛
∇ (𝑥𝑘 ) = 𝑛+𝑖
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖 (1.1)
𝑖=−𝑛
𝑛
∑︁ 𝑛
∑︁
𝑛+𝑖
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖−1 𝑛
= (−1) 𝑥𝑘−𝑛−1 + 𝑛+𝑖
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖−1 =
𝑖=−𝑛 𝑖=−𝑛+1
𝑛−1
∑︁
𝑛
(−1) 𝑥𝑘−𝑛−1 + 𝑛+𝑖+1
𝐶2𝑛 (−1)|𝑖+1| 𝑥𝑘+𝑖
𝑖=−𝑛
5
𝑛
∑︁ 𝑛−1
∑︁
𝑛+𝑖
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖+1 𝑛
= (−1) 𝑥𝑘+𝑛+1 𝑛+𝑖
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖+1 =
𝑖=−𝑛 𝑖=−𝑛
𝑛
∑︁
(−1)𝑛 𝑥𝑘−𝑛−1 + 𝑛+𝑖−1
𝐶2𝑛 (−1)|𝑖−1| 𝑥𝑘+𝑖
𝑖=−𝑛+1
Отже маємо
𝑛
∑︁
(−1) 𝑛+1
𝑥𝑘−𝑛−1 + (−1) 𝑛+1
𝑥𝑘−𝑛−1 + 2 𝑛+𝑖
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖
𝑖=−𝑛
𝑛−1
∑︁ 𝑛
∑︁
− 𝑛+𝑖+1
𝐶2𝑛 (−1)|𝑖+1| 𝑥𝑘+𝑖 − 𝑛+𝑖−1
𝐶2𝑛 (−1)|𝑖−1| 𝑥𝑘+𝑖 =
𝑖=−𝑛 𝑖=−𝑛+1
𝑛
∑︁
(−1) 𝑛+1
𝑥𝑘−𝑛−1 + (−1) 𝑛+1
𝑥𝑘−𝑛−1 + 𝑛+𝑖
2𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖
𝑖=−𝑛
𝑛−1
∑︁ 𝑛
∑︁
+ 𝑛+𝑖+1
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖 + 𝑛+𝑖−1
𝐶2𝑛 (−1)|𝑖| 𝑥𝑘+𝑖 =
𝑖=−𝑛 𝑖=−𝑛+1
𝑛+1 𝑛+1
(−1) 𝑥𝑘−𝑛−1 𝑥𝑘−𝑛−1 + 2(−1)𝑛 𝑥𝑘−𝑛 + 2(−1)𝑛 𝑥𝑘+𝑛 +
+ (−1)
𝑛−1
∑︁
𝑛 𝑛
2𝑛(−1) 𝑥𝑘−𝑛 + 2𝑛(−1) 𝑥𝑘+𝑛 + (−1)|𝑖| 𝑥𝑘+𝑖 (2𝐶2𝑛
𝑛+𝑖 𝑛+𝑖+1
+ 𝐶2𝑛 𝑛+𝑖−1
+ 𝐶2𝑛 )
𝑖=−𝑛+1
𝑛
∑︁
𝑛+1−𝑡
𝑥𝑘 (𝑛 + 1) = (1 − 𝛼∇∘) 𝑥𝑘 (𝑡) + (1 − 𝛼∇∘)𝑛−𝑖 𝜉𝑘 (𝑖 + 1) =
𝑖=𝑡
𝑛+1−𝑡
(1 − 𝛼∇∘) (𝑥𝑘 (𝑡 − 1) − 𝛼∇(𝑥𝑘 (𝑡 − 1)) + 𝜉𝑘 (𝑡))+
𝑛
∑︁
(1 − 𝛼∇∘)𝑛−𝑖 𝜉𝑘 (𝑖 + 1) =
𝑖=𝑡
𝑛
∑︁
𝑛+1−(𝑡−1)
(1 − 𝛼∇∘) 𝑥𝑘 (𝑡 − 1) + (1 − 𝛼∇∘)𝑛−𝑖 𝜉𝑘 (𝑖 + 1)
𝑖=𝑡−1
𝛼 = 𝑎1
𝛼 2 = 𝑎2
...
Тодi:
𝑛
∑︁
𝑛+1
𝑥𝑘 (𝑛 + 1) = (1 − 𝛼∇∘) 𝑥𝑘 (0) + (1 − 𝛼∇∘)𝑛−𝑖 𝜉𝑘 (𝑖 + 1) =
𝑖=0
𝑖=𝑛+1
∑︁ 𝑛 𝑛−𝑖
∑︁ ∑︁
(−1)𝑖 𝛼𝑖 ∇𝑖 (𝑥𝑘 (0)) + (−1)𝑗 𝛼𝑗 ∇𝑗 (𝜉𝑘 (𝑖 + 1)) =
𝑖=0 𝑖=0 𝑗=0
𝑖=𝑛+1
∑︁ 𝑛 ∑︁
∑︁ 𝑛−𝑖
𝑖 𝑖
(−1) 𝑎𝑖 ∇ (𝑥𝑘 (0)) + (−1)𝑗 𝑎𝑗 ∇𝑗 (𝜉𝑘 (𝑖 + 1)) =
𝑖=0 𝑖=0 𝑗=0