Inexact GMRES for singular linear systems
Author(s) -
Xiuhong Du,
Daniel B. Szyld
Publication year - 2008
Publication title -
bit numerical mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.904
H-Index - 59
eISSN - 1572-9125
pISSN - 0006-3835
DOI - 10.1007/s10543-008-0171-2
Subject(s) - generalized minimal residual method , krylov subspace , residual , linear system , mathematics , matrix (chemical analysis) , subspace topology , computer science , mathematical optimization , work (physics) , markov chain , algorithm , mathematical analysis , materials science , statistics , mechanical engineering , composite material , engineering
Inexact Krylov subspace methods have been shown to be practical alternatives for the solution of certain linear systems of equations. In this paper, the solution of singular systems with inexact matrix-vector products is explored. Criteria are developed to prescribe how inexact the matrix-vector products can be, so that the computed residual remains close to the true residual, thus making the inexact method of practical applicability. Cases are identified for which the methods work well, and this is the case in particular for systems representing certain Markov chains. Numerical experiments illustrate the effectiveness of the inexact approach.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom