Exact and inexact breakdowns in the block GMRES method
From MaRDI portal
Publication:854871
DOI10.1016/J.LAA.2006.04.018zbMATH Open1112.65028OpenAlexW2028499533MaRDI QIDQ854871FDOQ854871
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
Recommendations
- Block GMRES method with inexact breakdowns and deflated restarting
- A block varaint of the GMRES method for unsymmetric linear systems
- Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems
- On the block GMRES method with deflated restarting
- scientific article; zbMATH DE number 2069320
- On Improving Linear Solver Performance: A Block Variant of GMRES
- A block variant of the GMRES method on massively parallel processors
- Algebraic properties of the block GMRES and block Arnoldi methods
- Dynamic block GMRES: An iterative method for block linear systems
- Flexible and deflated variants of the block shifted GMRES method
Cites Work
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Global FOM and GMRES algorithms for matrix equations
- Convergence properties of block GMRES and matrix polynomials
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- A convergence analysis of GMRES and FOM methods for Sylvester equations
Cited In (26)
- Inexact inverse subspace iteration with preconditioning applied to quadratic matrix polynomials
- A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems
- A Block Minimum Residual Norm Subspace Solver with Partial Convergence Management for Sequences of Linear Systems
- Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
- On Improving Linear Solver Performance: A Block Variant of GMRES
- A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
- Title not available (Why is that?)
- Residual-based simpler block GMRES for nonsymmetric linear systems with multiple right-hand sides
- A new family of global methods for linear systems with multiple right-hand sides
- Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
- New convergence results on the global GMRES method for diagonalizable matrices
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- A breakdown-free block conjugate gradient method
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- Flexible and deflated variants of the block shifted GMRES method
- The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense
- A block MINRES algorithm based on the band Lanczos method
- Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
- Block Krylov subspace methods for the computation of structural response to turbulent wind
- Direct global Lanczos method for large linear systems with multiple right-hand sides
- Title not available (Why is that?)
- GMRES with multiple preconditioners
- Block conjugate gradient algorithms for least squares problems
- GMRES algorithms over 35 years
- The block grade of a block Krylov space
This page was built for publication: Exact and inexact breakdowns in the block GMRES method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854871)
