Matrix Krylov subspace methods for linear systems with multiple right-hand sides
From MaRDI portal
Publication:2583219
DOI10.1007/s11075-005-1526-2zbMath1087.65028OpenAlexW2069479716MaRDI QIDQ2583219
Mohammed Heyouni, Azeddine Essai
Publication date: 13 January 2006
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-005-1526-2
convergence accelerationnumerical experimentsmatrix equationsKrylov subspace methodssystems of linear equationsmultiple right-hand sidescomplexity comparisonsminimal residual norm methodsweighted global Arnoldi processweighted global Hessenberg process
Related Items (37)
Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides ⋮ Global simpler GMRES for nonsymmetric systems with multiple right-hand sides ⋮ Robust SAV-ensemble algorithms for parametrized flow problems with energy stable open boundary conditions ⋮ Matrix Krylov subspace methods for large scale model reduction problems ⋮ Global-DGMRES method for matrix equationAXB = C ⋮ A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations ⋮ Stationary splitting iterative methods for the matrix equation \(AXB=C\) ⋮ Extended Arnoldi methods for large low-rank Sylvester matrix equations ⋮ A block preconditioner for the Gl-LSMR algorithm ⋮ Augmented and deflated CMRH method for solving nonsymmetric linear systems ⋮ Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM ⋮ Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations ⋮ Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ On global Hessenberg based methods for solving Sylvester matrix equations ⋮ Global GPBiCGstab\((L)\) method for solving linear matrix equations ⋮ On Hessenberg type methods for low-rank Lyapunov matrix equations ⋮ Ensemble algorithm for parametrized flow problems with energy stable open boundary conditions ⋮ 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 ⋮ Some observations on weighted GMRES ⋮ Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems ⋮ Global FOM and GMRES algorithms for a class of complex matrix equations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides ⋮ A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides ⋮ Generalized global conjugate gradient squared algorithm ⋮ A flexible CMRH algorithm for nonsymmetric linear systems ⋮ Time relaxation algorithm for flow ensembles ⋮ Biorthogonal Rosenbrock-Krylov time discretization methods ⋮ Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations ⋮ A Weighted Block GMRES method for solving linear systems with multiple right-hand sides ⋮ A novel class of block methods based on the blockAAT-Lanczos bi-orthogonalization process for matrix equations ⋮ A Hessenberg-type algorithm for computing PageRank problems ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- The block conjugate gradient algorithm and related methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Weighted FOM and GMRES for solving nonsymmetric linear systems
- On a variable smoothing procedure for Krylov subspace methods
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Global FOM and GMRES algorithms for matrix equations
- Matrix polynomial and epsilon-type extrapolation methods with applications
- Convergence properties of block GMRES and matrix polynomials
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- An Iterative Method for Nonsymmetric 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
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Methods of conjugate gradients for solving linear systems
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
This page was built for publication: Matrix Krylov subspace methods for linear systems with multiple right-hand sides