On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems (Q1085952): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5552510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for convergence of regularization methods for solving linear operator equations of the first kind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrepancy principles for Tikhonov regularization of ill-posed problems leading to optimal convergence rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic order of accuracy of Tikhonov regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3334886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of generalized inverses by iterated regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4087104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125663 / rank
 
Normal rank

Latest revision as of 17:07, 17 June 2024

scientific article
Language Label Description Also known as
English
On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems
scientific article

    Statements

    On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems (English)
    0 references
    1987
    0 references
    The iterated Tikhonov method for the solution of the ill-posed problem \(Tx=y\), where T is a bounded linear operator from one Hilbert space X to another, Y, consists in solving \((T^*T+\alpha I)x^ j_{\alpha,\delta}=T^*y_{\delta}+\alpha x^{j-1}_{\alpha,\delta}\) for \(x^ j_{\alpha,\delta}\), where \(1\leq j\leq m\in {\mathbb{N}}\), \(\alpha,\delta >0,\) \(x^ o_{\alpha,\delta}:=0\) and \(\| y_{\delta}-y\| \leq \delta\). The author proposes a method for choosing the regularization parameter \(\alpha\) in such a way that the optimal convergence rate \(\| x^ m_{\alpha,\delta}-x\| =O(\delta^{2n/(2n+1)})\) is achieved for \(x\in R((T^*T)^ n)\), where \(0<n\leq m\) and x is the least squares minimum norm solution of \(Tx=y\).
    0 references
    iterated Tikhonov method
    0 references
    ill-posed problem
    0 references
    Hilbert space
    0 references
    regularization
    0 references
    optimal convergence rate
    0 references
    least squares minimum norm solution
    0 references
    0 references

    Identifiers