On the Covariance Matrix of Weighted Total Least-Squares Estimates

2016 ◽  
Vol 142 (3) ◽  
pp. 04015014 ◽  
Author(s):  
A. R. Amiri-Simkooei ◽  
F. Zangeneh-Nejad ◽  
J. Asgari
Author(s):  
Matthias Wurm

Abstract Especially in metrology and geodesy, but also in many other disciplines, the solution of overdetermined linear systems of the form Ax≈b with individual uncertainties not only in b but also in A is an important task. The problem is known in literature as weighted total least squares. In the most general case, correlations between the elements of [A,b] exist as well. The problem becomes more complicated and can—except for special cases—only be solved numerically. While the formulation of this problem and even its solution is straightforward, its implementation—when the focus is on reliability and computational costs—is not. In this paper, a robust, fast, and universal method for computing the solution of such linear systems as well as their covariance matrix is presented. The results were confirmed by applying the method to several special cases for which an analytical or numerical solution is available. If individual coefficients can be considered to be free of errors, this can be taken into account in a simple way. An implementation of the code in MATLAB is provided.


2012 ◽  
Vol 2 (2) ◽  
pp. 113-124 ◽  
Author(s):  
A. Amiri-Simkooei ◽  
S. Jazaeri

Weighted total least squares formulated by standard least squares theoryThis contribution presents a simple, attractive, and flexible formulation for the weighted total least squares (WTLS) problem. It is simple because it is based on the well-known standard least squares theory; it is attractive because it allows one to directly use the existing body of knowledge of the least squares theory; and it is flexible because it can be used to a broad field of applications in the error-invariable (EIV) models. Two empirical examples using real and simulated data are presented. The first example, a linear regression model, takes the covariance matrix of the coefficient matrix asQA=Qn⊗Qm, while the second example, a 2-D affine transformation, takes a general structure of the covariance matrixQA.The estimates for the unknown parameters along with their standard deviations of the estimates are obtained for the two examples. The results are shown to be identical to those obtained based on thenonlinearGauss-Helmert model (GHM). We aim to have an impartial evaluation of WTLS and GHM. We further explore the high potential capability of the presented formulation. One can simply obtain the covariance matrix of the WTLS estimates. In addition, one can generalize the orthogonal projectors of the standard least squares from which estimates for the residuals and observations (along with their covariance matrix), and the variance of the unit weight can directly be derived. Also, the constrained WTLS, variance component estimation for an EIV model, and the theory of reliability and data snooping can easily be established, which are in progress for future publications.


Author(s):  
Craig M. Shakarji ◽  
Vijay Srinivasan

We present elegant algorithms for fitting a plane, two parallel planes (corresponding to a slot or a slab) or many parallel planes in a total (orthogonal) least-squares sense to coordinate data that is weighted. Each of these problems is reduced to a simple 3×3 matrix eigenvalue/eigenvector problem or an equivalent singular value decomposition problem, which can be solved using reliable and readily available commercial software. These methods were numerically verified by comparing them with brute-force minimization searches. We demonstrate the need for such weighted total least-squares fitting in coordinate metrology to support new and emerging tolerancing standards, for instance, ISO 14405-1:2010. The widespread practice of unweighted fitting works well enough when point sampling is controlled and can be made uniform (e.g., using a discrete point contact Coordinate Measuring Machine). However, we demonstrate that nonuniformly sampled points (arising from many new measurement technologies) coupled with unweighted least-squares fitting can lead to erroneous results. When needed, the algorithms presented also solve the unweighted cases simply by assigning the value one to each weight. We additionally prove convergence from the discrete to continuous cases of least-squares fitting as the point sampling becomes dense.


2015 ◽  
Vol 141 (2) ◽  
pp. 04014013 ◽  
Author(s):  
Xiaohua Tong ◽  
Yanmin Jin ◽  
Songlin Zhang ◽  
Lingyun Li ◽  
Shijie Liu

Sign in / Sign up

Export Citation Format

Share Document