CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
From MaRDI portal
Publication:1805904
DOI10.1023/A:1019164119887zbMath0936.65031OpenAlexW139641880MaRDI QIDQ1805904
Publication date: 31 October 1999
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019164119887
numerical experimentsiterative methodsGMRES methodLanczos algorithmKrylov methodsgeneralized minimal residual methodArnoldi processHessenberg processquasi-minimal residual methodQMR method
Related Items (38)
On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems ⋮ Heavy ball restarted CMRH methods for linear systems ⋮ Preconditioning complex symmetric linear systems ⋮ On a variable smoothing procedure for Krylov subspace methods ⋮ A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations ⋮ Restarted Hessenberg method for solving shifted nonsymmetric linear systems ⋮ Augmented and deflated CMRH method for solving nonsymmetric linear systems ⋮ A unified approach to Krylov subspace methods for solving linear systems ⋮ 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 ⋮ A new look at CMRH and its relation to GMRES ⋮ A fast implementation for GMRES method ⋮ GMRES algorithms over 35 years ⋮ A parallel implementation of the CMRH method for dense linear systems ⋮ CMRH method as iterative solver for boundary element acoustic systems ⋮ On Hessenberg type methods for low-rank Lyapunov matrix equations ⋮ The block Hessenberg process for matrix equations ⋮ An optimal Q-OR Krylov subspace method for solving linear systems ⋮ The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ A new implementation of the CMRH method for solving dense linear systems ⋮ A polynomial preconditioner for the CMRH algorithm ⋮ A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems ⋮ A flexible CMRH algorithm for nonsymmetric linear systems ⋮ Algorithms for the CMRH method for dense linear systems ⋮ CMRH ⋮ Global Hessenberg and CMRH methods for a class of complex matrix equations ⋮ Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously ⋮ The simpler block CMRH method for linear systems ⋮ Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side ⋮ KRYLOV SUBSPACE METHODS OF HESSENBERG BASED FOR ALGEBRAIC RICCATI EQUATION ⋮ Matrix Krylov subspace methods for linear systems with multiple right-hand sides ⋮ Preconditioned iterative methods for multi-linear systems based on the majorization matrix ⋮ A Hessenberg-type algorithm for computing PageRank problems
Uses Software
This page was built for publication: CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
