A Polynomial Preconditioned Global CMRH Method for Linear Systems with Multiple Right-Hand Sides | Zendy

Ke Zhang | Zendy; Chuanqing Gu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Polynomial Preconditioned Global CMRH Method for Linear Systems with Multiple Right-Hand Sides

Author(s) -

Ke Zhang,

Chuanqing Gu

Publication year - 2013

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2013/457089

Subject(s) - krylov subspace , polynomial , mathematics , subspace topology , mathematical optimization , computer science , iterative method , mathematical analysis

The restarted global CMRH method (Gl-CMRH(m)) (Heyouni, 2001) 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research