求解病态问题的一种改进的Tikhonov正则化--(1)正则化方法的建立

对于带有右端扰动数据的第一类紧算子方程的病态问题 ,本文应用正则化子建立了一类新的正则化求解方法 ,称之为改进的Tikonov正则化 ;通过适当选取正则参数 ,证明了正则解具有最优的渐近收敛阶 .与通常的Tikhonov正则化相比 ,这种改进的正则化可使正则解取到足够高的最优渐近阶     

A quasi-residual principle in regularization for a common solution of a system of nonlinear monotone ill-posed equations

In this paper we study the Browder–Tikhonov regularization method for finding a common solution for a system of nonlinear ill-posed equations with potential, hemicontinuous and monotone mappings in Banach spaces. We give a principle, named quasi-residual, to choose a value of the regularization parameter and an estimate of convergence rates for the regularized solutions.     

Regularized collocation method for Fredholm integral equations of the first kind

In this paper we consider a collocation method for solving Fredholm integral equations of the first kind, which is known to be an ill-posed problem. An “unregularized” use of this method can give reliable results in the case when the rate at which smallest singular values of the collocation matrices decrease is known a priori. In this case the number of collocation points plays the role of a regularization parameter. If the a priori information mentioned above is not available, then a combination of collocation with Tikhonov regularization can be the method of choice. We analyze such regularized collocation in a rather general setting, when a solution smoothness is given as a source condition with an operator monotone index function. This setting covers all types of smoothness studied so far in the theory of Tikhonov regularization. One more issue discussed in this paper is an a posteriori choice of the regularization parameter, which allows us to reach an optimal order of accuracy for deterministic noise model without any knowledge of solution smoothness.     

Optimal order results for a class of regularization methods using unbounded operators

A class of regularization methods using unbounded regularizing operators is considered for obtaining stable approximate solutions for ill-posed operator equations. With an a posteriori as well as an a priori parameter choice strategy, it is shown that the method yields the optimal order. Error estimates have also been obtained under stronger assumptions on the generalized solution. The results of the paper unify and simplify many of the results available in the literature. For example, the optimal results of the paper include, as particular cases for Tikhonov regularization, the main result of Mair (1994) with an a priori parameter choice, and a result of Nair (1999) with an a posteriori parameter choice. Thus the observations of Mair (1994) on Tikhonov regularization of ill-posed problems involving finitely and infinitely smoothing operators is applicable to various other regularization procedures as well. Subsequent results on error estimates include, as special cases, an optimal result of Vainikko (1987) and also some recent results of Tautenhahn (1996) in the setting of Hilbert scales.     

On a terminal value problem for a generalization of the fractional diffusion equation with hyper-Bessel operator

In this paper, we consider an inverse problem of recovering the initial value for a generalization of time-fractional diffusion equation, where the time derivative is replaced by a regularized hyper-Bessel operator. First, we investigate the existence and regularity of our terminal value problem. Then we show that the backward problem is ill-posed, and we propose a regularizing scheme using a fractional Tikhonov regularization method. We also present error estimates between the regularized solution and the exact solution using two parameter choice rules.     

Two regularization methods for a spherically symmetric inverse heat conduction problem

In this paper, we consider a spherically symmetric inverse heat conduction problem of determining the internal surface temperature of a hollow sphere from the measured data at a fixed location inside it. This is an ill-posed problem in the sense that the solution (if it exists) does not depend continuously on the data. A Tikhonov type’s regularization method and a Fourier regularization method are applied to formulate regularized solutions which are stably convergent to the exact ones with order optimal error estimates.     

改进的Tikhonov 正则化及其正则解的最优渐近阶估计

对于算子与右端都有扰动的第一类算子方程建立了一类新的正则化方法(称为改进的 Ｔｉｋｈｏｎｏｖ正则化)．应用紧算子的奇异系统和广义 Ａｒｃａｎｇｅｌｉ方法后验选取正则参数,证明了正则解具有最优的渐近阶并给出了相应的算例分析．     

Convergence rates of iterated Tikhonov regularized solutions of nonlinear III — posed problems

Summary In this paper we investigate iterated Tikhonov regularization for the solution of nonlinear ill-posed problems. In the case of linear ill-posed problems it is well-known that (under appropriate assumptions) then-th iterated regularized solutions can converge likeO(²² /(2n+1)), where denotes the noise level of the data perturbation. We give conditions that guarantee this convergence rate also for nonlinear ill-posed problems, and motivate these conditions by the mapping degree. The results are derived by a comparison of the iterated regularized solutions of the nonlinear problem with the iterated regularized solutions of its linearization. Numerical examples are presented.Supported by the Austrian Fonds zur Förderung der wissenschaftlichen Forschung,project P-7869 PHY, and by the Christian Doppler Society     

Morozov's discrepancy principle for tikhonov

In this paper severely ill-posed problems are studied which are represented in the form of linear operator equations with infinitely smoothing operators but with solutions having only a finite smoothness. It is well known, that the combination of Morozov's discrepancy principle and a finite dimensional version of the ordinary Tikhonov regularization is not always optimal because of its saturation property. Here it is shown, that this combination is always order-optimal in the case of severely ill-posed problems.     

Convergence results of a modified regularized gradient method for nonlinear ill-posed problems

A modified iteratively regularized gradient method and its continuous version are proposed for nonlinear ill-posed problems, in which the Tikhonov regularization term is generated by a linear operator. The linear operator may have some physical meaning. And by employing the linear operator, scaling the problem can be avoided in the case that the nonlinear operator in the problem has larger gradient. Adopting a posteriori and a priori stopping rule respectively, we establish the convergence results by using a modified approximate source condition. The numerical results show that the linear operator effects the performance greatly.     

Regularization properties of the sequential discrepancy principle for Tikhonov regularization in Banach spaces

The stable solution of ill-posed non-linear operator equations in Banach space requires regularization. One important approach is based on Tikhonov regularization, in which case a one-parameter family of regularized solutions is obtained. It is crucial to choose the parameter appropriately. Here, a sequential variant of the discrepancy principle is analysed. In many cases, such parameter choice exhibits the feature, called regularization property below, that the chosen parameter tends to zero as the noise tends to zero, but slower than the noise level. Here, we shall show such regularization property under two natural assumptions. First, exact penalization must be excluded, and secondly, the discrepancy principle must stop after a finite number of iterations. We conclude this study with a discussion of some consequences for convergence rates obtained by the discrepancy principle under the validity of some kind of variational inequality, a recent tool for the analysis of inverse problems.     

Examples of Saturated Convergence Rates for Tikhonov Regularization

Tikhonov regularization is one of the most popular methods for solving linear operator equations of the first kind Au = f with bounded operator, which are ill-posed in general (Fredholm's integral equation of the first kind is a typical example). For problems with inexact data (both the operator and the right-hand side) the rate of convergence of regularized solutions to the generalised solution u ₊ (i.e.the minimal-norm least-squares solution) can be estimated under the condition that this solution has the source form: u ₊ im(A*A). It is well known that for Tikhonov regularization the highest-possible worst-case convergence rates increase with only for some values of , in general not greater than one. This phenomenon is called the saturation of convergence rate. In this article the analysis of this property of the method with a criterion of a priori regularization parameter choice is presented and illustrated by examples constructed for equations with compact operators.This revised version was published online in October 2005 with corrections to the Cover Date.     

The trade-off between regularity and stability in Tikhonov regularization

When deriving rates of convergence for the approximations generated by the application of Tikhonov regularization to ill-posed operator equations, assumptions must be made about the nature of the stabilization (i.e., the choice of the seminorm in the Tikhonov regularization) and the regularity of the least squares solutions which one looks for. In fact, it is clear from works of Hegland, Engl and Neubauer and Natterer that, in terms of the rate of convergence, there is a trade-off between stabilization and regularity. It is this matter which is examined in this paper by means of the best-possible worst-error estimates. The results of this paper provide better estimates than those of Engl and Neubauer, and also include and extend the best possible rate derived by Natterer. The paper concludes with an application of these results to first-kind integral equations with smooth kernels.

     

REGULARIZATION METHOD FOR IMPROVING OPTIMAL CONVERGENCE RATE OF THE REGULARIZED SOLUTION OF ILL-POSED PROBLEMS

1IntroductionThestudyoflllallymathematicalphysicsproblemsleadstosolvingoperatorequatiollsofthefirstkind,andtheoperatorequatiollsofthefirstkindaretypicallyill--posedprobellis[1,2,3,4].Themethodsforsolvillgill-posedproblellishavebeenstudiedbyagreatnumberofresearchers.WementionTikhonovandArsellill[2],Morozov[3]IGroetscll[4],Engll51,HouandLi['],ChenandHouI7]alldoillerscholars.Illtheirresearches,they11avediscussedtheproblemoffindingstableapproxilllatesolutiollsand11aveillvestigatedtileconverge…     

Some results on the regularization of LSQR for large-scale discrete ill-posed problems

LSQR, a Lanczos bidiagonalization based Krylov subspace iterative method, and its mathematically equivalent conjugate gradient for least squares problems (CGLS) applied to normal equations system, are commonly used for large-scale discrete ill-posed problems. It is well known that LSQR and CGLS have regularizing effects, where the number of iterations plays the role of the regularization parameter. However, it has long been unknown whether the regularizing effects are good enough to find best possible regularized solutions. Here a best possible regularized solution means that it is at least as accurate as the best regularized solution obtained by the truncated singular value decomposition (TSVD) method. We establish bounds for the distance between the k-dimensional Krylov subspace and the k-dimensional dominant right singular space. They show that the Krylov subspace captures the dominant right singular space better for severely and moderately ill-posed problems than for mildly ill-posed problems. Our general conclusions are that LSQR has better regularizing effects for the first two kinds of problems than for the third kind, and a hybrid LSQR with additional regularization is generally needed for mildly ill-posed problems. Exploiting the established bounds, we derive an estimate for the accuracy of the rank k approximation generated by Lanczos bidiagonalization. Numerical experiments illustrate that the regularizing effects of LSQR are good enough to compute best possible regularized solutions for severely and moderately ill-posed problems, stronger than our theory predicts, but they are not for mildly ill-posed problems and additional regularization is needed.     

Error estimates for large-scale ill-posed problems

The computation of an approximate solution of linear discrete ill-posed problems with contaminated data is delicate due to the possibility of severe error propagation. Tikhonov regularization seeks to reduce the sensitivity of the computed solution to errors in the data by replacing the given ill-posed problem by a nearby problem, whose solution is less sensitive to perturbation. This regularization method requires that a suitable value of the regularization parameter be chosen. Recently, Brezinski et al. (Numer Algorithms 49, 2008) described new approaches to estimate the error in approximate solutions of linear systems of equations and applied these estimates to determine a suitable value of the regularization parameter in Tikhonov regularization when the approximate solution is computed with the aid of the singular value decomposition. This paper discusses applications of these and related error estimates to the solution of large-scale ill-posed problems when approximate solutions are computed by Tikhonov regularization based on partial Lanczos bidiagonalization of the matrix. The connection between partial Lanczos bidiagonalization and Gauss quadrature is utilized to determine inexpensive bounds for a family of error estimates. In memory of Gene H. Golub. This work was supported by MIUR under the PRIN grant no. 2006017542-003 and by the University of Cagliari.     

解第一类算子方程的一种新的正则化方法

对算子与右端都为近似给定的第一类算子方程提出一种新的正则化方法，依据广义Ａｒｃａｎｇｅｌｉ方法选取正则参数，建立了正则解的收敛性。这种新的正则化方法与通常的Ｔｉｋｈｏｎｏｖ正则化方法相比较，提高了正则解的渐近阶估计。     

Approximation of Solution Components for Ill-Posed Problems by the Tikhonov Method with Total Variation

An ill-posed problem in the form of a linear operator equation given on a pair of Banach spaces is considered. Its solution is representable as a sum of a smooth and a discontinuous component. A stable approximation of the solution is obtained using a modified Tikhonov method in which the stabilizer is constructed as a sum of the Lebesgue norm and total variation. Each of the functionals involved in the stabilizer depends only on one component and takes into account its properties. Theorems on the componentwise convergence of the regularization method are stated, and a general scheme for the finite-difference approximation of the regularized family of approximate solutions is substantiated in the n-dimensional case.     

Numerical differentiation from a viewpoint of regularization theory

In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.

     

L1 regularization method in electrical impedance tomography by using the L1-curve (Pareto frontier curve)

Electrical impedance tomography (EIT), as an inverse problem, aims to calculate the internal conductivity distribution at the interior of an object from current-voltage measurements on its boundary. Many inverse problems are ill-posed, since the measurement data are limited and imperfect. To overcome ill-posedness in EIT, two main types of regularization techniques are widely used. One is categorized as the projection methods, such as truncated singular value decomposition (SVD or TSVD). The other categorized as penalty methods, such as Tikhonov regularization, and total variation methods. For both of these methods, a good regularization parameter should yield a fair balance between the perturbation error and regularized solution. In this paper a new method combining the least absolute shrinkage and selection operator (LASSO) and the basis pursuit denoising (BPDN) is introduced for EIT. For choosing the optimum regularization we use the L1-curve (Pareto frontier curve) which is similar to the L-curve used in optimising L2-norm problems. In the L1-curve we use the L1-norm of the solution instead of the L2 norm. The results are compared with the TSVD regularization method where the best regularization parameters are selected by observing the Picard condition and minimizing generalized cross validation (GCV) function. We show that this method yields a good regularization parameter corresponding to a regularized solution. Also, in situations where little is known about the noise level σ, it is also useful to visualize the L1-curve in order to understand the trade-offs between the norms of the residual and the solution. This method gives us a means to control the sparsity and filtering of the ill-posed EIT problem. Tracing this curve for the optimum solution can decrease the number of iterations by three times in comparison with using LASSO or BPDN separately.