Papers
Topics
Authors
Recent
Search
2000 character limit reached

Discrete orthogonal polynomials as a tool for detection of small anomalies of time series: a case study of GPS final orbits

Published 1 Apr 2020 in math.NA and cs.NA | (2004.00414v1)

Abstract: In this paper, we show that the classical discrete orthogonal univariate polynomials (namely, Hahn polynomials on an equidistant lattice with unit weights) of sufficiently high degrees have extremely small values near the endpoints (we call this property as "rapid decay near the endpoints of the discrete lattice". We demonstrate the importance of the proved results applying polynomial least squares approximation for the detection of anomalous values in IGS final orbits for GPS and GLONASS satellites. We propose a numerically stable method for the construction of discrete orthogonal polynomials of high degrees. It allows one to reliably construct Hahn-Chebyshev polynomials using standard accuracy (double precision, 8-byte) on thousands of points, for degrees up to several hundred. A Julia implementation of the mentioned algorithms is available at https://github.com/sptsarev/high-deg-polynomial-fitting. These results seem to be new; their explanation in the framework of the well-known asymptotic theory of discrete orthogonal polynomials could not be found in the literature.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.