奇异摄动问题最优阶一致收敛的间断有限元分析

采用非对称内罚间断有限元方法(以下简称NIPG方法)求解一维对流扩散型奇异摄动问题.理论上证明了采用拉格朗日线性元的NIPG方法在Bakhvalov-Shishkin网格上具有最优阶的一致收敛性,即在能量范数度量下其误差估计为O(N~(-1)),其中N为网格剖分中单元个数.数值算例验证了理论分析的正确性.     

核范数和谱范数下广义Sylvester方程最小二乘问题的有效算法

本文从数值角度讨论Schatten q-范数下的广义Sylvester方程约束最小二乘问题min x∈s‖N∑i=1A_iXB_i—C‖_q,其中S为闭凸约束集合,Schatten q-范数定义为‖M‖_q~q=∑_(i=1)~nσ_i~q(M),其中σ_i(M)为M∈R~(n×n)的奇异值.该问题的几类特殊情形在图像处理、控制论等领域有广泛的应用.q=2即Frobenius范数下该问题已被充分研究,故本文着重讨论q=1,+∞,即核范数和谱范数下该问题的数值求解.采用的数值方法是非精确标准容易执行的部分非精确交替方向法,并结合奇异值阈值算法,Moreau-Yosida正则化算法,谱投影算法和LSQR算法等求解相应子问题.给出算法的收敛性证明,并用数值算例验证其高效可行性.     

稀疏优化在数独中的应用

数独是一个难以求解的整数规划问题,可以通过实数编码的方式去除整数约束的限制,将整数规划模型转化为一个l0范数极小化模型.已有算法大多是求解松弛的l1范数极小化模型,只能求解部分数独问题.本文证明对于数独这样一个特殊的问题,lq(0＜q＜1)范数极小化模型等价于l0范数极小化模型,同时用l1/2-SLP(sequenti...     

分层网格上奇异摄动问题的一致NIPG分析

本文采用非对称内罚间断有限元方法(以下简称NIPG方法)求解一维对流扩散型奇异摄动问题.理论上证明了采用拉格朗日线性元的NIPG方法在分层网格上至多相差一个关于摄动参数对数因子的拟最优阶的一致收敛性,即在能量范数度量下其误差估计为O((log~2(1/e))/N),其中N为网格剖分中单元个数.数值算例验证了理论分析的正确性.     

求解离散不适定问题的正则化GMERR方法

迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法.     

分裂可行问题的1-范数正则化方法

主要研究了分裂可行问题的1-范数正则化.首先利用1-范数正则化方法,将分裂可行问题转化为无约束优化问题.其次讨论了1-范数正则化解的若干性质,并给出了求解1-范数正则化解的邻近梯度算法.最后通过数值试验验证了算法的可行性和有效性.     

基于l1-l2范数的块稀疏信号重构

压缩感知(compressed sensing,CS) 是一种全新的信息采集与处理的理论框架,借助信号内在的稀疏性或可压缩性,可以从小规模的线性、非自适应的测量中通过求解非线性优化问题重构原信号.块稀疏信号是一种具有块结构的信号,即信号的非零元是成块出现的.受YIN Peng-hang, LOU Yi-fei, HE Qi等提出的l_1-2范数最小化方法的启发,将基于l₁-l₂范数的稀疏重构算法推广到块稀疏模型,证明了块稀疏模型下l₁-l₂范数的相关性质,建立了基于l₁-l₂范数的块稀疏信号精确重构的充分条件,并通过DCA(difference of convex functions algorithm) 和ADMM(alternating direction method of multipliers)给出了求解块稀疏模型下l₁-l₂范数的迭代方法.数值实验表明,基于l₁-l₂范数的块稀疏重构算法比其他块稀疏重构算法具有更高的重构成功率.     

求解病态线性方程组的预处理精细积分法

为降低病态线性方程组系数矩阵的条件数,根据矩阵行(列)均衡的思想,提出行(列)的1-范数均衡法,并扩展为范数均衡法.然后,将范数均衡法与精细积分法相结合,给出求解病态线性方程组的范数均衡预处理精细积分法.数值结果表明,经过范数均衡预处理后精细积分法求解病态方程的精度(有效数字增加5个以上)和效率(迭代次数降低15次左右)均能得到显著提高,适用范围在一定程度上也有所扩展.在上述方法中,以1-范数均衡预处理精细积分法效果最为显著.     

流线扩散有限元方法在分层网格上的收敛性分析

本文在分层网格上分析了采用线性元的流线扩散有限元方法求解一维对流扩散型奇异摄动问题的一致收敛性.在ε≤N~(-1)的前提下,可以证明在SD范数下的一致误差估计为O(N~(-1)(log 1/ε)~2)在数值算例部分对理论结果进行了验证.     

矩阵SR分解R因子新的扰动界

矩阵的SR分解是求解一些优化控制问题的有效工具,如用来求解代数Riccati方程.利用分块的矩阵-向量方程方法与Lyapunov控制函数和Banach不动点定理相结合的方法获得了SR分解R因子在范数型扰动下的范数型的严格扰动界和一阶扰动界,改进了已有结果.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Boundedness of commutators related to Marcinkiewicz integrals on hardy type spaces

In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 ＜β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 ＜α≤ 1).     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.