Searcharxiv⌕ Search

arXiv subjects

Alexander Sidorenko

Publications and source records attributed to Alexander Sidorenko.

22 records · Page 2Linked to original sources

Minimum bias multiple taper spectral estimation

Two families of orthonormal tapers are proposed for multi-taper spectral analysis: minimum bias tapers, and sinusoidal tapers $\{ \bf{v}^{(k)}\}$, where $v_n^{(k)}=\sqrt{\frac{2}{N+1}}\sin\frac{πkn}{N+1}$, and $N$ is the number of points. The resulting sinusoidal multitaper spectral estimate is $\hat{S}(f)=\frac{1}{2K(N+1)} \sum_{j=1}^K |y(f+\frac{j}{2N+2}) -y(f-\frac{j}{2N+2})|^2$, where $y(f)$ is the Fourier transform of the stationary time series, $S(f)$ is the spectral density, and $K$ is the number of tapers. For fixed $j$, the sinusoidal tapers converge to the minimum bias tapers like $1/N$. Since the sinusoidal tapers have analytic expressions, no numerical eigenvalue decomposition is necessary. Both the minimum bias and sinusoidal tapers have no additional parameter for the spectral bandwidth. The bandwidth of the $j$th taper is simply $\frac{1}{N}$ centered about the frequencies $\frac{\pm j}{2N+2}$. Thus the bandwidth of the multitaper spectral estimate can be adjusted locally by simply adding or deleting tapers. The band limited spectral concentration, $\int_{-w}^w |V(f)|^2 df$, of both the minimum bias and sinusoidal tapers is very close to the optimal concentration achieved by the Slepian tapers. In contrast, the Slepian tapers can have the local bias, $\int_{-1/2}^{1/2} f^2 |V(f)|^2 df$, much larger than of the minimum bias tapers and the sinusoidal tapers.

stat.ME↗

Optimal Boundary Kernels and Weightings for Local Polynomial Regression

Kernel smoothers are considered near the boundary of the interval. Kernels which minimize the expected mean square error are derived. These kernels are equivalent to using a linear weighting function in the local polynomial regression. It is shown that any kernel estimator that satisfies the moment conditions up to order $m$ is equivalent to a local polynomial regression of order $m$ with some non-negative weight function if and only if the kernel has at most $m$ sign changes. A fast algorithm is proposed for computing the kernel estimate in the boundary region for an arbitrary placement of data points.

stat.ME↗

Sufficient Conditions for a Linear Estimator to be a Local Polynomial Regression

It is shown that any linear estimator that satisfies the moment conditions up to order $p$ is equivalent to a local polynomial regression of order $p$ with some non-negative weight function if and only if the kernel has at most $p$ sign changes. If the data points are placed symmetrically about the estimation point, a linear weighting function is equivalent to the standard quadratic weighting function.

stat.ME↗

Adaptive Kernel Estimation of the Spectral Density with Boundary Kernel Analysis

A hybrid estimator of the log-spectral density of a stationary time series is proposed. First, a multiple taper estimate is performed, followed by kernel smoothing the log-multitaper estimate. This procedure reduces the expected mean square error by $({π^2 \over 4})^{.8}$ over simply smoothing the log tapered periodogram. The optimal number of tapers is $O(N^{8/15})$. A data adaptive implementation of a variable bandwidth kernel smoother is given. When the spectral density is discontinuous, one sided smoothing estimates are used.

stat.ME↗