Chebyshev polynomials and least squares estimation based on one-dependent random variables
One-dependent random variables appear in several fields of statistical work, e.g. in time series analysis and sampling theory. We consider such random variables \(Y_ 1,...,Y_ k\), \(k\in {\mathbb{N}}\), with \(E(Y_ i)=\mu\), \(i\in \{1,...,k\}\), and regular tridiagonal covariance matrix \(\Sigma\). The real parameter \(\mu\) can be estimated by the method of least squares, which leads to the best linear unbiased estimator \({\hat \mu}{}_{opt}.\) We give representations of \({\hat \mu}{}_{opt}\) and V(\({\hat \mu}{}_{opt})\) in terms of Chebyshev polynomials, which turn out to be a helpful tool in the analysis of structure and properties of \({\hat \mu}{}_{opt}\). Using well-known relations, we give some more sum formulas and formulas concerning products of Chebyshev polynomials, which may also be of interest in other contexts.
- scientific article; zbMATH DE number 4203479 (Why is no real title available?)
- Maximum Likelihood Estimation of a Poisson Parameter in a Model of Equioverlapping Samples:A Simulation Study
- Explicit inverses of some tridiagonal matrices
- Determinant, inertia, and inverse of a class of irreducible tridiagonal matrices
- Relative efficiency of estimates and the use of Chebyshev polynomials in a model of pairwise overlapping samples
This page was built for publication: Chebyshev polynomials and least squares estimation based on one-dependent random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107936)