On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems

DOI10.1016/j.rinam.2022.100240zbMath1490.65055OpenAlexW4210718082MaRDI QIDQ2668191

Zhonglu Lv, Wen-Di Bao, Weiguo Li, Fang Wang, Guoli Wu

Publication date: 3 March 2022

Published in: Results in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.rinam.2022.100240

zbMATH Keywords

overdetermined systemrandom samplingKaczmarz methodinconsistent linear systemsleast-squares solution

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items

Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems ⋮ Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems

Uses Software

• SparseMatrix
• AIR tools

Cites Work

• Unnamed Item
• A randomized Kaczmarz algorithm with exponential convergence
• Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
• On convergence rate of the randomized Kaczmarz method
• A note on convergence rate of randomized Kaczmarz method
• On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
• Correction to: ``Convergence rates for Kaczmarz-type algorithms
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• Randomized Extended Kaczmarz for Solving Least Squares
• The university of Florida sparse matrix collection
• Least-squares solution of overdetermined inconsistent linear systems using kaczmarz's relaxation