Lehmer mean
From Wikipedia, the free encyclopedia
The Lehmer mean of a tuple x of positive real numbers is defined as:
- .
The Weighted Lehmer mean with respect to a tuple w of positive weights is defined as:
- .
The Lehmer mean is an alternative to power means for interpolating between minimum and maximum via arithmetic mean and harmonic mean.
Contents |
[edit] Properties
The derivative of is non-negative
thus this function is monotonic and the inequality
holds.
[edit] Special cases
- is the minimum of the elements of x.
- L0(x) is the harmonic mean.
- is the geometric mean.
- L1(x) is the arithmetic mean.
- L2(x) is the contraharmonic mean.
- is the maximum of the elements of x.
- Sketch of a proof: Let be the values which equal the maximum. Then
[edit] Applications
[edit] Signal processing
Like a power mean, a Lehmer mean serves a non-linear moving average which is shifted towards small signal values for small p and emphasizes big signal values for big p. Given an efficient implementation of a moving arithmetic mean called smooth you can implement a moving Lehmer mean according to the following Haskell code.
lehmerSmooth :: Floating a => ([a] -> [a]) -> a -> [a] -> [a] lehmerSmooth smooth p xs = zipWith (/) (smooth (map (**p) xs)) (smooth (map (**(p-1)) xs))
- For big p it can serve an envelope detector on a rectified signal.
- For small p it can serve an baseline detector on a mass spectrum.