On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
type: Item
instance of: scholarly article
title: On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
author: Wen-Ting Wu
author: Zhong-Zhi Bai
published in: Applied Mathematics Letters
publication date: 2018-06-21T00:00:00Z
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6892553
zbMATH Keywords: system of linear equations
zbMATH Keywords: Kaczmarz method
zbMATH Keywords: randomized iteration
zbMATH Keywords: relaxation
zbMATH Keywords: convergence property
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
full work available at URL: j.aml.2018.03.008
OpenAlex ID: W2790998159
cites work: Q5768822
cites work: A randomized Kaczmarz algorithm with exponential convergence
cites work: On the Meany inequality with applications to convergence analysis of several row-action iteration methods
cites work: Projection methods for linear systems
cites work: Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods
cites work: On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
cites work: The university of Florida sparse matrix collection
Wikidata QID: Q130097248
DOI: 10.1016/J.AML.2018.03.008
description: scientific article; zbMATH DE number 6892553