Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Center strategies for universal geodetic transformations: modified iteration policy and two alternative models

View through CrossRef
Although centralized coordinates are applied in geodetic coordinate transformations implicitly or explicitly, the centering strategy has not been comprehensively investigated from the theoretical perspective. We rigorously model and extend the empirically used three center strategies based on different models:Original model: Based on the partition representations of the solution, we propose a modified iteration policy, which reduces the parameter number and improves numerical stability during iteration. Also, its simplified version is analyzed when the cofactor matrix has the Kronecker product structures. It can be regarded as the extension of the work of Teunissen, since we essentially follow the same idea of partitioning the transformation parameters and the translation parameters, but more general covariance matrix structures are investigated in our consideration. Shifting model: With the partitioned solution forms, we prove the estimated transformation matrix and the residual vector are translational invariant. For iteration, with the classical iteration policy, the shifts should be chosen properly; with the modified iteration policy, there is no restriction since it is numerically equivalent to the original model. In addition, this model shows the feasibility of conducting the adjustment with the centralized coordinates and the original stochastic model. Translation elimination model: By multiplying the transformation relation with a specific matrix from both sides, we formulate the translation elimination model with the coordinates centralized and the translation parameters eliminated. With this model reduction, the covariance matrix has also been transformed since the observation equations are comprised of coordinate combinations. In addition, Leick’s model reduction strategy is a special case of this model, which is conducted by subtracting one particular observation equation from the remaining equations.  Test computations with different weight structures show the validity of these strategies.
Title: Center strategies for universal geodetic transformations: modified iteration policy and two alternative models
Description:
Although centralized coordinates are applied in geodetic coordinate transformations implicitly or explicitly, the centering strategy has not been comprehensively investigated from the theoretical perspective.
We rigorously model and extend the empirically used three center strategies based on different models:Original model: Based on the partition representations of the solution, we propose a modified iteration policy, which reduces the parameter number and improves numerical stability during iteration.
Also, its simplified version is analyzed when the cofactor matrix has the Kronecker product structures.
It can be regarded as the extension of the work of Teunissen, since we essentially follow the same idea of partitioning the transformation parameters and the translation parameters, but more general covariance matrix structures are investigated in our consideration.
Shifting model: With the partitioned solution forms, we prove the estimated transformation matrix and the residual vector are translational invariant.
For iteration, with the classical iteration policy, the shifts should be chosen properly; with the modified iteration policy, there is no restriction since it is numerically equivalent to the original model.
In addition, this model shows the feasibility of conducting the adjustment with the centralized coordinates and the original stochastic model.
Translation elimination model: By multiplying the transformation relation with a specific matrix from both sides, we formulate the translation elimination model with the coordinates centralized and the translation parameters eliminated.
With this model reduction, the covariance matrix has also been transformed since the observation equations are comprised of coordinate combinations.
In addition, Leick’s model reduction strategy is a special case of this model, which is conducted by subtracting one particular observation equation from the remaining equations.
  Test computations with different weight structures show the validity of these strategies.

Related Results

The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The...
Evaluating the Science to Inform the Physical Activity Guidelines for Americans Midcourse Report
Evaluating the Science to Inform the Physical Activity Guidelines for Americans Midcourse Report
Abstract The Physical Activity Guidelines for Americans (Guidelines) advises older adults to be as active as possible. Yet, despite the well documented benefits of physical a...
The computational magic of the ventral stream
The computational magic of the ventral stream
AbstractI argue that the sample complexity of (biological, feedforward) object recognition is mostly due to geometric image transformations and conjecture that a main goal of the v...
Global Geodetic Observing System
Global Geodetic Observing System
<p>The Global Geodetic Observing System (GGOS) of the International Association of Geodesy (IAG) provides the basis on which future advances in geosciences can be bui...
Geodetic Precession of the Sun, Solar System Planets, and their Satellites
Geodetic Precession of the Sun, Solar System Planets, and their Satellites
Abstract The effect of the geodetic precession is the most significant relativistic effect in the rotation of celestial bodies. In this article, the new geodetic pre...
The edge-to-edge geodetic domination number of a graph
The edge-to-edge geodetic domination number of a graph
Let G = (V, E) be a connected graph with at least three vertices. A set S Í E is called an edge-to-edge geodetic dominating set of G if S is both an edge-to-edge geodetic set of G ...
Control Points Selection based on Maximum External Reliability for Designing Geodetic Networks
Control Points Selection based on Maximum External Reliability for Designing Geodetic Networks
Geodetic networks are essential for most geodetic, geodynamics and civil projects, such as monitoring the position and deformation of man-made structures, monitoring the crustal de...
Inclusion of the Local Geodetic Network in the National Geodetic Network
Inclusion of the Local Geodetic Network in the National Geodetic Network
Abstract The geodetic points that form the national geodetic network cover large areas, and the accuracy of their determination is a function of the distances betwee...

Back to Top