A regularization of an inverse problem replaces the possibly unbounded inverse by a family of continuous reconstruction operators . For compatible exact data it must recover the minimum-norm solution as . For noisy data , a parameter rule must make both bias and amplified noise tend to zero. The target is the minimum-norm solution because data cannot determine a component in the kernel of a linear map.
Tikhonov regularization minimizes
The quadratic norm penalty makes this functional strictly convex and a coercive function. Its first variation, applied to arbitrary real and imaginary perturbations, gives
The positive operator is bounded below by and has a bounded inverse. The unique Tikhonov regularization solution is
The Tikhonov stability bound follows from the singular-value gain:
Thus reconstruction is stable for each fixed positive . Stability is not uniform as : that limit restores the unbounded inverse. For exact compatible data,
The singular system of a compact operator makes this strong convergence transparent: each positive singular-value coefficient tends to zero and is bounded by the corresponding coefficient of . Consequently
whenever and , for example . This is a convergent regularization of an inverse problem, not merely a bounded formula.
A singular system of a compact operator consists of positive singular values and orthonormal vectors , , with
The form an orthonormal basis of , and the form one of . There are finitely many positive singular values for finite-rank ; otherwise . Obtain the system by applying the spectral theorem for compact self-adjoint operators to , choosing , and setting . The inner product identities verify orthonormality and the displayed relations.
With inner products linear in the first argument,
The normal equation for a linear inverse problem with the Tikhonov regularization penalty acts separately on each . Hence the singular-system Tikhonov filter gives the regularized solution
This norm-convergent series follows from Bessel's inequality and the bound . Data orthogonal to are annihilated by , and the minimizing solution has no component in . The same formula with reconstructs noisy data. In contrast, the unregularized inverse would divide by , with convergence governed by the Picard criterion.
Use the recurrence exactly as printed. Set and . It gives
Repeated substitution yields a function of alone:
The empty sum is zero for . This is Landweber iteration with a Tikhonov initial value. In the singular system of a compact operator, , where . Thus
For every positive singular value, the finite geometric sum gives
Therefore the closed form of a Tikhonov-initialized Landweber iterate is
In the printed notation, means the coefficient ; its dependence on and is implicit. At , the formula reduces to , exactly the Tikhonov regularization initial value. At fixed , its apparent singularity at is removable:
Thus each fixed iterate is a bounded reconstruction operator and the series converges in norm.
The terminology in the question requires care. The printed recurrence is explicit Landweber iteration with step . Convergence of its nonzero modes requires ; a sufficient uniform step condition is
With exact compatible data and this condition, . At equality the largest singular-value mode can alternate, and smaller can produce growing modes. With noisy data, early stopping of Landweber iteration is needed to prevent recovery of arbitrarily unstable small-singular-value components.
Conventional Iterated Tikhonov regularization instead uses the implicit update
With the same Tikhonov regularization initial value its filter would be , not the filter derived above. The solution here retains the authoritative printed update rather than silently changing it.

Articles by others on the same topic (0)

There are currently no matching articles.