Iterative Methods with Perturbations for Ill-Posed Problems

  • We consider regularizing iterative procedures for ill-possed problems with random and nonrandom additive errors. The rate of square-mean convergence for iterative procedures with random errors is studied. The comparison theorem is established for the convergence of procedures with and without additive errors.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Author:Eberhard Schock, A.Yu. Veretennikov
URN (permanent link):urn:nbn:de:hbz:386-kluedo-7583
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of Publication:1999
Publishing Institute:Technische Universität Kaiserslautern
Tag:Ill-posed Problems ; Iterative Methods ; Random Errors; Square-mean Convergence
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik
MSC-Classification (mathematics):65F10 Iterative methods for linear systems [See also 65N22]
65J20 Improperly posed problems; regularization

$Rev: 12793 $