Inequalities for the derivatives
A. G. Ramm
Abstract
It is proved that one cannot approximate stably the first derivative of a smooth function given noisy values of this function and a bound on this function and its first derivative. Such an approximation is shown to be possible if an a priori bound is known for a fractional derivative of order greater than one. An algorithm is proposed for such a stable approximation and error estimates for the proposed algorithm are given. Under certain assumptions it is proved that this algorithm is best possible among all linear and nonlinear algorithms.
Create a lesson
Related papers
2-Morita Theory of E2-Algebras and Module Categories
Rongge Xu, Holiverse Yang
Multiscale Loop Vertex Expansion for Cumulants, the ϕ42 Model
Vincent Rivasseau
Quasi-polynomiality and N-point functions of single connected leaky completed Hurwitz numbers
Chongyu Wang, Chenglang Yang
Coupled stochastic variational principles for multiscale surface gravity waves -- Part I: theoretical framework
Etienne Mémin, Arnaud Debussche
The Sharp Spectral Transition for Almost Mathieu Operators via Alternating Resonances
Jiawei He, Xueyin Wang
Dynamical classical-field limit of Bosonic Gibbs states: Renormalized Hartree NLS correlations in 2D and 3D
Phan Thành Nam, Rongchan Zhu, Xiangchan Zhu