Chebyshev collocation methods for fast orbit determination
Cauchy problemChebyshev collocation methodEarth satelliteFourier-Chebyshev approximationimplicit finite difference schemeKepler ordinary differential equationnumerical experimentsPicard method
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Finite difference and finite volume methods for ordinary differential equations (65L12) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Orbital mechanics (70M20)
The goal of this paper is an application of the Chebyshev collocation method to numerical integration of the initial value problem for nonhomogeneous Kepler ordinary differential equation. The nonhomogenity term depends on the solution \(r\) and its time derivative denoted here by \(v\), but it is assumed to be a small perturbation of the homogeneous Kepler equation. The original equation is transformed to the so-called Dziobek-Brouwer form, which is more convenient for the applied numerical method. This numerical problem is related to determination of the orbit of the artificial Earth satellite; hence the long physical time computation should be done in relatively short computing time. In such situation a stable and fast solver is required. Following the ideas of \textit{C. W. Clenshaw} [Proc. Cambridge Philos. Soc. 53, 134-149 (1957; Zbl 0077.32503); J. Soc. Invest. Appl. Math., Ser. B, Numer. Anal. 1, 26-37 (1964; Zbl 0136.36303)], the authors propose to apply the method based on the Fourier-Chebyshev approximation of the right-hand-side of the equation. More exactly, the integral equation of the form \[ y(t)=y(t_k)+\int_{t_k}^tf(s,y(s))ds \] is replaced by the implicit finite difference scheme for the approximate value \(\widetilde y(t)\) of \(y(t)\) \[ \widetilde y(t)=y_k+\sum_{j=0}^n a_jT_j(x). \] Here \(x\in [-1,1]\) corresponds to the variable \(t\) and coefficients \(a_j\) depend on the Fourier coefficients of the function \(f\) computed approximately by means of the Gauss-Lobatto quadrature formulas, where knots are taken at extremal points of the Chebyshev polynomial of the first kind, \(T_{n-1}\). This method enables to compute densely the approximate solution. Since the scheme is implicit, iterations are necessary; the authors use the simple Picard method. The integration step can be taken very large, namely equal to the approximate period of the solution. Neither stability nor convergence theorems are given, however numerical experiments show the efficiency of this approach. The paper contains results of computations for \(n=22,32,40,70\).
- Modification of the Richardson-Panovsky methods for precise integration of satellite orbits.
- scientific article; zbMATH DE number 1617951
- A family of implicit Chebyshev methods for the numerical integration of second-order differential equations
- Multistep Numerical Methods Based on the Scheifele G-Functions with Application to Satellite Dynamics
- A family of embedded Runge-Kutta formulae
- A family of implicit Chebyshev methods for the numerical integration of second-order differential equations
- scientific article; zbMATH DE number 3126856 (Why is no real title available?)
- scientific article; zbMATH DE number 3671748 (Why is no real title available?)
- scientific article; zbMATH DE number 1117969 (Why is no real title available?)
- scientific article; zbMATH DE number 3245839 (Why is no real title available?)
- scientific article; zbMATH DE number 3343539 (Why is no real title available?)
- scientific article; zbMATH DE number 3183959 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Perturbations in rectangular coordinates by iteration
- Solving Ordinary Differential Equations I
- Some remarks on multivariate Chebyshev polynomials
- The solution of nonlinear ordinary differential equations in Chebyshev series
- Modification of the Richardson-Panovsky methods for precise integration of satellite orbits.
- Algorithms for the integration and derivation of Chebyshev series.
- A simple time domain collocation method to precisely search for the periodic orbits of satellite relative motion
- Characterization of low degree A-stable symmetric RK collocation methods
- Gauss meets Newton again: how to make Gauss orbit determination from two position vectors more efficient and robust with Newton-Raphson iterations
- Modifications of the method of variation of parameters
- Chebyshev spectral variational integrator and applications
- scientific article; zbMATH DE number 1617951 (Why is no real title available?)
- ODE solvers using band-limited approximations
- Bandlimited implicit Runge-Kutta integration for astrodynamics
- Chebyshev acceleration for SOR-like method
- On using Chebyshev polynomials for fitting SLR data of artificial satellites
- VSVO formulation of the Taylor method for the numerical solution of ODEs
- Performance of perturbation methods on orbit prediction
This page was built for publication: Chebyshev collocation methods for fast orbit determination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294300)
