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

06/01/2021
by   Kensuke Aihara, et al.
0

Global and block Krylov subspace methods are efficient iterative solvers for large sparse linear systems with multiple right-hand sides. However, global or block Lanczos-type solvers often exhibit large oscillations in the residual norms and may have a large residual gap relating to the loss of attainable accuracy of the approximations. Conventional residual smoothing schemes suppress the oscillations but do not aid in improving the attainable accuracy, whereas a novel residual smoothing scheme enables the attainable accuracy for single right-hand side Lanczos-type solvers to be improved. The underlying concept of this scheme is that the primary and smoothed sequences of the approximations and residuals influence one another, thereby avoiding the severe propagation of rounding errors. In the present study, we extend this cross-interactive residual smoothing to the case of solving linear systems with multiple right-hand sides. The resulting smoothed methods can reduce the residual gap with few additional costs compared to their original counterparts. We demonstrate the effectiveness of the proposed approach through rounding error analysis and numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2023

Gl-QFOM and Gl-QGMRES: two efficient algorithms for quaternion linear systems with multiple right-hand sides

In this paper, we propose the global quaternion full orthogonalization (...
research
01/15/2022

Residual Tracking and Stopping for Iterative Random Sketching

Iterative random sketching (IRS) offers a computationally expedient appr...
research
11/13/2021

GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems

We introduce an iterative method named GPMR for solving 2x2 block unsymm...
research
07/30/2019

Revisiting Performance of BiCGStab Methods for Solving Systems with Multiple Right-Hand Sides

The paper discusses the efficiency of the classical BiCGStab method and ...
research
01/28/2020

A survey of subspace recycling iterative methods

This survey concerns subspace recycling methods, a popular class of iter...
research
02/04/2020

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Block Krylov subspace methods (KSMs) comprise building blocks in many st...
research
09/06/2018

Analyzing and improving maximal attainable accuracy in the communication hiding pipelined BiCGStab method

Pipelined Krylov subspace methods avoid communication latency by reducin...

Please sign up or login with your details

Forgot password? Click here to reset