The adjoint operators, orthonormal singular vectors and squared-norm normal equation for a linear inverse problem conditions require Hilbert spaces. For arbitrary normed spaces the Banach-space adjoint takes values in the dual spaces and need not produce this formula. Interpret the given singular value system in Hilbert spaces, with in the unknown space and in the data space, as in the printed identities. Positive singular values tending to zero provide the compact ill-posed case. A general bounded linear operator need not have this property; the identity operator is a well-conditioned counterexample. Components in the kernel must be fixed by a minimum-norm convention, and the unregularized inverse is defined only for data satisfying the corresponding range condition.
Using the singular value system with and , the formal minimum-norm inverse is
It defines an element of the unknown Hilbert space only if , the Picard criterion. A null-space component is undetermined by the data.
Adding an error along a single left singular vector changes precisely one coefficient:
Although this perturbation has data norm , its amplification factor is . If , these factors are unbounded. More explicitly choose , tending to zero, while the minimum-norm inverse is , of norm one. Thus the inverse is discontinuous at zero. It may also fail to exist for data outside its nonclosed range, so merely minimizing a residual does not guarantee that the formal inverse exists. This is ill-posedness by unbounded small-singular-value amplification, not a claim that every finite-dimensional or bounded forward map has an unstable inverse.
For , minimize . Its first variation in every direction gives
The self-adjoint operator on the left has lower bound , so it is invertible and the minimizer is unique. The regularized solution has the singular expansion
Since , its gain is at most . Consequently
This proves existence, uniqueness and continuous data dependence at fixed positive parameter. For the particular perturbation from part (i), the error is instead of . To recover a minimum-norm exact solution as noise tends to zero, choose while ; dominated convergence of the exact-data singular coefficients removes the bias.
To connect this with the provided inverse expansion, put and . The exact intertwining identity is
It follows by multiplying on either side by the appropriate resolvent. A useful exact inverse identity is
Expanding to two terms gives the printed approximation, namely
This is the truncated Tikhonov resolvent. Multiplication gives , so the expression is not an exact inverse. For example and give the approximate value instead of the exact . Its exact remainder is
In the regime it is a controlled Neumann expansion. Using it to reconstruct gives
For each fixed this is a bounded polynomial in bounded operators, with
Thus the supplied approximation also has continuous data dependence in its domain of use. It must not be extrapolated to with fixed: its gain on any nonzero singular mode diverges, so it would not define a convergent regularization family there. The exact Tikhonov filter supplies the well-posed regularized problem; the truncated formula is only a controlled computational approximation.

Articles by others on the same topic (0)

There are currently no matching articles.