Application of the singular decomposition of the matrix in solving incorrect geodetic problems

1Sohor, AR, 1Sidorov, IS, 1Smirnova, OM
1Lviv Polytechnic National University, Lviv, Ukraine
Space Sci. & Technol. 2024, 30 ;(3):71-79
https://doi.org/10.15407/knit2024.03.071
Publication Language: Ukrainian
Abstract: 
The most reliable method for solving linear equations of the least squares principle, which can be used to solve incorrect geodetic problems, is based on matrix factorization, which is called a singular expansion. Some other methods require less machine time and memory. However, they are less effective in taking into account the errors of the source information, rounding errors, and linear dependence.
           The methodology of such research is that for any matrix A and any two orthogonal matrices U and V, there is a matrix Σ, which is determined as Σ=UIAV. The idea of a singular decomposition is that by choosing the right matrices U and V, you can convert most elements of the matrix  Σ to zero and make it diagonal with non-negative elements.
           The novelty and relevance of scientific solutions lie in the feasibility of using a singular decomposition of the matrix to obtain linear equations of the least squares method, which can be used to solve incorrect geodetic problems.
The purpose of scientific research is to obtain a stable solution of parametric equations of corrections to the results of measurements in incorrect geodetic problems.
             Based on the performed research on the application of the singular decomposition method for solving incorrect geodetic problems, we can summarize the following results. A singular expansion of a real matrix  is any factorization  of a matrix with orthogonal columns , an orthogonal matrix , and a diagonal matrix , the elements of which are called singular numbers of the matrix , and the columns of matrices  and  - left and right singular vectors. If the matrix  has a full rank, then its solution will be unique and stable, which can be obtained by different methods. However, the method of singular decomposition, in contrast to other methods, makes it possible to solve problems with incomplete rank. Research shows that the method of solving normal equations by sequential exclusion of unknowns (Gaussian method), which is quite common in geodesy, does not provide stable solutions for poorly conditioned or incorrect geodetic problems. Therefore, in the case of unstable systems of equations, it is proposed to use the method of singular matrix decomposition, which in computational mathematics is called SVD. The SVD singular decomposition method makes it possible to obtain stable solutions to both stable and by nature unstable problems. This possibility to solve incorrect geodetic problems is associated with the application of some limit τ, the choice of which can be made by the relative errors of the matrix of coefficients of parametric equations of corrections  and the vector of results of geodetic measurements . Moreover, the solution of the system of normal equations obtained by the SVD method will have the shortest length.
           Thus, applying the apparatus of the singular decomposition of the matrix of coefficients of parametric equations of corrections to the results of geodetic measurements, we obtained new formulas for estimating the accuracy of the least squares method in solving incorrect geodetic problems. The derived formulas have a compact form and allow the easy calculation of elements  and  estimates of accuracy, almost ignoring the complex procedure of rotation of the matrix of coefficients of normal equations.
Keywords: accuracy assessment, incorrect geodesic problems, least squares method, matrix factorization, singular matrix decomposition
References: 

1. Abdi H., Williams L. J. (2010). Principal component analysis. Wiley Interdisciplinary Reviews: Computational Statistics, 2, 433-459.
https://doi.org/10.1002/wics.101

2. Berkooz G., Holmes Ph., Lumley J. L. (1993). The proper orthogonal decomposition in the analysis of turbulent flows. Annu. Rev. Fluid Mech., 25, 539-575.
https://doi.org/10.1146/annurev.fl.25.010193.002543

3. Forsythe G. E., Malcolm M. A., Moler C. B. (1977). Computer Methods for Mathematical Computations. Englewood Cliffs. N. J. Prentice-Hall.

4. Golub G. H., Reinsch C. (1971). Singular value decomposition and least squares solution. Handbook for Automatic Computation. Vol. II: Linear Algebra. Eds J. H. Wilkinson, C. Reinsch. Heidelberg: Springer.
https://doi.org/10.1007/978-3-642-86940-2_10

5. Gorban A. N., Kegl B., Wunsch D., Zinovyev A. Y. (Eds). (2007). Principal Manifolds for Data Visualisation and Dimension Reduction. Ser.: Lecture Notes in Computational Science and Engineering 58. Berlin-Heidelberg-New York: Springer, XXIV, 340 p. ISBN 978-3-540-73749-0.

6. Hyvdrinen A., Karhunen J., Oja E. (2001). Independent Component Analysis. A Volume in the Wiley Series on and Adaptive Learning Systems for Signal Processing, Communications, and Control. John Wiley & Sons, Inc., XVI+481 p. ISBN 0-471-40540-X.

7. Lawson C. L., Hanson R. J. (1974). Solving least squares problems. Englewood Cliffs. N. J. Prentice-Hall.

8. Scholz M., Fraunholz M., Selbig J. (2007). Nonlinear Principal Component Analysis: Neural Network Models and Applications. Eds. A. N. Gorban et al. LNCSE 58, Springer, ISBN 978-3-540-73749-0.

9. Stewart G. W. (1973). Introduction to Matrix Computation. New York: Academic Press.

10. Wilkinson J. H. (1965). The Algebraic Eigenvalue Problem. Oxford: Clarendon Press.