๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Block SOR methods for rank-deficient least-squares problems

โœ Scribed by C.H. Santos; B.P.B. Silva; J.Y. Yuan

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
396 KB
Volume
100
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Symmetric block-SOR methods for rank-def
Symmetric block-SOR methods for rank-deficient least squares problems
โœ M.T. Darvishi; F. Khani; S. Hamedi-Nezhad; B. Zheng ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

In this article, we develop symmetric block successive overrelaxation (S-block-SOR) methods for finding the solution of the rank-deficient least squares problems. We propose an S2-block-SOR and an S3-block-SOR method for solving such problems and the convergence of these two methods is studied. The

Approximating minimum norm solutions of
Approximating minimum norm solutions of rank-deficient least squares problems
โœ Achiya Dax; Lars Eldรฉn ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 133 KB ๐Ÿ‘ 2 views

In this paper we consider the solution of linear least squares problems min x Ax -b 2 2 where the matrix A โˆˆ R mร—n is rank deficient. Put p = min{m, n}, let ฯƒ i , i = 1, 2, . . . , p, denote the singular values of A, and let u i and v i denote the corresponding left and right singular vectors. Then