Sequential predictor-corrector regularization methods and their limitations (Q4493580)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1484961
Language Label Description Also known as
default for all languages
No label defined
    English
    Sequential predictor-corrector regularization methods and their limitations
    scientific article; zbMATH DE number 1484961

      Statements

      Sequential predictor-corrector regularization methods and their limitations (English)
      0 references
      0 references
      0 references
      23 September 2001
      0 references
      predictor-corrector methods
      0 references
      numerical examples
      0 references
      sequential regularization methods
      0 references
      ill-posed Volterra integral equations
      0 references
      stability
      0 references
      convergence
      0 references
      Although (discrete) sequential regularization methods for ill-posed Volterra integral equations of the first kind were introduced in the early 1960s by J. V. Beck [compare the monograph Inverse heat conduction: Ill-posed problems, Wiley-Interscience, New York (1985; Zbl 0633.73120) by \textit{J. V. Beck}, \textit{B. Backwell} and \textit{C. R. St. Clair}, for an overview], it is the recent systematic analysis by \textit{P. K. Lamm} [see, e.g., SIAM J. Appl. Math. 56, No. 2, 524-541 (1996; Zbl 0852.65127), and the survey paper in Surveys on solution methods for inverse problems (D. Colton et al., eds.), 53-82, Springer-Verlag, Vienna (2000; Zbl 0963.01010)] that has greatly increased our understanding of these methods. The present paper builds on this work: it presents stability estimates and results on the rate of convergence for equations with finitely smoothing kernels, thus extending results contained in Lamm's 1997 paper. In addition, the authors discuss the limitations of sequential regularization: if the convolution kernel is \(\nu\)-smoothing with \(\nu\geq 5\), no such methods satisfying a certain stability condition can exist. Numerical examples illustrate various aspects of the analysis.
      0 references

      Identifiers