Fast solving of weighted pairing least-squares systems
نویسندگان
چکیده
منابع مشابه
Fast solving of weighted pairing least-squares systems
This paper presents a generalization of the "weighted least-squares" (WLS), named "weighted pairing least-squares" (WPLS), which uses a rectangular weight matrix and is suitable for data alignment problems. Two fast solving methods, suitable for solving full rank systems as well as rank deficient systems, are studied. Computational experiments clearly show that the best method, in terms of spee...
متن کاملOn Solving Large-Scale Weighted Least Squares Problems
A sequence of least squares problems of the form miny kG 1=2 (A T y ? h)k2 where G is an n n positive deenite diagonal weight matrix, and A an m n (m < n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We discuss a technique for forming low-rank correction pre-conditioners for su...
متن کاملWeighted/Structured Total Least Squares problems and polynomial system solving
Weighted and Structured Total Least Squares (W/STLS) problems are generalizations of Total Least Squares with additional weighting and/or structure constraints. W/STLS are found at the heart of several mathematical engineering techniques, such as statistics and systems theory, and are typically solved by local optimization methods, having the drawback that one cannot guarantee global optimality...
متن کاملResurrecting Weighted Least Squares
This paper shows how asymptotically valid inference in regression models based on the weighted least squares (WLS) estimator can be obtained even when the model for reweighting the data is misspecified. Like the ordinary least squares estimator, the WLS estimator can be accompanied by heterokedasticty-consistent (HC) standard errors without knowledge of the functional form of conditional hetero...
متن کاملA Fast Algorithm for Solving Regularized Total Least Squares Problems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2009.01.016