In this paper an introduction of the moving least squares approach is presented in the context of data approximation and interpolation problems in Geodesy.An application of this method is presented for geoid height ap...In this paper an introduction of the moving least squares approach is presented in the context of data approximation and interpolation problems in Geodesy.An application of this method is presented for geoid height approximation and interpolation using different polynomial basis functions for the approximant and interpolant,respectively,in a regular grid of geoid height data in the region 16.0417°≤φ≤47.9583°and 36.0417°≤λ≤69.9582°,with increment 0.0833°in both latitudal and longitudal directions.The results of approximation and interpolation are then compared with the geoid height data from GPS-Levelling approach.Using the standard deviation of the difference of the results,it is shown that the planar interpolant,with reciprocal of distance as weight function,is the best choice in this local approximation and interpolation problem.展开更多
This paper is aimed at the derivation of a discrete data smoothing function for the discrete Dirichlet condition in a regular grid on the surface of a spheroid.The method employed here is the local L^2-seminorm minimi...This paper is aimed at the derivation of a discrete data smoothing function for the discrete Dirichlet condition in a regular grid on the surface of a spheroid.The method employed here is the local L^2-seminorm minimization,through Euler-Lagrange method,for the Beltrami operator.The method results in a weighted average of the surrounding points in a te mplate based on the first order Taylor expansion of the unknown function under consideration.The coefficients of the weighted average are calculated and used to smooth the Geoid height data in Iran,derived from the EGM2008 geopotential model.展开更多
The objectives of this paper are twofold:(1) to present a new method of approximation such that the function and some of its derivatives are simultaneously approximated;and(2) to investigate the potential applications...The objectives of this paper are twofold:(1) to present a new method of approximation such that the function and some of its derivatives are simultaneously approximated;and(2) to investigate the potential applications of this new method in the field of satellite geodesy by deriving a numerical solver of ordinary differential equations. To fulfill both the objectives, Sobolev polynomials are used. Explicit formulas for these polynomials are presented. A quadrature rule is derived based on the explicit forms of these polynomials. Solution of first order ordinary differential equations is presented based on the numerical integration method by the new quadrature rule. To present the applications of the results, three problems are investigated in the field of satellite geodesy. In the first application, orbit propagated by the numerical solution of orbital equations is compared with the Keplerian motion. It is shown that the new method for solving ordinary differential equations can be used alongside any other method, including the adaptive Runge-Kutta and Adams-Bashforth-Moulton integration methods. The comparison of this new method with the adaptive Runge-Kutta, Adams-Bashforth-Moulton, and the powerful and newly established adaptive Gaussian numerical integration methods reveals that it is at least 580, 666667, and72 times more accurate than the mentioned methods, respectively, in any given absolute tolerance and time increment. The method is fast, stable, consistent, and capable of handling high accuracy, even with large time increment and low absolute tolerance, which is shown in this application. In the second application, the Gravity Recovery and Climate Experiment(GRACE) satellites’ orbits are propagated using both the Ensemble Kalman Filter(EnKF) with stochastic updates and smoothing for the position and the Sobolev numerical integration. The orbits are then compared with the observed positions of the satellites. It is shown that the Sobolev polynomials work better in this problem, being more than 2 times more accurate. In the third application, the precision orbit determination problem for the Low Earth Orbit(LEO) CubeSats is investigated in the reduced dynamic form. A case study is presented for a pico-nano CubeSat in China. It is shown that the reduced dynamic orbit is approximately 32 percent more accurate than either of the kinematic or static Precise Point Positioning(PPP),representing a maximum error of 3.4 cm, with respect to the observation of the ground tracking stations.展开更多
文摘In this paper an introduction of the moving least squares approach is presented in the context of data approximation and interpolation problems in Geodesy.An application of this method is presented for geoid height approximation and interpolation using different polynomial basis functions for the approximant and interpolant,respectively,in a regular grid of geoid height data in the region 16.0417°≤φ≤47.9583°and 36.0417°≤λ≤69.9582°,with increment 0.0833°in both latitudal and longitudal directions.The results of approximation and interpolation are then compared with the geoid height data from GPS-Levelling approach.Using the standard deviation of the difference of the results,it is shown that the planar interpolant,with reciprocal of distance as weight function,is the best choice in this local approximation and interpolation problem.
文摘This paper is aimed at the derivation of a discrete data smoothing function for the discrete Dirichlet condition in a regular grid on the surface of a spheroid.The method employed here is the local L^2-seminorm minimization,through Euler-Lagrange method,for the Beltrami operator.The method results in a weighted average of the surrounding points in a te mplate based on the first order Taylor expansion of the unknown function under consideration.The coefficients of the weighted average are calculated and used to smooth the Geoid height data in Iran,derived from the EGM2008 geopotential model.
文摘The objectives of this paper are twofold:(1) to present a new method of approximation such that the function and some of its derivatives are simultaneously approximated;and(2) to investigate the potential applications of this new method in the field of satellite geodesy by deriving a numerical solver of ordinary differential equations. To fulfill both the objectives, Sobolev polynomials are used. Explicit formulas for these polynomials are presented. A quadrature rule is derived based on the explicit forms of these polynomials. Solution of first order ordinary differential equations is presented based on the numerical integration method by the new quadrature rule. To present the applications of the results, three problems are investigated in the field of satellite geodesy. In the first application, orbit propagated by the numerical solution of orbital equations is compared with the Keplerian motion. It is shown that the new method for solving ordinary differential equations can be used alongside any other method, including the adaptive Runge-Kutta and Adams-Bashforth-Moulton integration methods. The comparison of this new method with the adaptive Runge-Kutta, Adams-Bashforth-Moulton, and the powerful and newly established adaptive Gaussian numerical integration methods reveals that it is at least 580, 666667, and72 times more accurate than the mentioned methods, respectively, in any given absolute tolerance and time increment. The method is fast, stable, consistent, and capable of handling high accuracy, even with large time increment and low absolute tolerance, which is shown in this application. In the second application, the Gravity Recovery and Climate Experiment(GRACE) satellites’ orbits are propagated using both the Ensemble Kalman Filter(EnKF) with stochastic updates and smoothing for the position and the Sobolev numerical integration. The orbits are then compared with the observed positions of the satellites. It is shown that the Sobolev polynomials work better in this problem, being more than 2 times more accurate. In the third application, the precision orbit determination problem for the Low Earth Orbit(LEO) CubeSats is investigated in the reduced dynamic form. A case study is presented for a pico-nano CubeSat in China. It is shown that the reduced dynamic orbit is approximately 32 percent more accurate than either of the kinematic or static Precise Point Positioning(PPP),representing a maximum error of 3.4 cm, with respect to the observation of the ground tracking stations.