A polynomial preconditioned global CMRH method for linear systems with multiple right-hand sides
type: Item
instance of: scholarly article
title: A polynomial preconditioned global CMRH method for linear systems with multiple right-hand sides
zbMATH Open document ID: 1397.65054
DOI: 10.1155/2013/457089
author: Ke Zhang
author: Chuanqing Gu
published in: Journal of Applied Mathematics
publication date: 2018-10-10T00:00:00Z
review text: Summary: The restarted global CMRH method (Gl-CMRH\((m)\)) [\textit{M. Heyouni}, Numer. Algorithms 26, No. 4, 317--332 (2001; Zbl 0979.65025)] is an attractive method for linear systems with multiple right-hand sides. However, Gl-CMRH\((m)\) may converge slowly or even stagnate due to a limited Krylov subspace. To ameliorate this drawback, a polynomial preconditioned variant of Gl-CMRH\((m)\) is presented. We give a theoretical result for the square case that assures that the number of restarts can be reduced with increasing values of the polynomial degree. Numerical experiments from real applications are used to validate the effectiveness of the proposed method.
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 6950687
Wikidata QID: Q59006085
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/457089
OpenAlex ID: W2058695868
description: scientific article; zbMATH DE number 6950687