The linear least squares problem, min x Ax-b 2 , is solved by applying a multisplitting(MS) strategy in which the system matrix is decomposed by columns into p blocks. The b and x vectors are partitioned consistently with the matrix decomposition. The global least squares problem is then replaced by
Solving the block–Toeplitz least-squares problem in parallel
✍ Scribed by P. Alonso; J. M. Badía; A. M. Vidal
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 231 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.883
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The implementation of a least-squares finite element method for solving the generalized stationary Stokes problem (i.e. the Stokes problem with an additional term αu in the motion equation, where α is a big parameter and u is the velocity vector function) is considered. The basis of this method is t
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