
A set of routines to operate on Hankel matrices stored in compact FFT-based form.
new.hmat(F, L = (N + 1)%/%2, circular = FALSE, wmask = NULL,
fmask = NULL, weights = NULL, fft.plan = NULL)
is.hmat(h)
hcols(h)
hrows(h)
hmatmul(hmat, v, transposed = FALSE)
hankel(X, L)
series to construct the trajectory matrix for.
internal hint argument, should be NULL in most cases
special parameters for shaped SSA case (see ssa
).
wmask
and fmask
are logical vectors, window and factor masks respectively.
weights
is integer vector which denotes hankel weights for array elements. If 'NULL',
parameters for simple 1D SSA case are used.
logical vector of one element, describes series topology. 'TRUE' means circularity by time.
the window length.
matrix to operate on.
logical, if 'TRUE' the multiplication is performed with the transposed matrix.
vector to multiply with.
series to construct the trajectory matrix for or matrix for hankelization
Fast Fourier Transform provides a very efficient matrix-vector multiplication routine for Hankel matrices. See the paper in 'References' for the details of the algorithm.
Korobeynikov, A. (2010) Computation- and space-efficient implementation of SSA. Statistics and Its Interface, Vol. 3, No. 3, Pp. 257-268
Rssa
for an overview of the package, as well as,
ssa
,
decompose
,
# Construct the Hankel trajectory matrix for 'co2' series
h <- new.hmat(co2, L = 10)
# Print number of columns and rows
print(hrows(h))
print(hcols(h))
Run the code above in your browser using DataLab