Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
type: Item
instance of: scholarly article
title: Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
author: Yanyan Li
published in: Computational and Applied Mathematics
publication date: 2022-10-14T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 15A06
Mathematics Subject Classification ID: 62H15
zbMATH DE Number: 7601625
zbMATH Keywords: linear systems
zbMATH Keywords: Kaczmarz method
zbMATH Keywords: randomized Kaczmarz method
zbMATH Keywords: greedy randomized Kaczmarz method
zbMATH Keywords: simple random sampling
describes a project that uses: SparseMatrix
describes a project that uses: Statistics Toolbox
describes a project that uses: AIR tools
describes a project that uses: SuiteSparse
MaRDI profile type: Publication
full work available at URL: s40314-022-02044-5
OpenAlex ID: W4298125644
cites work: Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
cites work: Matrix Analysis and Computations
cites work: On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems
cites work: On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems
cites work: On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
cites work: On convergence rate of the randomized Kaczmarz method
cites work: On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems
cites work: Probability and Statistics for Computer Scientists
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: The university of Florida sparse matrix collection
cites work: A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
cites work: Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
cites work: Randomized Extended Average Block Kaczmarz for Solving Least Squares
cites work: Randomized double and triple Kaczmarz for solving extended normal equations
cites work: Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
cites work: Q3172946
cites work: Randomized Iterative Methods for Linear Systems
cites work: AIR tools II: algebraic iterative reconstruction methods, improved implementation
cites work: Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
cites work: Fundamentals of Computerized Tomography
cites work: Image reconstruction from a small number of projections
cites work: Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
cites work: Q5768822
cites work: Variant of greedy randomized Kaczmarz for ridge regression
cites work: Sampling
cites work: On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
cites work: Randomized numerical linear algebra: Foundations and algorithms
cites work: Paved with good intentions: analysis of a randomized block Kaczmarz method
cites work: Parallel iterative methods for sparse linear systems
cites work: A randomized Kaczmarz algorithm with exponential convergence
cites work: Projection method for solving a singular system of linear equations and its applications
cites work: Q3191612
cites work: A new greedy Kaczmarz algorithm for the solution of very large linear systems
cites work: A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems
cites work: Block sampling Kaczmarz-Motzkin methods for consistent linear systems
DOI: 10.1007/S40314-022-02044-5
description: scientific article; zbMATH DE number 7601625