26
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

Projections and preconditioning for inconsistent least-squares problems

&
Pages 599-616 | Received 08 Jan 2001, Published online: 23 May 2012
 

Abstract

In this paper we describe two iterative algorithms for the numerical solution of linear least-squares problems. They are based on a combination between an extension of the classical Kaczmarzs projections method (Popa [5]) and an approximate orthogonalization technique due to Kovarik. We prove that both new algorithms converge to any solution of an inconsistent and rank-defficient least-squares problem (with respect to the choice of the initial approxi-mation), the convergence being much faster than for the classical Kaczmarz - like methods. Some numerical experiments on a first kind integral equation are described.

AMS Subject Classifications:

C.R. Category:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.