The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
From MaRDI portal
Publication:1747305
DOI10.1016/j.cam.2018.01.012zbMath1503.65065OpenAlexW2790172562MaRDI QIDQ1747305
Publication date: 4 May 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.01.012
CMRH methodmatrix equationblock GMRESmultiple right-hand sidesblock Krylov subspaceblock Hessenberg process
Related Items (11)
Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis ⋮ Augmented and deflated CMRH method for solving nonsymmetric linear systems ⋮ Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ An algebraic multiscale solver with local Robin boundary value problems for flows in high-contrast media ⋮ On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations ⋮ Unnamed Item ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ The simpler block CMRH method for linear systems ⋮ Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side ⋮ Preconditioned iterative methods for multi-linear systems based on the majorization matrix ⋮ A Hessenberg-type algorithm for computing PageRank problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
- A new family of global methods for linear systems with multiple right-hand sides
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Simpler block GMRES for nonsymmetric systems with multiple right-hand sides
- New convergence results on the global GMRES method for diagonalizable matrices
- Generalized global conjugate gradient squared algorithm
- The block conjugate gradient algorithm and related methods
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Global FOM and GMRES algorithms for matrix equations
- The block Lanczos method for linear systems with multiple right-hand sides
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- A breakdown-free block conjugate gradient method
- Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
- Dynamic block GMRES: An iterative method for block linear systems
- A new implementation of the CMRH method for solving dense linear systems
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- Convergence properties of block GMRES and matrix polynomials
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- The block LSMR algorithm for solving linear systems with multiple right-hand sides
- The university of Florida sparse matrix collection
- 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
- Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
This page was built for publication: The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
