• Corpus ID: 235266252

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

@article{Aihara2021CrossinteractiveRS,
  title={Cross-interactive residual smoothing for global and block Lanczos-type solvers for linear systems with multiple right-hand sides},
  author={Kensuke Aihara and Akira Imakura and Keiichi Morikuni},
  journal={ArXiv},
  year={2021},
  volume={abs/2106.00284}
}
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 these oscillations but cannot improve the attainable accuracy, whereas a recent residual smoothing scheme… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 30 REFERENCES
BLOCK KRYLOV SPACE METHODS FOR LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES : AN
TLDR
A block version of the General Minimum Residual (GMRes) algorithm is discussed, discussing the deflation of right-hand sides in the case where the residuals are linearly dependent and their solution by sparse direct and iterative methods, Krylov subspaces, and preconditioning.
Variants of residual smoothing with a small residual gap
TLDR
This work reformulate the smoothing scheme from a novel perspective, and designs a variant of residual smoothing in which the primary and smoothed sequences influence each other, which results in a smaller residual gap, and thus a higher attainable accuracy.
Residual Smoothing Techniques: Do They Improve the Limiting Accuracy of Iterative Solvers?
Many iterative methods for solving linear systems, in particular the biconjugate gradient (BiCG) method and its “squared” version CGS (or BiCGS), produce often residuals whose norms decrease far from
OBLIQUE PROJECTION METHODS FOR LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES
TLDR
New Lanczos-based methods for solving nonsymmetric linear systems of equations with multiple right-hand sides based on global oblique projections of the initial residual onto a matrix Krylov subspace are described.
Reliable updated residuals in hybrid Bi-CG methods
TLDR
This paper proposes a more restrictive strategy for accumulating groups of updates for updating the residual and the approximation, and it is shown that this may improve the accuracy significantly, while maintaining speed of convergence.
A block version of BiCGSTAB for linear systems with multiple right-hand sides.
We present a new block method for solving large nonsymmetric linear systems of equations with multiple right-hand sides. We first give the matrix polynomial interpretation of the classical block
Accuracy Improvement of the Shifted Block BiCGGR Method for Linear Systems with Multiple Shifts and Multiple Right-Hand Sides
TLDR
The accuracy of the approximate solutions of the Shifted systems generated by the Sh shifted Block BiCGGR method is improved, which can generate high accuracy approximate solution of the Seed system.
Estimating the Attainable Accuracy of Recursively Computed Residual Methods
Many conjugate gradient-like methods for solving linear systems $Ax=b$ use recursion formulas for updating residual vectors instead of computing the residuals directly. For such methods it is shown
By How Much Can Residual Minimization Accelerate the Convergence of Orthogonal Residual Methods?
TLDR
An interpretation of these smoothing processes in coordinate space deepen the understanding of some of the underlying relationships and introduce a unifying framework for minimal residual and quasi-minimal residual smoothing.
...
1
2
3
...