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

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

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

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

用Tikhonov正则化方法求一阶和两阶的数值微分

Numerical differentiation is an ill-posed problem, which is important in scientific research and practical applications.In this paper, we use the Tikhonov regularization method to discuss the first and secord order derivatives of a smooth function. The error estimate is also given. And the numerical results prove that our method is applicable.     

一类奇异积分的正则化方法

本文给出了一类奇异积分的一个正则化方法     

一种基于积分方程的数值微分方法

本文研究了目前一些求解数值微分的方法无法求出端点导数或是求出的端点附近导数不可用的问题.利用构造一类积分方程的方法,将数值微分问题转化为这类积分方程的求解,并用一种加速的迭代正则化方法来求解积分方程. 数值实验结果表明该算法可以有效求出端点的导数,且具有数值稳定、计算简单等优点.     

散乱数据的数值微分及其误差估计

1 背景及问题的提出 导数是数学分析中的一个基本的慨念。对于数学工作者来讲,计算导数不是一项特别困难的工作。但是,对于研究实际问题的科学工作者来讲,这项工作就不是一件简单的工作了,首先,求导数的问题是一个典型的Hadamard意义下的不适定问题([5],[12]等)     

球面上$\ell_1$正则优化的随机临近梯度方法

本文研究球面上的$\ell_1$正则优化问题,其目标函数由一般光滑函数项和非光滑$\ell_1$正则项构成,且假设光滑函数的随机梯度可由随机一阶oracle估计.这类优化问题被广泛应用在机器学习,图像、信号处理和统计等领域.根据流形临近梯度法和随机梯度估计技术,提出一种球面随机临近梯度算法.基于非光滑函数的全局隐函数定理,分析了子问题解关于参数的Lipschtiz连续性,进而证明了算法的全局收敛性.在基于随机数据集和实际数据集的球面$\ell_1$正则二次规划问题、有限和SPCA问题和球面$\ell_1$正则逻辑回归问题上数值实验结果显示所提出的算法与流形临近梯度法、黎曼随机临近梯度法相比CPU时间上具有一定的优越性.     

关于一类广义Tikhonov 正则化方法的饱和效应分析

Tikhonov正则化方法是研究不适定问题最重要的正则化方法之一,但由于这种方法的饱和效应出现的太早,使得无法随着对解的光滑性假设的提高而提高正则逼近解的收敛率,也即对高的光滑性假设,正则解与准确解的误差估计不可能达到阶数最优.Schrroter T 和Tautenhahn U给出了一类广义Tikhonov正则化方法并重点讨论了它的最优误差估计, 但却未能对该方法的饱和效应进行研究.本文对此进行了仔细分析,并发现此方法可以防止饱和效应,而且数值试验结果表明此方法计算效果良好.     

基于迭代正则化高斯-牛顿法的非线性Urysohn积分方程数值解

非线性Urysohn积分方程在许多领域中都有广泛的应用,但由于该方程具有不适定性的特点,数据的微小扰动可能导致解的巨大变化,给数值求解带来很大困难.为了获得稳定的、准确的数值解,本文利用迭代正则化高斯-牛顿法对此方程进行求解,给出了利用Sigmoid-型函数确定迭代正则化参数的方法.对一类重力测定问题进行了数值模拟,将得到的数值解和相应的精确解作比较.结果表明,本文提出的方法在求解非线性Urysohn积分方程时是可行的也是有效的.     

介质导电率成像数值反演的正则化方法

磁共振技术(MREIT)是一种新的医学成像技术,它利用介质内部的部分磁场信息来重建介质内部的导电率.本文对调和Bz反演算法,提出了利用样条插值函数来处理误差输入数据的正则化方法,并给出了正则化方法的误差估计,在此基础上,我们还考虑了调和Bz算法对多个导电率异常的算法实现,检验了该方法对误差输入数据借助于正则化方法可能达到的空间分辨率,本文的工作为调和Bz算法利用实测的误差数据提供了一条可行的途径.     

Ramanujan''s $\,_1\psi_1$ 公式的新证明

In this paper, we give a short proof of the celebrated Ramanujan＇s1ψ1 Formula.     

基于Legendre多项式的数值微分: 加权$L^2$空间中的收敛性分析

We consider the problem of estimating the derivative of a function f from its noisy version fδby using the derivatives of the partial sums of Fourier-Legendre series of f~δ. Instead of the observation L~2 space, we perform the reconstruction of the derivative in a weighted L~2 space. This takes full advantage of the properties of Legendre polynomials and results in a slight improvement on the convergence order. Finally, we provide several numerical examples to demonstrate the efficiency of the proposed method.     

从$Q_{k}(p,q)$空间到加权$\alpha-Bloch$空间的加权复合微分后置和前置算子

