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.

     

正则参数求解的微分进化算法

研究了正则化方法中正则参数的求解问题,提出了利用微分进化算法获取正则参数.微分进化算法属于全局最优化算法,具有鲁棒性强、收敛速度快、计算精度高的优点.把正则参数的求解问题转化为非线性优化问题,通过保持在解空间不同区域中各个点的搜索,以最大的概率找到问题的全局最优解,同时还利用数值模拟将此方法与广义交叉原理、L-曲线准则、逆最优准则等进行了对比,数值模拟结果表明该方法具有一定的可行性和有效性.     

一阶数值微分的局部正则化方法

本文研究了一阶数值微分问题,将其等价转化为第一类积分方程的求解问题,给出了求解该问题的局部正则化方法.在精确导数的一定假设条件下,讨论了正则化参数的先验选取策略及相应近似导数的误差估计.相对于经典的正则化方法,数值实验表明局部正则化方法能在有效抑制噪声的同时,保证近似导数逼近精确导数的效果,尤其是在精确导数有间断或急剧变化时.     

A new variant of L-curve for Tikhonov regularization

In this paper we introduce a new variant of L-curve to estimate the Tikhonov regularization parameter for the regularization of discrete ill-posed problems. This method uses the solution norm versus the regularization parameter. The numerical efficiency of this new method is also discussed by considering some test problems.     

Numerical differentiation by radial basis functions approximation

Based on radial basis functions approximation, we develop in this paper a new com-putational algorithm for numerical differentiation. Under an a priori and an a posteriori choice rules for the regularization parameter, we also give a proof on the convergence error estimate in reconstructing the unknown partial derivatives from scattered noisy data in multi-dimension. Numerical examples verify that the proposed regularization strategy with the a posteriori choice rule is effective and stable to solve the numerical differential problem. *The work described in this paper was partially supported by a grant from CityU (Project No. 7001646) and partially supported by the National Natural Science Foundation of China (No. 10571079).     

Multi-parameter Tikhonov Regularization—An Augmented Approach

We study multi-parameter regularization （multiple penalties） for solving linear inverse problems to promote simultaneously distinct features of the sought-for objects. We revisit a balancing principle for choosing regularization parameters from the viewpoint of augmented Tikhonov regularization, and derive a new parameter choice strategy called the balanced discrepancy principle. A priori and a posteriori error estimates are provided to theoretically justify the principles, and numerical algorithms for efficiently implementing the principles are also provided. Numerical results on deblurring are presented to illustrate the feasibility of the balanced discrepancy principle.     

Tikhonov Regularization of Large Linear Problems

Many numerical methods for the solution of linear ill-posed problems apply Tikhonov regularization. This paper presents a new numerical method, based on Lanczos bidiagonalization and Gauss quadrature, for Tikhonov regularization of large-scale problems. An estimate of the norm of the error in the data is assumed to be available. This allows the value of the regularization parameter to be determined by the discrepancy principle.     

解不适定问题的快速多层方法

Many industrial and engineering applications require numerically solving ill-posed problems. Regularization methods are employed to find approximate solutions of these problems. The choice of regularization parameters by numerical algorithms is one of the most important issues for the success of regularization methods. When we use some discrepancy principles to determine the regularization parameter,     

A Regularized Iterative Scheme for Solving Nonlinear Ill-Posed Problems

In this article, we consider a regularized iterative scheme for solving nonlinear ill-posed problems. The convergence analysis and error estimates are derived by choosing the regularization parameter according to both a priori and a posteriori methods. The iterative scheme is stopped using an a posteriori stopping rule, and we prove that the scheme converges to the solution of the well-known Lavrentiev scheme. The salient features of the proposed scheme are: (i) convergence and error estimate analysis require only weaker assumptions compared to standard assumptions followed in literature, and (ii) consideration of an adaptive a posteriori stopping rule and a parameter choice strategy that gives the same convergence rate as that of an a priori method without using the smallness assumption, the source condition. The above features are very useful from theory and application points of view. We also supply the numerical results to illustrate that the method is adaptable. Further, we compare the numerical result of the proposed method with the standard approach to demonstrate that our scheme is stable and achieves good computational output.     

A numerical method for solving nonlinear ill-posed problems

A two-step iterative process for the numerical solution of nonlinear problems is suggested. In order to avoid the ill-posed inversion of the Fréchet derivative operator, some regularization parameter is introduced. A convergence theorem is proved. The proposed method is illustrated by a numerical example in which a nonlinear inverse problem of gravimetry is considered. Based on the results of the numerical experiments practical recommendations for the choice of the regularization parameter are given. Some other iterative schemes are considered.     

基于混沌粒子群算法的Tikhonov正则化参数选取

Tikhonov正则化方法是求解不适定问题最为有效的方法之一,而正则化参数的最优选取是其关键.本文将混沌粒子群优化算法与Tikhonov正则化方法相结合,基于Morozov偏差原理设计粒子群的适应度函数,利用混沌粒子群优化算法的优点,为正则化参数的选取提供了一条有效的途径.数值实验结果表明,本文方法能有效地处理不适定问题,是一种实用有效的方法.     

