作者: Laurent Provot , Yan Gérard
DOI: 10.1007/978-3-642-19867-0_24
关键词:
摘要: We provide a new method to estimate the derivatives of digital function by linear programming or other geometrical algorithms. Knowing digitization real continuous f with resolution h, this approach provides an approximation kth derivative f(k)(x) maximal error in O(h1/1+k) where constant depends on upper bound absolute value (k + 1)th neighborhood x. This convergence rate 1/k+1 should be compared two methods already providing such uniform results, namely 1/3 from Lachaud et. al (only for first order derivative) and (2/3)k Malgouyres et al..