Whittaker–Henderson smoothing

From testwiki
Revision as of 16:31, 26 February 2025 by imported>SdkbBot (Removed erroneous space and general fixes (task 1))
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description

Whittaker–Henderson smoothing or Whittaker–Henderson graduation is a digital filter that can be applied to a set of digital data points for the purpose of smoothing the data, that is, to increase the precision of the data without distorting the signal tendency. It was first introduced by Georg Bohlmann[1] (for order 1). E.T. Whittaker independently proposed the same idea in 1923[2] (for order 3). Whittaker–Henderson smoothing can be seen as P-Splines of degree 0. The special case of order 2 also goes under the name Hodrick–Prescott filter.

Mathematical Formulation

For a signal yi, i=1,,n, of equidistant steps, e.g. a time series with constant intervals, the Whittaker–Henderson smoothing of order p is the solution to the following penalized least squares problem:

x=argminx1,,xnin(yixi)2+λinp(Δxi)2,

with penalty parameter λ and difference operator Δ:

Δxi=xi+1xiΔ2xi=Δ(Δxi)=xi+22xi+1+xi

and so on.

References

Template:Reflist Template:Cite journal


Template:Math-stub

  1. Bohlmann, G., 1899. Ein ausgleichungsproblem. Nachrichten Gesellschaft Wissenschaften Gottingen, Math.-Phys. Klasse 260–271.
  2. Whittaker, E.T., 1923. On a new method of graduation. Proc. Edinburgh Math. Soc. 41, 63–75.