Shearlet框架的构造和图像处理

本文指出了频域划分和拓扑群之间的联系,给出了构造shearlet框架的一般方法,并具体地构造出了-个衰减性良好的shearlet函数.在数值计算方面,本文提出了框架系数的计算方法和基于此方法的图像重构算法.最后的数值实验说明本文构造的shearlet在图像重构方面表现良好.     

构造Hermite插值“基函数”的方法

给出了一种构造Hermite插值"基函数"的方法,画出了"基函数"的构造图.借助于这组"基函数"的线性组合来求Hermite插值多项式,计算过程非常简单.之后,把这种求"基函数"的方法推广到了二元Hermite插值中,为二元Hermite插值"基函数"的构造提供了一种简单实用的方法.     

计算正定方程组的反问题特解的正交相似法

本文给出构造满足一定条件的正定方程组问题的一个特解的方法——正交相似法.写出和证明了构造特解的全部计算公式,并给出了计算实例。     

Fourier积分的数值计算法

本文建议采用样条函数插值作Fourier积分数值计算.同时,介绍了对几个一般函数采用各种不同的数值计算法的计算结果和构造样条函数的边界条件的简化处理方法.     

中值定理证明题中辅助函数构造的万能方法

在不少运用中值定理的证明题中辅助函数的构造总是需要学生的敏锐观察力和一定运气的,因而比较困难.本文创立了一种构造辅助函数的万能方法,并给予了方法可靠性的自明(非严格的证明).该方法在辅助函数的构造与微分方程的解之间建起了一座桥梁,使得可以通过微分方程的解去计算出辅助函数.文章最后说明了该方法还可以给一类微分方程提供一种近似解.     

二阶和四阶椭圆型偏微分方程的镜像基本解方法及应用

将基本解方法推广到二阶和四阶椭圆型偏微分方程的对称问题,在边界上不需要处理奇异积分.通过坐标变换,将一般二阶和四阶椭圆型偏微分方程化为目前研究较为成熟的调和或双调和方程.再根据镜像法构造出适合对称条件的基本解函数,简化了计算,且不影响计算的精度.通过数值计算结果可以看出,利用镜像技术构造出的基本解,前期准备数据少,可保持精度,是一种有效的数值方法.     

一类半线性椭圆方程柯西问题的正则化方法

构造并利用一种广义分数Tikhonov正则化方法研究一类半线性椭圆方程柯西问题.基于所构造的正则化解满足一个非线性积分方程,首先证明正则化解的存在唯一性和稳定性;继而在对精确解的先验假设下给出并证明正则化方法的收敛性;最后设计一种迭代算法计算正则化解,并通过相应的计算结果验证了所提方法的稳定可行性.     

求解二维Poisson方程的重心插值配点法

采用重心Lagrange插值配点法计算了二维Poisson方程.采用重心Lagrange插值法构造近似函数,由配点法离散Poisson方程及其边界条件.数值算例表明方法具有理论简单、计算精度高的特点.     

一类可调的插值向量样条——PB 样条曲线

在几何外形的计算机辅助设计中,已有的用于插值的三次样条曲线一般都是整体构造,计算上表现为需要求解一个三对角方程组,不易于局部修改.本文利用轴向任意的抛物线调配的方法,构造了一种可控制的空间插值三次参数样条——PB 样条曲线.它的特点是几何不变,构造局部,计算简单不需要迭代反解,保凸性能较好,局部修改方便,并可拓广到曲面的插值中去.文中分析了它的几何性质和保凸条件,得出了光顺性定理,并提出了调整参量 λ_i 进行局部修改消除多余拐点和控制形状的方法.根据本文的算法编制的程序 NNP 用于构造曲线取得了良好的效果.     

一种有理插值型求积公式的收敛性

构造一种有理插值型求积公式,证明其收敛性,并给出数值计算实例.该方法推广了Sloan和Smith等人的结果.     

Takens—Bogdanov分岐点的分裂迭代算法

本文构造分裂迭代算法用于计算Takens-Bogdanov分岐点,该方法将减少计算的工作量和占用的内存,可以调节的速度线性收敛,并且可以求得Takens-Bogdanov分岐点处fx^及fx^0的广义零特征向量,数值计算说明了算法的有效性。     

THE NUMERICAL COMPUTATION OF SYMMETRY-BREAKING TAKENS-BOGDANOV POINTS

A splitting iteration method is proposed to compute symmetry-breaking Takens-Bog-danov points. The method could reduce the computational work and storage, it could also converge linearly with an adjustable speed, Numerical computation shows the effectiveness of splitting iteration method.     

基于超效率DEA-IAHP的物流企业绩效评价

