Supplementary projections for the acceleration of Kaczmarz algorithm

I. Pomparău and C. Popa

Applied Mathematics and Computation, 2014, vol. 232, issue C, 104-116

Abstract: When solving a linear least squares problem using the classical Kaczmarz solver, usually different accelerating techniques are employed. We study a method of adding to the original problem supplementary directions for projection as linear combinations of rows or columns. In order to conserve the sparsity pattern of the system matrix we propose an algorithm which computes an initial transformation via clustering based on the sparsity similarity. Numerical experiments show that, as the number of clusters is increased, the acceleration is decreased.

Keywords: Kaczmarz algorithm; Direct projection methods; Least squares problems; Accelerating convergence of iterative method; Conserving the sparsity pattern (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314001350
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:232:y:2014:i:c:p:104-116

DOI: 10.1016/j.amc.2014.01.098

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().