A Polynomial Preconditioner for the CMRH Algorithm
Joint Authors
Xu, Shiji
Lai, Jiangzhou
Lu, Linzhang
Source
Mathematical Problems in Engineering
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-12, 12 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-03-22
Country of Publication
Egypt
No. of Pages
12
Main Subjects
Abstract EN
Many large and sparse linear systems can be solved efficiently by restarted GMRES and CMRH methods Sadok 1999.
The CMRH(m) method is less expensive and requires slightly less storage than GMRES(m).
But like GMRES, the restarted CMRH method may not converge.
In order to remedy this defect, this paper presents a polynomial preconditioner for CMRH-based algorithm.
Numerical experiments are given to show that the polynomial preconditioner is quite simple and easily constructed and the preconditioned CMRH(m) with the polynomial preconditioner has better performance than CMRH(m).
American Psychological Association (APA)
Lai, Jiangzhou& Lu, Linzhang& Xu, Shiji. 2011. A Polynomial Preconditioner for the CMRH Algorithm. Mathematical Problems in Engineering،Vol. 2011, no. 2011, pp.1-12.
https://search.emarefa.net/detail/BIM-480298
Modern Language Association (MLA)
Lai, Jiangzhou…[et al.]. A Polynomial Preconditioner for the CMRH Algorithm. Mathematical Problems in Engineering No. 2011 (2011), pp.1-12.
https://search.emarefa.net/detail/BIM-480298
American Medical Association (AMA)
Lai, Jiangzhou& Lu, Linzhang& Xu, Shiji. A Polynomial Preconditioner for the CMRH Algorithm. Mathematical Problems in Engineering. 2011. Vol. 2011, no. 2011, pp.1-12.
https://search.emarefa.net/detail/BIM-480298
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-480298