Because is a real symmetric positive-definite matrix, the finite-dimensional spectral theorem supplies an orthonormal eigenbasis with
Its eigendecomposition is also its singular value decomposition. If , then
so
The operator norms satisfy and . Therefore the worst-case relative perturbation bound is
The 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, with
The Moore–Penrose inverse of an operator is the generally unbounded map
defined 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 that
whenever and is in the domain of .
For Tikhonov regularization, minimizing
gives
The scalar spectral filter satisfies
and consequently
For exact data, each filter factor tends to one, so . Choosing
therefore makes both the approximation error and propagated data error vanish. For example, is an admissible a priori regularization parameter choice.
For the Volterra integration operator
the adjoint operator is
Since , direct integration gives
Similarly,
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 therefore
Writing 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 (0)

There are currently no matching articles.