A Count Sketch Kaczmarz Method For Solving Large Overdetermined Linear Systems

04/06/2020
by   Yanjun Zhang, et al.
0

In this paper, combining count sketch and maximal weighted residual Kaczmarz method, we propose a fast randomized algorithm for large overdetermined linear systems. Convergence analysis of the new algorithm is provided. Numerical experiments show that, for the same accuracy, our method behaves better in computing time compared with the state-of-the-art algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/01/2023

On greedy multi-step inertial randomized Kaczmarz method for solving linear systems

Recently, the multi-step inertial randomized Kaczmarz (MIRK) method for ...
research
07/15/2022

PLSS: A Projected Linear Systems Solver

We propose iterative projection methods for solving square or rectangula...
research
06/25/2021

Greedy Randomized and Maximal Weighted Residual Kaczmarz Methods with Oblique Projection

For solving large-scale consistent linear system, we combine two efficie...
research
06/21/2021

Efficient Inference via Universal LSH Kernel

Large machine learning models achieve unprecedented performance on vario...
research
11/24/2020

Effective and Sparse Count-Sketch via k-means clustering

Count-sketch is a popular matrix sketching algorithm that can produce a ...
research
06/24/2021

Efficient Tensor Contraction via Fast Count Sketch

Sketching uses randomized Hash functions for dimensionality reduction an...
research
02/01/2019

Compressing Gradient Optimizers via Count-Sketches

Many popular first-order optimization methods (e.g., Momentum, AdaGrad, ...

Please sign up or login with your details

Forgot password? Click here to reset