§3, p. 7 with §2 (2.11)–(2.14), p. 4 — meets the Hermite conditions at
ProvedSlowConvergence.Newton.hermite_p_conditionshermite-interpolationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-complexity
Let , , , and let be the quintic (2.11) with the coefficients of p. 4 and (2.14) in the case . Then for every
These are the conditions that make the piecewise function (equal to on the -th interval, shifted by the next knot value) twice continuously differentiable on , with the values (3.9), slopes and curvature at the knots required by (3.3)–(3.4).
Preamble
import Mathlib import Definitions.Def_SlowConvergence_Newton_Data import Definitions.Def_SlowConvergence_Newton_Pieces open scoped RealInnerProductSpace
Formal statement
namespace SlowConvergence.Newton
/-- Cartis, Gould & Toint, preprint 15 Oct 2009, §2, (2.11)–(2.15), p. 4, in the case `α_k = 1` used
for `f_{2,1} = f_1` in §3, p. 7: the quintic `p_k` with coefficients `c_{0,k}, c_{1,k}, c_{2,k}` and
(2.14) satisfies the Hermite conditions on `[0, µ_k]`:
`p_k(0) = ½(1/(k+1))^{1+2η}`, `p_k(µ_k) = 0` (2.12), `p_k'(0) = −(1/(k+1))^{1/2+η}`,
`p_k'(µ_k) = −(1/(k+2))^{1/2+η}` (2.13), and `p_k''(0) = p_k''(µ_k) = 1`. -/
theorem hermite_p_conditions (τ : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (k : ℕ) :
p τ k 0 = 1 / 2 * (1 / ((k : ℝ) + 1)) ^ (1 + 2 * eta τ) ∧
p τ k (mu τ k) = 0 ∧
deriv (p τ k) 0 = -((1 / ((k : ℝ) + 1)) ^ (1 / 2 + eta τ)) ∧
deriv (p τ k) (mu τ k) = -((1 / ((k : ℝ) + 2)) ^ (1 / 2 + eta τ)) ∧
deriv (deriv (p τ k)) 0 = 1 ∧
deriv (deriv (p τ k)) (mu τ k) = 1 := by sorry
end SlowConvergence.Newton
Source
Cartis, Gould & Toint, On the complexity of steepest descent, Newton's and regularized Newton's methods, preprint 15 Oct 2009, p. 7, §3 (f_{2,1} = f_1 with α_k = 1); p. 4, §2, (2.11)–(2.14)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.