On short recurrence Krylov type methods for linear systems with many right-hand sides

DOI10.1016/J.CAM.2015.11.040MaRDI QIDQ5964591zbMATH OpenOpenAlexFDO

Authors S. Rashedi, Ghodrat Ebadi, Sebastian Birk, Andreas Frommer

Publication date 29 February 2016

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.04395

zbMATH Keywords

Krylov subspacemultiple right-hand sidessparse linear systemsblock methodsnon-Hermitian matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10)

Abstract: Block and global Krylov subspace methods have been proposed as methods adapted to the situation where one iteratively solves systems with the same matrix and several right hand sides. These methods are advantageous, since they allow to cast the major part of the arithmetic in terms of matrix-block vector products, and since, in the block case, they take their iterates from a potentially richer subspace. In this paper we consider the most established Krylov subspace methods which rely on short recurrencies, i.e. BiCG, QMR and BiCGStab. We propose modifications of their block variants which increase numerical stability, thus at least partly curing a problem previously observed by several authors. Moreover, we develop modifications of the "global" variants which almost halve the number of matrix-vector multiplications. We present a discussion as well as numerical evidence which both indicate that the additional work present in the block methods can be substantial, and that the new "economic" versions of the "global" BiCG and QMR method can be considered as good alternatives to the BiCGStab variants.

Recommendations

• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• Convergence properties of some block Krylov subspace methods for multiple linear systems
• A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
• Algebraic properties of the block GMRES and block Arnoldi methods
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides

Cites work

• scientific article; zbMATH DE number 3511513 (Why is no real title available?)
• A Lanczos-type method for multiple starting vectors
• A Stabilized QMR Version of Block BiCG
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• A block version of BiCGSTAB for linear systems with multiple right-hand sides
• A deflated conjugate gradient method for multiple right hand sides and multiple shifts
• A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
• A new family of global methods for linear systems with multiple right-hand sides
• A set of level 3 basic linear algebra subprograms
• Adaptive aggregation-based domain decomposition multigrid for the lattice Wilson-Dirac operator
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
• Block BiCGGR: A new block Krylov subspace method for computing high accuracy solutions
• Convergence properties of block GMRES and matrix polynomials
• Generalized global conjugate gradient squared algorithm
• Global FOM and GMRES algorithms for matrix equations
• Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
• Increasing the performance of the Jacobi-Davidson method by blocking
• Krylov-subspace methods for the Sylvester equation
• Oblique projection methods for linear systems with multiple right-hand sides
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Retooling the method of block conjugate gradients
• The University of Florida sparse matrix collection
• The block conjugate gradient algorithm and related methods
• The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
• The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
• Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms

Cited in

(13)

• Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
• Block BiCGGR: A new block Krylov subspace method for computing high accuracy solutions
• Block minimum perturbation algorithm based on block Arnoldi process for nonsymmetric linear systems with multiple right-hand sides
• scientific article; zbMATH DE number 7027635 (Why is no real title available?)
• Short-term recurrence Krylov subspace methods for nearly Hermitian matrices
• Block Krylov subspace methods for functions of matrices. II: Modified block FOM
• Hardware-oriented Krylov methods for high-performance computing
• Algebraic properties of the block GMRES and block Arnoldi methods
• Optimal size of the block in block GMRES on GPUs: computational model and experiments
• Matrix Krylov subspace methods for linear systems with multiple right-hand sides
• Degree-based function index for graphs with given diameter
• The block grade of a block Krylov space
• Global symplectic Lanczos method with application to matrix exponential approximation

Describes a project that uses

Uses Software

• SparseMatrix
• FEAST
• BLAS

This page was built for publication: On short recurrence Krylov type methods for linear systems with many right-hand sides

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964591)