Greedy Motzkin–Kaczmarz methods for solving linear systems

DOI10.1002/NLA.2429OpenAlexW3100567177MaRDI QIDQ5867166FDOQ5867166

Hanyu Li, Yanjun Zhang

Publication date: 12 September 2022

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.06687

Recommendations

• A new greedy Kaczmarz algorithm for the solution of very large linear systems
• A greedy block Kaczmarz algorithm for solving large-scale linear systems
• On greedy randomized Kaczmarz method for solving large sparse linear systems
• A Deterministic Kaczmarz Algorithm for Solving Linear Systems
• scientific article; zbMATH DE number 7295865
• On fast greedy block Kaczmarz methods for solving large consistent linear systems
• Publication:4207516
• Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
• On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
• Parametric greedy randomized Kaczmarz algorithm for solving large sparse linear systems

zbMATH Keywords

block methodgreedy randomized Kaczmarz methodgreedy randomized Motzkin-Kaczmarz methodgreedy selection rulemaximum distance rulemaximum residual rule

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cited In (7)

• Greedy randomized sampling nonlinear Kaczmarz methods
• Greedy capped nonlinear Kaczmarz methods
• A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
• Title not available (Why is that?)
• Splitting-based randomized iterative methods for solving indefinite least squares problem
• Randomized block subsampling Kaczmarz-Motzkin method
• A block-randomized stochastic method with importance sampling for CP tensor decomposition

This page was built for publication: Greedy Motzkin–Kaczmarz methods for solving linear systems

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