avar | R Documentation |
Computes the Allan Variance
avar(x, type = "mo")
x |
A |
type |
A |
The decomposition and the amount of time it takes to perform it depends on whether you are using the Tau Overlap or the Maximal Overlap.
av A list
that contains:
"clusters"The size of the cluster
"allan"The Allan variance
"errors"The error associated with the variance estimation.
Given N equally spaced samples with averaging time tau = n*tau_0, where n is an integer such that 1<= n <= N/2. Therefore, n is able to be selected from {n | n < floor(log2(N))} Then, M = N - 2n samples exist. The Maximal-overlap estimator is given by:
See PDF Manual
where
See PDF Manual
.
Given N equally spaced samples with averaging time tau = n*tau_0, where n is an integer such that 1<= n <= N/2. Therefore, n is able to be selected from {n | n < floor(log2(N))} Then, a sampling of m = ≤ft\lfloor {\frac{{N - 1}}{n}} \right\rfloor - 1 samples exist. The tau-overlap estimator is given by:
where See PDF Manual.
JJB
Long-Memory Processes, the Allan Variance and Wavelets, D. B. Percival and P. Guttorp
# Set seed for reproducibility set.seed(999) # Simulate time series N = 100000 ts = gen_gts(N, WN(sigma2 = 2) + RW(gamma2 = 1)) # Maximal overlap av_mat_mo = avar(ts, type = "mo") # Tau overlap av_mat_tau = avar(ts, type = "to")
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.