Parametric greedy randomized Kaczmarz algorithm for solving large sparse linear systems

DOI10.12066/J.ISSN.1007-2861.2151MaRDI QIDQ4996164zbMATH OpenFDO

Authors Yong Liu, Chuanqing Gu, Rongrong Cui

Publication date 1 July 2021

Full work available at URL https://doi.org/10.12066/J.ISSN.1007-2861.2151

zbMATH Keywords

greedy randomized Kaczmarz algorithmlarge sparse linear systemrelaxation parameter

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• scientific article; zbMATH DE number 7295865
• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems

Cited in

(7)

• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• Linear convergence of the randomized sparse Kaczmarz method
• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
• scientific article; zbMATH DE number 7295865 (Why is no real title available?)
• Greedy Motzkin–Kaczmarz methods for solving linear systems

This page was built for publication: Parametric greedy randomized Kaczmarz algorithm for solving large sparse linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996164)