We study the boundedness and compactness of the weighted composition followed and proceeded by differentiation operators from Q_k（p,q）space to weighted α-Bloch space and little weighted α-Bloch space.Some necessary and sufficient conditions for the boundedness and compactness of these operators are given.     

圈的$L(d_1,d_2,\ldots,d_t)$-数$\lambda(C_n;d_1,d_2,\ldots,d_t)$

An L（d0,d2,...,dt）-labeling of a graph G is a function f from its vertex set V（G） to the set {0,1,..., k} for some positive integer k such that If（x） - f（y）l ≥di, if the distance between vertices x and y in G is equal to i for i = 1,2,...,t. The L（d1,d2,...,dt）-number λ（G;d1,d2,... ,dt） of G is the smallest integer number k such that G has an L（d1,d2,...,dr）- labeling with max{f （x）｜x ∈ V（G）} = k. In this paper, we obtain the exact values for λ（Cn; 2, 2, 1） and λ（Cn; 3, 2, 1）, and present lower and upper bounds for λ（Cn; 2,..., 2, 1,..., 1）     

The Numerical Stability of the $\theta$-Method for Delay Differential Equations with Many Variable Delays

This paper deals with the asymptotic stability of theoretical solutions and numerical methods for the delay differential equations (DDEs)where $a, b_1, b_2, ... b_m$ and $y_0 \in C, 0 < \lambda_m \le \lambda_{m-1} \le ... \le \lambda_1<1$. A sufficient condition such that the differential equations are asymptotically stable is derived. And it is shown that the linear $\theta$-method is $\bigwedge GP_m$-stable if and only if$\frac{1}{2}\le \theta \le 1$.     

一种带噪声的周期函数数值微分方法

本文利用Thkhonov正则化方法讨论了带有噪声离散数据的周期函数的数值微分问题,证明了该方法存在唯一的三次周期样条函数解,并给出了其误差估计,而且从理论和数值例子说明了此方法的有效性．     

$\theta$型Calderon-Zygmund核的多线性奇异积分极大算子的$L^{p}$-有界性

研究了$\theta$型Calderon-Zygmund核的多线性奇异积分极大算子, 证明了这类极大算子的$L^{p}$-有界性.     

Hilbert空间上$\alpha$-次预解算子族的生成元特征

In 2000,Shi and Feng gave the characteristic conditions for the generation of C0semigroups on a Hilbert space.In this paper,we will extend them to the generation of α-times resolvent operator families.Such characteristic conditions can be applied to show rank-1 perturbation theorem and relatively-bounded perturbation theorem for α-times resolvent operator families.     

$\mathbb{Z}^{k}$-作用一维子系统的Lipschitz跟踪性

本文主要研究了$\mathbb{Z}^{k}$-作用一维子系统的跟踪性质. 文中运用两种等价的方式引入了$\mathbb{Z}^{k}$-作用一维子系统的伪轨以及跟踪性的概念. 对于一个闭黎曼流形上的光滑$\mathbb{Z}^{k}$-作用$T$, 我们通过诱导的非自治动力系统提出了Anosov方向的概念. 借助Bowen几何的方法, 我们证明了$T$沿着任意Anosov方向具有Lipschitz跟踪性.     

Beyond sparsity: Recovering structured representations by ${\ell}^1$ minimization and greedy algorithms

Finding a sparse approximation of a signal from an arbitrary dictionary is a very useful tool to solve many problems in signal processing. Several algorithms, such as Basis Pursuit (BP) and Matching Pursuits (MP, also known as greedy algorithms), have been introduced to compute sparse approximations of signals, but such algorithms a priori only provide sub-optimal solutions. In general, it is difficult to estimate how close a computed solution is from the optimal one. In a series of recent results, several authors have shown that both BP and MP can successfully recover a sparse representation of a signal provided that it is sparse enough, that is to say if its support (which indicates where are located the nonzero coefficients) is of sufficiently small size. In this paper we define identifiable structures that support signals that can be recovered exactly by minimization (Basis Pursuit) and greedy algorithms. In other words, if the support of a representation belongs to an identifiable structure, then the representation will be recovered by BP and MP. In addition, we obtain that if the output of an arbitrary decomposition algorithm is supported on an identifiable structure, then one can be sure that the representation is optimal within the class of signals supported by the structure. As an application of the theoretical results, we give a detailed study of a family of multichannel dictionaries with a special structure (corresponding to the representation problem ) often used in, e.g., under-determined source sepa-ration problems or in multichannel signal processing. An identifiable structure for such dictionaries is defined using a generalization of Tropp’s Babel function which combines the coherence of the mixing matrix with that of the time-domain dictionary , and we obtain explicit structure conditions which ensure that both minimization and a multi-channel variant of Matching Pursuit can recover structured multichannel representations. The multichannel Matching Pursuit algorithm is described in detail and we conclude with a discussion of some implications of our results in terms of blind source separation based on sparse decompositions. Communicated by Yuesheng Xu