A hybrid GMRES/LS-Arnoldi method to accelerate the parallel solution of linear systems

DOI10.1016/j.camwa.2006.05.004zbMath1146.65314OpenAlexW2062301079MaRDI QIDQ936721

G. Bergere, Haiwu He, Serge G. Petiton

Publication date: 19 August 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.004

zbMATH Keywords

numerical examplesconvergence accelerationparallel computationiterative methodGMREShybrid methodgeneralization minimal residual (GMRES) method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (2)

Analysis and parallel implementation of a forced \(N\)-body problem ⋮ A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems

Uses Software

• ARPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2)
• The Tchebychev iteration for nonsymmetric linear systems
• A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
• ARPACK Users' Guide
• Sparse Matrix Computations on Parallel Processor Arrays
• Some observations on the l² convergence of the additive Schwarz preconditioned GMRES method
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: A hybrid GMRES/LS-Arnoldi method to accelerate the parallel solution of linear systems