Algorithms for the CMRH method for dense linear systems
From MaRDI portal
Publication:5963411
DOI10.1007/s11075-015-9997-2zbMath1333.65032OpenAlexW331325375MaRDI QIDQ5963411
Philippe Marion, Mohammed Heyouni, Hassane Sadok, Sébastien Duminil
Publication date: 19 February 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-9997-2
linear systemsnumerical examplesparallel computationKrylov subspace methodchanging minimal residual methoddense matrixHessenberg process
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)
Related Items
Heavy ball restarted CMRH methods for linear systems, Augmented and deflated CMRH method for solving nonsymmetric linear systems, The block Hessenberg process for 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
Uses Software
Cites Work
- Unnamed Item
- A new look at CMRH and its relation to GMRES
- CMRH method as iterative solver for boundary element acoustic systems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- On a variable smoothing procedure for Krylov subspace methods
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- A parallel implementation of the CMRH method for dense linear systems
- A new implementation of the CMRH method for solving dense linear systems
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
- The university of Florida sparse matrix collection
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides