BTTB preconditioners for BTTB least squares problems
نویسندگان
چکیده
منابع مشابه
Enhanced Preconditioners for Large Sparse Least Squares Problems
Solving the normal equation systems arising from least-squares problems can be challenging because these systems are often very ill-conditioned. Though the use of iterative methods is appealing for very large problems of this type, preconditioning remains a stumbling block. In this paper we address this issue and describe a number of precondi-tioning strategies. In particular, we discuss a tech...
متن کاملPreconditioners for Least Squares Problems by Lu Factorization
Iterative methods are often suitable for solving least-squares problems minkAx bk2 , where A 2 R n is large and sparse. The use of the conjugate gradient method with a nonsingular square submatrix A1 2 R n of A as preconditioner was first suggested by Läuchli in 1961. This conjugate gradient method has recently been extended by Yuan to generalized least-squares problems. In this paper we consid...
متن کاملNew IMGS-based Preconditioners for Least Squares Problems
Convergence acceleration by preconditioning is usually essential when solving the standard least squares problems by an iterative method. IMGS, is an incomplete modiied version of Gram-Schmidt orthogonalization to obtain an incomplete orthogonal factorization pre-conditioner M = R, where A = Q R + E is an approximation of a QR factorization, Q is an orthogonal matrix and R is upper triangular m...
متن کاملLinear Least Squares Problems
A fundamental task in scientific computing is to estimate parameters in a mathematical model from collected data which are subject to errors. The influence of the errors can be reduced by using a greater number of data than the number of unknowns. If the model is linear, the resulting problem is then to “solve” an in general inconsistent linear system Ax = b, where A ∈ Rm×n and m ≥ n. In other ...
متن کاملLeast Squares Problems
Here we solve linear systems Ax = b that do not have a solution. If b is not in the column space of A, there is no x such that Ax = b. The best we can do is to find a vector y that brings left and right hand side of the linear system as close as possible, in other words y is chosen to make the distance between Ay and b as small as possible. That is, we want to minimize the distance ‖Ax − b‖2 ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.10.035