本文在介绍超效率数据包络分析法及区间数层次分析法的原理和模型,深入研究DEA-AHP评价方法的基础上,提出了超效率DEA-IAHP方法对物流企业绩效进行评价,改进方法引入超效率DEA方法和区间层次分析法弥补了原方法的不足,其中超效率数据包络分析法弥补了原方法不能对效率均为1的决策单元有效排序的问题,可以对所有决策单元进行总排序;区间层次分析法使用区间数判断矩阵来表达各指标因素对总目标的相对重要程度,这有效地解决了决策者因为对物流企业信息掌握不全而导致的点判断矩阵不可靠的问题,更好地体现了决策者偏好。笔者给出了应用超效率DEA-IAHP方法对物流企业进行绩效评价的基本步骤,并用实例分析体现了该方法的实用性及优越性。     

Estimation of return values of wave height: consequences of missing observations

Extreme-value statistics is often used to estimate so-called return values (actually related to quantiles) for environmental quantities like wind speed or wave height. A basic method for estimation is the method of block maxima which consists in partitioning observations in blocks, where maxima from each block could be considered independent. Typically a block could be chosen as one year. Large portions of missing data could result in problems for estimation and seems to be an issue not highlighted in detail in the literature. The method of block maxima is here applied to real data and a related simulation study was performed, pointing out that substantially low values tend to increase the estimated return values. A plausible explanation is given by studying the redistribution of probability mass and the implications of this for the behaviours of the tails of distributions.     

双圆弧扦值算法又一法——坐标法

本文介绍的方法是用坐标来进行计算 ,既方便 ,又可行 .用一组首尾相接彼此相切的园弧段去逼近给定的曲线使机床切割的机件或计算机绘制的图形进一步满足精度要求 .     

Node-based smoothed radial point interpolation method for electromagnetic-thermal coupled analysis

The node-based smoothed radial point interpolation method for solving the transient responses of magneto-electro-elastic structures in thermal environment is proposed. Considering the coupling relations between the elasticity, magnetism, electricity and heat, the generalized displacement (displacement, electric potential and magnetic potential) is calculated using the modified Newmark method. G space theory and the weakened weak formulation are applied to derive the equations of node-based smoothed radial point interpolation method for the magneto-electro-thermo-elastic multi-physics coupling problems. We use triangular background meshes as they could be generated more easily for structures with complex geometry. In some cases, they could even be created automatically. Detailed numerical study has shown that node-based smoothed radial point interpolation method not only successfully overcomes the overly-stiff behavior in the FEM and provides more accurate results, but also works well with distorted meshes. Therefore, the node-based smoothed radial point interpolation method could be adopted to solve the magneto-electro-thermo-elastic multi-physics coupling problems in practical engineering.     

多指标面板数据融合聚类分析

针对多指标面板数据的样品分类和历史时期划分问题,从多元统计分析理论角度提出一个多指标面板数据的融合聚类分析方法。该方法改进了多指标面板数据的因子分析和系统聚类方法,依据Fisher有序聚类理论,构造了Frobenius范数形式的离差平方和函数,提出了多指标面板数据的有序聚类方法。实证结果表明,该方法能够满足系统分析的统一性要求,保证指标之间的不相关;能够克服时间维度上均值处理造成的偏误,信息损失较少;能够解决面板数据有序聚类的问题;弥补了单一分析的片面性和局限性。     

Application of gradient descent method to the sedimentary grain-size distribution fitting

Existence of a least squares solution for a sum of several weighted normal functions is proved. The gradient descent (GD) method is used to fit the measured data (i.e. the laser grain-size distribution of the sediments) with a sum of three weighted lognormal functions. The numerical results indicate that the GD method is not only easy to operate but also could effectively optimize the parameters of the fitting function with the error decreasing steadily. Meanwhile the overall fitting results are satisfactory. As a new way of data fitting, the GD method could also be used to solve other optimization problems.     

梯度下降法在沉积物粒度分布拟合中的应用

结合实测数据,以三个对数正态分布函数的和函数为拟合函数,以梯度下降法为主要方法,对沉积物粒度分布进行了数据拟合,通过数值实验我们发现:利用梯度下降法可以有效地优化分布函数的各参数,实现拟合残差的稳步持续减小,具有良好的可操作性,拟合效果是令人满意的,它为我们进行数据拟合提供了一条新的思路,同时此方法也可以推广到解决其他极值问题.     

On relaxation methods for systems of linear inequalities

In their classical papers Agmon and Motzkin and Schoenberg introduced a relaxation method to find a feasible solution for a system of linear inequalities. So far the method was believed to require infinitely many iterations on some problem instances since it could (depending on the dimension of the set of feasible soltions) converge asymptotically to a feasible solution, if one exists. Hence it could not be used to determine infeasibility.Using two lemma's basic to Khachian's polynomially bounded algorithm we can show that the relaxation method is finite in all cases and thus can handle infeasible systems as well. In spite of more refined stopping criteria the worst case behaviour of the relaxation method is not polynomially bounded as examplified by a class of problems constructed here.