Fast computation and practical use of amplitudes at non-Fourier frequencies

نویسندگان

چکیده

Abstract In this paper, it is shown that the performance of various frequency-domain estimators memory parameter can be boosted by inclusion non-Fourier frequencies in addition to regular Fourier frequencies. A fast two-stage algorithm for efficient computation amplitudes at these additional presented. first stage, naïve sine and cosine transforms are computed with a modified version Fast Transform. second amended taking violation standard orthogonality conditions into account. considerable number auxiliary quantities, which required do not depend on data therefore only need once. The superior (in terms root-mean-square error) based also demonstrated extensive simulations. Finally, empirical results obtained applying financial high-frequency show significant long-range dependence present absolute intraday returns but signed returns.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Computation of Partial Fourier Transforms

We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal compl...

متن کامل

Fast Computation of Fourier Integral Operators

We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically a so-called Fourier integral operator (FIO) of the form ∫ ea(x, ξ) f̂(ξ)dξ at points given on a Cartesian grid. Here, ξ is a frequency variable, f̂(ξ) is the F...

متن کامل

Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms

The bottleneck of micromagnetic simulations is the computation of the long-ranged magnetostatic fields. This can be tackled on regular N-node grids with Fast Fourier Transforms in time N logN , whereas the geometrically more versatile finite element methods (FEM) are bounded to N in the best case. We report the implementation of a Non-uniform Fast Fourier Transform algorithm which brings a N lo...

متن کامل

Fast wave computation via Fourier integral operators

This paper presents a numerical method for “time upscaling” wave equations, i.e., performing time steps not limited by the Courant-Friedrichs-Lewy (CFL) condition. The proposed method leverages recent work on fast algorithms for pseudodifferential and Fourier integral operators (FIO). This algorithmic approach is not asymptotic: it is shown how to construct an exact FIO propagator by 1) solving...

متن کامل

The Periodogram at the Fourier Frequencies 1

In the time series literature one can often nd the claim that the periodogram ordinates of an iid sequence at the Fourier frequencies behave like an iid standard exponential sequence. We review some results about functions of these periodogram ordinates, including the convergence of extremes, point processes, the empirical distribution function and the empirical process. We show when the analog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2021

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-020-01061-4