Residual Tracking and Stopping for Iterative Random Sketching

01/15/2022
by   Nathaniel Pritchard, et al.
0

Iterative random sketching (IRS) offers a computationally expedient approach to solving linear systems. However, IRS' benefits can only be realized if the procedure can be appropriately tracked and stopped – otherwise, the algorithm may stop before the desired accuracy is achieved, or it may run longer than necessary. Unfortunately, IRS solvers cannot access the residual norm without undermining their computational efficiency. While iterative random sketching solvers have access to noisy estimates of the residual, such estimates turn out to be insufficient to generate accurate estimates and confidence bounds for the true residual. Thus, in this work, we propose a moving average estimator for the system's residual, and rigorously develop practical uncertainty sets for our estimator. We then demonstrate the accuracy of our methods on a number of linear systems problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2021

Cross-interactive residual smoothing for global and block Lanczos-type solvers for linear systems with multiple right-hand sides

Global and block Krylov subspace methods are efficient iterative solvers...
research
10/08/2018

Probabilistic Linear Solvers: A Unifying View

Several recent works have developed a new, probabilistic interpretation ...
research
12/01/2020

Deep Residual Network Empowered Channel Estimation for IRS-Assisted Multi-User Communication Systems

Channel estimation is of great importance in realizing practical intelli...
research
05/18/2023

Stopping Criteria for the Conjugate Gradient Algorithm in High-Order Finite Element Methods

We introduce three new stopping criteria that balance algebraic and disc...
research
07/23/2021

Error Estimates for Neural Network Solutions of Partial Differential Equations

We develop an error estimator for neural network approximations of PDEs....
research
10/07/2019

BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property

We introduce an iterative method named BiLQ for solving general square l...

Please sign up or login with your details

Forgot password? Click here to reset