The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
type: Item
instance of: scholarly article
title: The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
zbMATH Open document ID: 1503.65065
author: Xianqiang Yang
published in: Journal of Computational and Applied Mathematics
publication date: 2018-05-04T00:00:00Z
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 6866629
zbMATH Keywords: CMRH method
zbMATH Keywords: block Krylov subspace
zbMATH Keywords: block Hessenberg process
zbMATH Keywords: block GMRES
zbMATH Keywords: multiple right-hand sides
zbMATH Keywords: matrix equation
describes a project that uses: CMRH
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
full work available at URL: j.cam.2018.01.012
OpenAlex ID: W2790172562
cites work: New convergence results on the global GMRES method for diagonalizable matrices
cites work: Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
cites work: The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
cites work: Global FOM and GMRES algorithms for matrix equations
cites work: Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
cites work: Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
cites work: Q3640935
cites work: A new family of global methods for linear systems with multiple right-hand sides
cites work: Generalized global conjugate gradient squared algorithm
cites work: Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
cites work: Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides
cites work: Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
cites work: The block conjugate gradient algorithm and related methods
cites work: Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
cites work: A breakdown-free block conjugate gradient method
cites work: Parallel iterative methods for sparse linear systems
cites work: An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
cites work: Convergence properties of block GMRES and matrix polynomials
cites work: Simpler block GMRES for nonsymmetric systems with multiple right-hand sides
cites work: Dynamic block GMRES: An iterative method for block linear systems
cites work: A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
cites work: A block version of BiCGSTAB for linear systems with multiple right-hand sides
cites work: The block Lanczos method for linear systems with multiple right-hand sides
cites work: The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
cites work: A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides
cites work: A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides
cites work: The block LSMR algorithm for solving linear systems with multiple right-hand sides
cites work: CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
cites work: Q3359644
cites work: A new implementation of the CMRH method for solving dense linear systems
cites work: The university of Florida sparse matrix collection
DOI: 10.1016/J.CAM.2018.01.012
description: scientific article; zbMATH DE number 6866629