A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides

DOI10.1016/0377-0427(95)00198-0zbMath0859.65021OpenAlexW2040388588MaRDI QIDQ1919396

Valeria Simoncini, Efstratios Gallopoulos

Publication date: 25 March 1997

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

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00198-0

zbMATH Keywords

performanceKrylov subspace methodnonsymmetric linear systemsRichardson's methodblock Arnoldi processblock GMRES method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Related Items

A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides ⋮ A block preconditioner for the Gl-LSMR algorithm ⋮ Adaptively restarted block Krylov subspace methods with low-synchronization skeletons ⋮ Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems ⋮ Deflated GMRES for systems with multiple shifts and multiple right-hand sides ⋮ The block grade of a block Krylov space ⋮ A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides ⋮ Sensitivity analysis of large-scale time dependent PDEs ⋮ Condition numbers for linear systems and Kronecker product linear systems with multiple right-hand sides ⋮ Numerical investigation of ensemble methods with block iterative solvers for evolution problems ⋮ Optimal fourth-order staggered-grid finite-difference scheme for 3D frequency-domain viscoelastic wave modeling ⋮ On short recurrence Krylov type methods for linear systems with many right-hand sides ⋮ A note on the adaptive simpler block GMRES method ⋮ Restarted Gmres Augmented With Eigenvectors For Shifted Linear Systems * Supported by the National Natural Science Foundation of China and the Science and Technology Developing Foundation of University in Shanghai of China ⋮ Block Modified Gram--Schmidt Algorithms and Their Analysis ⋮ Convergence properties of block GMRES and matrix polynomials ⋮ A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation ⋮ A block varaint of the GMRES method for unsymmetric linear systems ⋮ Preconditioned linear solves for parametric model order reduction

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementation of an adaptive algorithm for Richardson's method
• Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
• Richardson's iteration for nonsymmetric matrices
• The block conjugate gradient algorithm and related methods
• Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
• Application of a block modified Chebyshev algorithm to the iterative solution of symmetric linear systems with multiple right hand side vectors
• Convergence properties of block GMRES and matrix polynomials
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Sparse matrix test problems
• A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
• A Robust GMRES-Based Adaptive Polynomial Preconditioning Algorithm for Nonsymmetric Linear Systems
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems