1,760 research outputs found
Regularization matrices determined by matrix nearness problems
This paper is concerned with the solution of large-scale linear discrete
ill-posed problems with error-contaminated data. Tikhonov regularization is a
popular approach to determine meaningful approximate solutions of such
problems. The choice of regularization matrix in Tikhonov regularization may
significantly affect the quality of the computed approximate solution. This
matrix should be chosen to promote the recovery of known important features of
the desired solution, such as smoothness and monotonicity. We describe a novel
approach to determine regularization matrices with desired properties by
solving a matrix nearness problem. The constructed regularization matrix is the
closest matrix in the Frobenius norm with a prescribed null space to a given
matrix. Numerical examples illustrate the performance of the regularization
matrices so obtained
A GCV based Arnoldi-Tikhonov regularization method
For the solution of linear discrete ill-posed problems, in this paper we
consider the Arnoldi-Tikhonov method coupled with the Generalized Cross
Validation for the computation of the regularization parameter at each
iteration. We study the convergence behavior of the Arnoldi method and its
properties for the approximation of the (generalized) singular values, under
the hypothesis that Picard condition is satisfied. Numerical experiments on
classical test problems and on image restoration are presented
Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector
We consider algebraic iterative reconstruction methods with applications in
image reconstruction. In particular, we are concerned with methods based on an
unmatched projector/backprojector pair; i.e., the backprojector is not the
exact adjoint or transpose of the forward projector. Such situations are common
in large-scale computed tomography, and we consider the common situation where
the method does not converge due to the nonsymmetry of the iteration matrix. We
propose a modified algorithm that incorporates a small shift parameter, and we
give the conditions that guarantee convergence of this method to a fixed point
of a slightly perturbed problem. We also give perturbation bounds for this
fixed point. Moreover, we discuss how to use Krylov subspace methods to
efficiently estimate the leftmost eigenvalue of a certain matrix to select a
proper shift parameter. The modified algorithm is illustrated with test
problems from computed tomography
Some matrix nearness problems suggested by Tikhonov regularization
The numerical solution of linear discrete ill-posed problems typically
requires regularization, i.e., replacement of the available ill-conditioned
problem by a nearby better conditioned one. The most popular regularization
methods for problems of small to moderate size are Tikhonov regularization and
truncated singular value decomposition (TSVD). By considering matrix nearness
problems related to Tikhonov regularization, several novel regularization
methods are derived. These methods share properties with both Tikhonov
regularization and TSVD, and can give approximate solutions of higher quality
than either one of these methods
- …