Because is a real symmetric positive-definite matrix, the finite-dimensional spectral theorem supplies an orthonormal eigenbasis withIts eigendecomposition is also its singular value decomposition. If , thensoThe operator norms satisfy and . Therefore the worst-case relative perturbation bound isThe ratio is the spectral condition number of a positive-definite matrix. A large ratio means that data noise aligned with an eigenvector for the smallest eigenvalue is strongly amplified, so the inverse problem is ill conditioned.
Let be a singular system of a compact operator, withThe Moore–Penrose inverse of an operator is the generally unbounded mapdefined when the Picard criterion holds, with the component in sent to zero. It is the minimum-norm least-squares solution of .
A regularization of an inverse problem consists of bounded maps and a parameter rule such thatwhenever and is in the domain of .
For Tikhonov regularization, minimizinggivesThe scalar spectral filter satisfiesand consequentlyFor exact data, each filter factor tends to one, so . Choosingtherefore makes both the approximation error and propagated data error vanish. For example, is an admissible a priori regularization parameter choice.
For the Volterra integration operatorthe adjoint operator isSince , direct integration givesSimilarly,because . The half-integer sine and cosine families are orthonormal bases of , so is a singular system of a compact operator.
The Tikhonov solution for noisy data is thereforeWriting out the inner product and the singular functions makes this explicit:The factors suppress the unstable reciprocal growth at high index.
Articles by others on the same topic
There are currently no matching articles.