Loading [MathJax]/jax/output/HTML-CSS/config.js
Journals
Resources
About Us
Open Access
Go to previous page

Simpler Hybrid GMRES

Year:    2006

Journal of Information and Computing Science, Vol. 1 (2006), Iss. 2 : pp. 110–114

Abstract

Hybrid GMRES algorithms are effective for solving large nonsymmetric linear systems. GMRES is employed at the first phase to produce iterative polynomials, which will be used at the second phase to implement the Richardson iteration. In the process of GMRES, a least squares problem needs to be solved which involves an upper Hessenberg factorization. Instead of using GMRES, we may use simpler GMRES. Correspondingly, simpler hybrid GMRES algorithms are formulated. It is described how to construct the iterative polynomials from simpler GMRES. The new algorithms avoid the upper Hessenberg factorization so that they are easier to program and require a less amount of work. Numerical examples are conducted to illustrate the good performance of the new algorithms.

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2024-JICS-22850

Journal of Information and Computing Science, Vol. 1 (2006), Iss. 2 : pp. 110–114

Published online:    2006-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    5

Keywords: