Tikhonov methods usually lead to solutions of low amplitude that are distributed around zero. When reconstructing transmembrane voltages (TMVs) in the myocardium, the signal is therefore often not in the physiological range of between around -80mV and 10mV. In this article, we propose an adjusted Tikhonov method that reconstructs TMVs in the correct range, given an estimate of one polarized nod...

The Tikhonov method is a famous technique for regularizing ill-posed linear problems, wherein a regularization parameter needs to be determined. This article, based on an invariant-manifold method, presents an adaptive Tikhonov method to solve ill-posed linear algebraic problems. The new method consists in building a numerical minimizing vector sequence that remains on an invariant manifold, an...

This paper addresses the numerical stability issue on the channelized Hotelling observer (CHO). The CHO is a well-known approach in the medical image quality assessment domain. Many researchers have found that the detection performance of the CHO does not increase with the number of channels, contrary to expectation. And to our knowledge, nobody in this domain has found the reason. We illustrat...

Model-based image reconstruction techniques yield better quantitative accuracy in photoacoustic image reconstruction. In this work, an exponential filtering of singular values was proposed for carrying out the image reconstruction in photoacoustic tomography. The results were compared with widely popular Tikhonov regularization, time reversal, and the state of the art least-squares QR-based rec...

A crucial problem concerning Tikhonov regularization is the proper choice of the regularization parameter. This paper deals with a generalization of a parameter choice rule due to Regińska (1996) [31], analyzed and algorithmically realized through a fast fixed-point method in Bazán (2008) [3], which results in a fixed-point method for multi-parameter Tikhonov regularization called MFP. Like the...

Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix-vector product evaluation...

We study multi-parameter Tikhonov regularization, i.e., with multiple penalties. Such models are useful when the sought-for solution exhibits several distinct features simultaneously. Two choice rules, i.e., discrepancy principle and balancing principle, are studied for choosing an appropriate (vector-valued) regularization parameter, and some theoretical results are presented. In particular, t...

Many numerical methods for the solution of linear ill-posed problems apply Tikhonov regularization. This paper presents a modification of a numerical method proposed by Golub and von Matt for quadratically constrained least-squares problems and applies it to Tikhonov regularization of large-scale linear discrete ill-posed problems. The method is based on partial Lanczos bidiagonalization and Ga...

This paper studies iterative learning control (ILC) for under-determined and over-determined systems, i.e., systems for which the control action to produce the desired output is not unique, or for which exact tracking of the desired trajectory is not feasible. For both cases we recommend the use of the pseudoinverse or its approximation as a learning operator. The Tikhonov regularization techni...

It is a common belief that Tikhonov scheme with ‖ · ‖L2 -penalty fails to reconstruct a sparse structure with respect to a given system {φi}. However, in this paper we present a procedure for sparsity reconstruction, which is totally based on the standard Tikhonov method. This procedure consists of two steps. At first Tikhonov scheme is used as a sieve to find the coefficients near φi, which ar...