For the mixed forward, central finite difference, and backward derivative regularizer on , with dividing points and , the overlap multiplicity bound for piecewise difference operators has . On the middle interval, the error kernel is for , with L1 norm . Young's convolution inequality bounds that part of the bias by . If the two outer intervals together have squared error at most , combining the three pieces gives the displayed estimate for and . Interpreting as the inverse of the Volterra integration operator requires the range of the Volterra integration operator boundary condition .
Differentiation by one-sided difference quotients Created 2026-10-06 Updated 2026-10-14
On use the forward difference and on the backward difference, with . This defines a bounded linear operator on and . For in the range of the Volterra integration operator, these differences are local averages of and converge to in by continuity of translations. Hence gives a linear regularization of differentiation. No pointwise evaluation of an arbitrary equivalence class is needed: translated functions are defined almost everywhere.
Substitution into the Tikhonov regularization series gives an explicit reconstruction for every :
Equivalently the summand is . The Tikhonov stability bound makes the series converge in for every positive . It suppresses high-frequency components of unstable differentiation, rather than differentiating arbitrary noisy data pointwise.
The range of the Volterra integration operator is . On exactly these data, and the series converges to as . For arbitrary data outside that range, a finite regularized solution still exists, but a finite-norm unregularized solution need not exist. This is Spectral Tikhonov differentiation for the Volterra operator.
The Volterra integration operator is injective and has dense range. Its range of the Volterra integration operator is , and its Moore–Penrose inverse of an operator is differentiation on this domain. Thus the error estimate for implicitly requires , in addition to the printed assumption. For an arbitrary function the same calculation bounds error against , but that function need not be in .
Put , and . The three stencils are forward, central finite differences, and backward on , and , respectively. All shifted evaluation points lie in . For , apply and change variables in each of the six evaluation terms. The resulting integration intervals are
Pair with , with , and the two middle intervals. Each pair has disjoint interiors, so almost every point is counted at most three times. This overlap multiplicity bound for piecewise difference operators proves
For the bias on the middle interval, write the central finite difference as an average of . The fundamental theorem of calculus gives
where . Extend by zero to the real line. Young's convolution inequality bounds the middle-interval error by . Combining its squared error with the supplied outer-interval estimate gives the central-difference noise-bias bound
The triangle inequality and the operator norm estimate now give
For , balancing noise and approximation bias minimizes this upper bound at
for sufficiently small that . Capping the parameter at supplies an admissible rule for all positive noise levels. More generally, and suffice; avoids needing or dividing by .
To prove convergence for every admissible datum, not just data, let with and extend by zero. Each stencil is a forward, centred or backward average of . Translation continuity in Lp makes each averaged difference from tend to zero in . Restricting those three bounds to their respective intervals proves . The noise-bias decomposition for linear regularization, with , finishes the convergent regularization of an inverse problem.
The range of the Volterra integration operator is , using the representative of a Sobolev space element that is an absolutely continuous function. Indeed has weak derivative and zero initial trace; conversely the fundamental theorem of calculus reconstructs such a from its derivative. This range contains smooth compactly supported functions and is dense in .
The given step is in , and its value at the single midpoint is immaterial. It cannot be the image of an function: such an image is continuous, whereas no continuous representative agrees almost everywhere with zero on the left half and one on the right half. Its distributional derivative is a Dirac delta distribution, not an function. Thus
For a direct approximation, replace the jump by a linear ramp of width centered at . Each ramp starts at zero and has an derivative, so lies in the range, while its squared error is . Its derivative norm is , illustrating unstable differentiation.
The supplied SVD gives , or more simply . Since but , the Moore–Penrose inverse is discontinuous. Its domain is the dense, nonclosed range above, and there it is the weak derivative.
The Tikhonov regularization of the Volterra integration operator replaces the unbounded differentiation gain by . The series converges in for every datum and . On the range of the Volterra integration operator, it converges to the weak derivative of the datum as . No pointwise differentiation of arbitrary noisy L2 space data is required.