We compute the differences of distance value between the adjacent computation points of seam removal, and find out the maximum from the differences.
Considering Bruns's formula, Stokes's integral formula for geoid determination is given as (Stokes, 1849; Heiskanen and Moritz, 1967), (12) where N is the geoid undulation, ψ is the spherical distance between the running and the computation points, R is the mean radius of the Earth, and S is the Stokes's kernel.
The second term in Eq. (13) includes the effect of the innermost zone which is computed separately because Stokes's kernel becomes infinite at the computation point.
Continuous models are much less costly from a computation point of view, while multibody models are usually believed to be more accurate.
where C is the DTE, N ind is the PITE, G is the Newtonian gravitational constant, ρ0 is the constant topographic density, H P is the orthometric height of the computation point, H is the height of the running point, σ is the surface integration element, and l o is the horizontal distance between the computation point and the running point.
From the raw data computation point of view, we proposed a new time domain method that consumes the duration of the procedure in an amount that is related with the resolution, pulse repetition frequency, and beamwidth of the antenna.
While both formulae use average topographic density, it should be noted that the classical Moritz formula is also based on the assumption that the distance between the computation and the running point is much greater than the height of the computation point (l o ≫ H P ), which implies that it can only be used effectively for the far-zone integration area (Martinec et al. 1996).
where R is the mean radius of the Earth, H P is the height of the computation point, H is the height of the running point, σ is the surface integration element, ρ0 is the average topographic density, and G is the Newtonian gravitational constant.
Therefore, during the past few years, much effort has been investigated to create new formulae for β k, which not only possesses global convergence for general functions but also is superior to original method from the computation point of view (see [8 17]).
If the repeats are exact, the problem can be easily solved from computation point of view.
From a computation point of view, if we choose a large enough transition graph, we will find every (continuous) organization.
