Preconditioned GAOR methods for solving weighted linear least squares problems
β Scribed by Xiaoxia Zhou; Yongzhong Song; Li Wang; Qingsheng Liu
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 462 KB
- Volume
- 224
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
a b s t r a c t
In this paper, we present the preconditioned generalized accelerated overrelaxation (GAOR) method for solving linear systems based on a class of weighted linear least square problems. Two kinds of preconditioning are proposed, and each one contains three preconditioners. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the convergence rate of the preconditioned GAOR methods is indeed better than the rate of the original method, whenever the original method is convergent. Finally, a numerical example is presented in order to confirm these theoretical results.
π SIMILAR VOLUMES
We propose to precondition the GMRES method by using the incomplete Givens orthogonalization (IGO) method for the solution of large sparse linear least-squares problems. Theoretical analysis shows that the preconditioner satisfies the sufficient condition that can guarantee that the preconditioned G
In this paper, we propose some least-squares finite element procedures for linear and nonlinear parabolic equations based on first-order systems. By selecting the least-squares functional properly each proposed procedure can be split into two independent symmetric positive definite sub-procedures, o
In this paper we consider an underdetermined system of equations Lx Ο b so m Ο½ n. However, the methods given We present an iterative method of preconditioned Krylov type for the solution of large least squares problems. We prove that the in Section 3 can also be used for overdetermined systems. me