L-曲线估计确定正则参数的双网格迭代法

本文考虑对不适定问题离散化得到的大规模不适定线性方程组进行Tiknonov正则化,然后用双网格迭代法求解得到的Tikhonov正则化方程组,并用L-曲线估计法来确定正则参数.试验问题的数值结果表明双网格迭代法求解正则化后的对称正定线性方程组效果很好,且L-曲线估计法确定正则参数计算量很小.     

Iterative implementation of the adaptive regularization yields optimality

The adaptive regularization method is first proposed by Ryzhikov et al. for the deconvolution in elimination of multiples. This method is stronger than the Tikhonov regularization in the sense that it is adaptive, i.e. it eliminates the small eigenvalues of the adjoint operator when it is nearly singular. We will show in this paper that the adaptive regularization can be implemented iterately. Some properties of the proposed non-stationary iterated adaptive regularization method are analyzed. The rate of convergence for inexact data is proved. Therefore the iterative implementation of the adaptive regularization can yield optimality.     

Central difference regularization method for inverse source problem on the Poisson equation

In this paper, we consider an inverse problem of determining an unknown source for the Poisson equation. Since this problem is mildly ill-posed, we apply a central difference regularization method to solve this problem. Furthermore, the convergence estimate is established under a priori choice of the regularization parameter. Some numerical results verify that the proposed method is stable and effective.     

基于正则化方法的一个新型数值微分算法

1引言 根据带误差的测量数据重构函数使其微分能较好的拟合精确函数微分,是一个有重要意义的研究课题,在图像处理、计算机视觉和计算力学等领域中均有应用[2,3,4]. 如果测量数据没有误差,上述问题可归结于一维函数的拟合问题,常规的方法有Lagrange插值法和样条函数方法等[5];也有直接的数值微分计算公式[6,7].这些方法的计算结果都较好.     

A Regularized Newton-Like Method for Nonlinear PDE

An adaptive regularization strategy for stabilizing Newton-like iterations on a coarse mesh is developed in the context of adaptive finite element methods for nonlinear PDE. Existence, uniqueness and approximation properties are known for finite element solutions of quasilinear problems assuming the initial mesh is fine enough. Here, an adaptive method is started on a coarse mesh where the finite element discretization and quadrature error produce a sequence of approximate problems with indefinite and ill-conditioned Jacobians. The methods of Tikhonov regularization and pseudo-transient continuation are related and used to define a regularized iteration using a positive semidefinite penalty term. The regularization matrix is adapted with the mesh refinements and its scaling is adapted with the iterations to find an approximate sequence of coarse-mesh solutions leading to an efficient approximation of the PDE solution. Local q-linear convergence is shown for the error and the residual in the asymptotic regime and numerical examples of a model problem illustrate distinct phases of the solution process and support the convergence theory.     

Adaptive parameter choice for one-sided finite difference schemes and its application in diabetes technology

In this paper we discuss the problem of approximation of the first derivative of a function at the endpoint of its definition interval. This problem is motivated by diabetes therapy management, where it is important to provide estimations of the future blood glucose trend from current and past measurements. A natural way to approach the problem is to use one-sided finite difference schemes for numerical differentiation, but, following this way, one should be aware that the values of the function to be differentiated are noisy and available only at given fixed points. Then (as we argue in the paper) the number of used point values is the only parameter to be employed for regularization of the above mentioned ill-posed problem of numerical differentiation. In this paper we present and theoretically justify an adaptive procedure for choosing such a parameter. We also demonstrate some illustrative tests, as well as the results of numerical experiments with simulated clinical data.     

On stable numerical differentiation

A new approach to the construction of finite-difference methods is presented. It is shown how the multi-point differentiators can generate regularizing algorithms with a stepsize being a regularization parameter. The explicitly computable estimation constants are given. Also an iteratively regularized scheme for solving the numerical differentiation problem in the form of Volterra integral equation is developed.

     

Lavrentiev's regularization method for nonlinear ill-posed equations in Banach spaces

In this paper, we deal with nonlinear ill-posed problems involving m-accretive mappings in Banach spaces. We consider a derivative and inverse free method for the implementation of Lavrentiev regularization method. Using general H¨older type source condition we obtain an optimal order error estimate. Also we consider the adaptive parameter choice strategy proposed by Pereverzev and Schock(2005) for choosing the regularization parameter.     

Recovering the local volatility in Black–Scholes model by numerical differentiation

In this article, a numerical method for recovering the local volatility in Black–Scholes model is proposed based on the Dupire formula in which the numerical derivatives are used. By Tikhonov regularization, a new numerical differentiation method in two-dimensional (2-D) case is presented. The convergent analysis and numerical examples are also given. It shows that our method is efficient and stable.