No label defined (Q4528683)

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 1563761
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1563761

      Statements

      0 references
      0 references
      0 references
      25 October 2001
      0 references
      linear ill-posed problems
      0 references
      regularization
      0 references
      implicit iterative methods
      0 references
      Morozov discrepancy principle
      0 references
      parallel algorithm
      0 references
      extrapolation
      0 references
      Hilbert spaces
      0 references
      linear bounded operator
      0 references
      convergence
      0 references
      parallel computation
      0 references
      Let \(X, Y\) be Hilbert spaces and \(A: X\to Y\) be a linear bounded operator with a nonclosed range. The implicit iterative methods \[ (A^*A+\alpha_kI)x_k=A^*y+\alpha_kx_{k-1}, \qquad k=1,2,\dots,x_0=0 \] and its noisy counterpart \[ (A^*A+\alpha_kI)x_k^\delta=A^*y_\delta+\alpha_kx_{k-1}^\delta, \qquad k=1,2,\dots, x_0=0 \] are considered as methods of regularization of the ill-posed problem \(Ax=y\) with the exact and the perturbed right hand sides, respectively. In contradiction to the previously investigated implicit iterative schemes by \textit{G. M. Vainikko} [Zh. Vychisl. Mat. Mat. Fiz. 22, 499-515 (1982; Zbl 0528.65039)] and by \textit{G. He} and \textit{L. Liu} [J. Comput. Math. 17, No. 3, 275-284 (1999; Zbl 0943.65067)] the parameters \(\alpha_k\) are not assumed to be one fixed constant. Under the assumption \(0<\underline\alpha\leq\alpha_k \leq\overline\alpha<\infty\) the authors obtain the same convergence results and convergence rate as in the case of a constant \(\alpha\). A priori and a posteriori (Morozov discrepancy principle) strategies of choosing \(k\) (depending on the data error) are considered. Moreover, it is shown that in the case \(\alpha_i\not=\alpha_j\) for \(i\not=j\) the parallel computation can be implemented which explains what is the reason of investigating the method for different \(\alpha_k\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references