A sketch-and-select Arnoldi process

06/06/2023
by   Stefan Güttel, et al.
0

A sketch-and-select Arnoldi process to generate a well-conditioned basis of a Krylov space is proposed. At each iteration the procedure utilizes randomized sketching to select a limited number of previously computed basis vectors to project out of the current basis vector. The computational cost grows linearly with the dimension of the Krylov basis. The subset selection problem for the projection step is approximately solved with a number of heuristic algorithms and greedy methods used in statistical learning and compressive sensing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2017

Compressive Statistical Learning with Random Feature Moments

We describe a general framework --compressive statistical learning-- for...
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/01/2020

Hybrid Projection Methods with Recycling for Inverse Problems

Iterative hybrid projection methods have proven to be very effective for...
research
05/04/2021

Online adaptive basis construction for nonlinear model reduction through local error optimization

The accuracy of the reduced-order model (ROM) mainly depends on the sele...
research
03/03/2023

An efficient algorithm for integer lattice reduction

A lattice of integers is the collection of all linear combinations of a ...
research
02/28/2022

On the Robustness of CountSketch to Adaptive Inputs

CountSketch is a popular dimensionality reduction technique that maps ve...
research
02/12/2020

Compressive Learning of Generative Networks

Generative networks implicitly approximate complex densities from their ...

Please sign up or login with your details

Forgot password? Click here to reset