Randomized Orthogonal Projection Methods for Krylov Subspace Solvers

02/15/2023
by   Edouard Timsit, et al.
0

Randomized orthogonal projection methods (ROPMs) can be used to speed up the computation of Krylov subspace methods in various contexts. Through a theoretical and numerical investigation, we establish that these methods produce quasi-optimal approximations over the Krylov subspace. Our numerical experiments outline the convergence of ROPMs for all matrices in our test set, with occasional spikes, but overall with a convergence rate similar to that of standard OPMs.

READ FULL TEXT
research
06/14/2023

Inertial randomized Kaczmarz algorithms for solving coherent linear systems

In this paper, by regarding the two-subspace Kaczmarz method [20] as an ...
research
11/30/2017

RANSAC Algorithms for Subspace Recovery and Subspace Clustering

We consider the RANSAC algorithm in the context of subspace recovery and...
research
11/12/2021

Solving A System Of Linear Equations By Randomized Orthogonal Projections

Randomization has shown catalyzing effects in linear algebra with promis...
research
09/09/2023

A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation

We study a subspace constrained version of the randomized Kaczmarz algor...
research
12/13/2017

ROAST: Rapid Orthogonal Approximate Slepian Transform

In this paper, we provide a Rapid Orthogonal Approximate Slepian Transfo...
research
02/19/2020

Entrywise convergence of iterative methods for eigenproblems

Several problems in machine learning, statistics, and other fields rely ...
research
10/29/2021

Fast Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems

This paper develops a new class of algorithms for general linear systems...

Please sign up or login with your details

Forgot password? Click here to reset