Dynamic block GMRES: An iterative method for block linear systems

DOI10.1007/s10444-006-9012-5zbMath1129.65024MaRDI QIDQ2463394

Yanyan Li

Publication date: 6 December 2007

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-006-9012-5

zbMATH Keywords

algorithm; convergence; numerical examples; iterative methods; parallel computing; Arnoldi process; generalized minimal residual (GMRES) method; block systems; rank-revealing QR factorization

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F10: Iterative numerical methods for linear systems

65Y05: Parallel numerical computation

Related Items

A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides, A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides, Block s-step Krylov iterative methods

Uses Software

• MatrixMarket
• PIM
• CGS

Cites Work

• Rang revealing QR factorizations
• Rank and null space calculations using matrix decomposition without column interchanges
• A block variant of the GMRES method on massively parallel processors
• The parallel iterative methods (PIM) package for the solution of systems of linear equations on parallel computers
• Implementation of the GMRES Method Using Householder Transformations
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Computing rank-revealing QR factorizations of dense matrices
• A Technique for Accelerating the Convergence of Restarted GMRES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item