Compression of Ephemerides by Discrete Chebyshev Approximations.

Abstract

Polynomial representations of astronomical ephemerides are usually derived from discrete least-squares approximations. Ideally, to ensure a uniform distribution of the error, one should aim at a continuous Chebyshev approximation. This is feasible when the ephemeris is generated from a literal (analytical or semianalytical) development. But a discrete Chebyshev approximation is a realistic compromise. Application to the moon and geosynchronous satellites has given good results. On the whole, long ranges (several times the sidereal period) may be covered by polynomials of degree 30 to 50 with a moderate error. A low-degree approximation over half the period usually delivers a high accuracy. Gibbs' phenomena, i.e. rapid oscillations of increasing amplitudes in the error curve at both ends of the approximation interval, are of course absent, contrary to what usually happens in a least-squares approximation. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 04, 1979
Accession Number
ADA063376

Entities

People

  • Andre Deprit
  • Henry Pickard
  • Walter Poplarchek

Organizations

  • United States Naval Research Laboratory

Tags

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Artificial Satellites
  • Cartesian Coordinates
  • Chebyshev Approximations
  • Chebyshev Polynomials
  • Computer Programming
  • Coordinate Systems
  • Ephemerides
  • Geosynchronous Satellites
  • Grids
  • Latitude
  • Longitude
  • Military Research
  • Navigation Satellites
  • Satellite Orbits
  • Space Systems

Readers

  • Space Exploration and Orbital Mechanics.
  • Statistical inference.
  • Systems Analysis and Design

Technology Areas

  • Space
  • Space - Orbital Debris