A parallel implementation of the CMRH method for dense linear systems

DOI10.1007/S11075-012-9616-4MaRDI QIDQ1952302zbMATH OpenOpenAlexFDO

Authors 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

numerical examplespreconditioningnumerical experimentslinear systemsGMRES methodKrylov methodparallel implementationHessenberg processdense matrixminimal residual method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Recommendations

• A new implementation of the CMRH method for solving dense linear systems
• Algorithms for the CMRH method for dense linear systems
• Fast and efficient parallel solution of dense linear systems
• scientific article; zbMATH DE number 954666
• Parallel solution of dense linear systems using diagonalization methods
• A parallel elimination algorithm for the solution of dense linear systems
• Parallel randomized and matrix-free direct solvers for large structured dense linear systems
• scientific article; zbMATH DE number 4074332
• Fast and Efficient Parallel Solution of Sparse Linear Systems
• Parallel iterative methods for sparse linear systems

Cites work

• scientific article; zbMATH DE number 434530 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• A Newton basis GMRES implementation
• A new implementation of the CMRH method for solving dense linear systems
• A new look at CMRH and its relation to GMRES
• A parallel GMRES version for general sparse matrices
• Approximate inverse preconditioners for some large dense random electrostatic interaction matrices
• 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
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The University of Florida sparse matrix collection

Cited in

(12)

• Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
• Extended and rational Hessenberg methods for the evaluation of matrix functions
• A new look at CMRH and its relation to GMRES
• CMRH method as iterative solver for boundary element acoustic systems
• Heavy ball restarted CMRH methods for linear systems
• Augmented and deflated CMRH method for solving nonsymmetric linear systems
• A flexible CMRH algorithm for nonsymmetric linear systems
• Algorithms for the CMRH method for dense linear systems
• A new implementation of the CMRH method for solving dense linear systems
• The block Hessenberg process for matrix equations
• Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solver
• scientific article; zbMATH DE number 884967 (Why is no real title available?)

Describes a project that uses

Uses Software

• SparseMatrix
• CMRH

This page was built for publication: A parallel implementation of the CMRH method for dense linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952302)