Relaxed greedy randomized Kaczmarz with signal averaging for solving doubly-noisy linear systems
Authors:
- Lu ZhangLZLu Zhang
- Jinchuan ZengJZJinchuan Zeng
- Hui ZhangHZHui Zhang
- 12 September 2026
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 493
Abstract
No abstract availableFunding Information
- China Scholarship Council (202406110004)
- National Natural Science Foundation of China (12471300)
- National University of Defense Technology (25-ZZCX-JDZ-14)
This publication has 37 references indexed in Scilit:
- Randomized Kaczmarz with tail averagingApplied and Computational Harmonic Analysis, 2025
- Quantile-based random sparse Kaczmarz for corrupted and noisy linear systemsNumerical Algorithms, 2024
- A weighted randomized sparse Kaczmarz method for solving linear systemsComputational and Applied Mathematics, 2022
- Greedy Motzkin–Kaczmarz methods for solving linear systemsNumerical Linear Algebra with Applications, 2021
- Sparse sampling Kaczmarz–Motzkin method with linear convergenceMathematical Methods in the Applied Sciences, 2021
- Randomized Kaczmarz with averagingBIT Numerical Mathematics, 2020
- Computed Tomography Reconstruction with Uncertain View Angles by Iteratively Updated Model DiscrepancyJournal of Mathematical Imaging and Vision, 2020
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systemsApplied Mathematics Letters, 2018
- A Randomized Kaczmarz Algorithm with Exponential ConvergenceJournal of Fourier Analysis and Applications, 2008
- Signal‐averaged electrocardiography: History, techniques, and clinical applicationsClinical Cardiology, 1991