• Title of article

    FGMRES for linear discrete ill-posed problems

  • Author/Authors

    Morikuni، نويسنده , , Keiichi and Reichel، نويسنده , , Lothar and Hayami، نويسنده , , Ken، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2014
  • Pages
    13
  • From page
    175
  • To page
    187
  • Abstract
    GMRES is one of the most popular iterative methods for the solution of large linear systems of equations. However, GMRES does not always perform well when applied to the solution of linear systems of equations that arise from the discretization of linear ill-posed problems with error-contaminated data represented by the right-hand side. Such linear systems are commonly referred to as linear discrete ill-posed problems. The FGMRES method, proposed by Saad, is a generalization of GMRES that allows larger flexibility in the choice of solution subspace than GMRES. This paper explores application of FGMRES to the solution of linear discrete ill-posed problems. Numerical examples illustrate that FGMRES with a suitably chosen solution subspace may determine approximate solutions of higher quality than commonly applied iterative methods.
  • Keywords
    Iterative method , Linear discrete ill-posed problem , Subspace selection
  • Journal title
    Applied Numerical Mathematics
  • Serial Year
    2014
  • Journal title
    Applied Numerical Mathematics
  • Record number

    1529881