A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems

Yanjun Zhang and Hanyu Li

Applied Mathematics and Computation, 2021, vol. 410, issue C

Abstract: In this paper, combining count sketch and maximal weighted residual Kaczmarz method, we propose a fast randomized algorithm for highly overdetermined linear systems. Convergence analysis of the new algorithm is provided. Numerical experiments show that, for the same accuracy, our method behaves better in computing time compared with the maximal weighted residual Kaczmarz algorithm.

Keywords: Kaczmarz method; Count sketch; Iterative method; Linear systems (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005750
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:410:y:2021:i:c:s0096300321005750

DOI: 10.1016/j.amc.2021.126486

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 ().