Practical method to solve large least squares problems using Cholesky decomposition
In Geomatics, the method of least squares is commonly used to solve the systems of observation equations for a given number of unknowns. This method is basically implemented in case of having number observations larger than the number of unknowns. Implementing the large least squares problems would...
Main Author: | Ghadi Younis |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius Gediminas Technical University
2015-10-01
|
Series: | Geodesy and Cartography |
Subjects: | |
Online Access: | https://journals.vgtu.lt/index.php/GAC/article/view/2842 |
Similar Items
-
The least squares Bisymmetric solution of quaternion matrix equation AXB=C
by: Dong Wang, et al.
Published: (2021-09-01) -
An iterative algorithm for solving ill-conditioned linear least squares problems
by: Xingsheng Deng, et al.
Published: (2015-11-01) -
A comparison of algorithms for least squares estimates of parameters in the linear model
by: Ahn, Chul H
Published: (2011) -
LINEAR CHOLESKY DECOMPOSITION OF COVARIANCE MATRICES IN MIXED MODELS WITH CORRELATED RANDOM EFFECTS
by: Anasu Rabe, et al.
Published: (2019-12-01) -
Least-squares Hermitian problem of complex matrix equation ( A X B , C X D ) = ( E , F ) $(AXB,CXD)=(E,F)$
by: Peng Wang, et al.
Published: (2016-11-01)