A parallel implementation of the CMRH method for dense linear systems

DOI10.1007/s11075-012-9616-4zbMath1267.65036MaRDI QIDQ1952302

Sébastien Duminil

Publication date: 30 May 2013

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-012-9616-4

zbMATH Keywords

linear systems; numerical examples; numerical experiments; preconditioning; parallel implementation; GMRES method; minimal residual method; dense matrix; Hessenberg process; Krylov method

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65Y05: Parallel numerical computation

65F08: Preconditioners for iterative methods

Related Items

Augmented and deflated CMRH method for solving nonsymmetric linear systems, Algorithms for the CMRH method for dense linear systems, Heavy ball restarted CMRH methods for linear systems, The block Hessenberg process for matrix equations, Extended and rational Hessenberg methods for the evaluation of matrix functions, Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously, A flexible CMRH algorithm for nonsymmetric linear systems

Uses Software

• CMRH
• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• A new look at CMRH and its relation to GMRES
• CMRH method as iterative solver for boundary element acoustic systems
• CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
• A parallel GMRES version for general sparse matrices
• 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
• A Newton basis GMRES implementation