Exact and inexact breakdowns in the block GMRES method
From MaRDI portal
Publication:854871
DOI10.1016/j.laa.2006.04.018zbMath1112.65028OpenAlexW2028499533MaRDI QIDQ854871
Publication date: 7 December 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.04.018
Related Items
A breakdown-free block conjugate gradient method ⋮ Residual-based simpler block GMRES for nonsymmetric linear systems with multiple right-hand sides ⋮ Direct global Lanczos method for large linear systems with multiple right-hand sides ⋮ A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems ⋮ GMRES with multiple preconditioners ⋮ GMRES algorithms over 35 years ⋮ Block Krylov subspace methods for the computation of structural response to turbulent wind ⋮ A new family of global methods for 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 ⋮ New convergence results on the global GMRES method for diagonalizable matrices ⋮ Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems ⋮ Block conjugate gradient algorithms for least squares problems ⋮ Unnamed Item ⋮ The block grade of a block Krylov space ⋮ A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides ⋮ Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations ⋮ Flexible and deflated variants of the block shifted GMRES method ⋮ A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides ⋮ Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions ⋮ The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense ⋮ A Block Minimum Residual Norm Subspace Solver with Partial Convergence Management for Sequences of Linear Systems ⋮ Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials ⋮ A block MINRES algorithm based on the band Lanczos method ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
Cites Work
- Unnamed Item
- Unnamed Item
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- Global FOM and GMRES algorithms for matrix equations
- Convergence properties of block GMRES and matrix polynomials
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
