Analytical Solution of Linear Intersection Based on Jacobi Algorithm and its Comparison with Least Squares Solution

Article Preview

Abstract:

The paper introduces the Jacobi algorithm, and the Jacobi algorithm solution of linear intersection. A numerical cased is illustrated to validate the approach. The result shows the Jacobi algorithm solution is approximately equal to least squares (LS) solution, and needs no initial parameter value, and iteration. Thus, it is very important for the nonlinear adjustment, epically for the case that initial parameter value is unknown and hard to be obtained.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3452-3455

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] H.E. Zeng. New analytical approach to linear intersection and its application, Applied Mechanics and Materials, v 174-177, pp.1962-1965, (2012).

DOI: 10.4028/www.scientific.net/amm.174-177.1962

Google Scholar

[2] B Sturmfels. Introduction to resultants. AMS Proceedings of Symposia in Applied Mathematics, vol. 53, pp.25-39, (1998).

Google Scholar

[3] H.E. Zeng. Explicitly computing geodetic coordinates from Cartesian coordinates, Earth, Planets and Space, in press. (2013).

DOI: 10.5047/eps.2012.09.009

Google Scholar

[4] F.M. Lu, L. Li: Engineering surveying, (China Electric Power Press, Beijing, 2009).

Google Scholar