A SMOOTH C^1 INTERPOLATION FOR TWO-DIMENSIONAL CONTACT PROBLEMS USING PARAMETRIC CURVE TECHNIQUE

A smooth C^1 interpolation for two-dimensional contact problems using parametric curve technique was developed and implemented.The parametric curve can ensure C^1 continuity of the contact surfaces and provide a unique surface normal vector.Some numerical examples were used to illustrate the advantages of the newly developed representation of contact surface. The results reveal a significant improvement in the prediction of contact stresses and contact area.The predicted contact stresses are less sensitive to the mismatch in meshes of the different contacting bodies.

GLOBAL SMOOTHNESS PRESERVATION BY BIVARIATE INTERPOLATION OPERATORS

Extending the results of [4] in the univariate case, in this paper we prove that the bivariate interpolation polynomials of Hermite-Fejér based on the Chebyshev nodes of the first kind, those of Lagrange based on the Chebyshev nodes of second kind and ±1, and those of bivariate Shepard operators, have the property of partial preservation of global smoothness, with respect to various bivariate moduli of continuity.

A polynomial smooth epsilon-support vector regression based on cubic spline interpolation

Regression analysis is often formulated as an optimization problem with squared loss functions. Facing the challenge of the selection of the proper function class with polynomial smooth techniques applied to support vector regression models, this study takes cubic spline interpolation to generate a new polynomial smooth function ｜×｜ε^ 2, in g-insensitive support vector regression. Theoretical analysis shows that Sε^2 -function is better than pε^2 -function in properties, and the approximation accuracy of the proposed smoothing function is two order higher than that of classical pε^2 -function. The experimental data shows the efficiency of the new approach.

OPTIMAL ERROR BOUNDS FOR THE CUBIC SPLINE INTERPOLATION OF LOWER SMOOTH FUNCTIONS(1)

In this paper,the kernel of the cubic spline interpolation is given.An optimal error bound for the cu- bic spline interpolation of lower smooth functions is obtained.

OPTIMAL ERROR BOUNDS FOR THE CUBIC SPLINE INTERPOLATION OF LOWER SMOOTH FUNCTION(Ⅱ)

Abstract In this paper, by using the explicit expression of the kernel of the cubic spline interpolation, the optimal error bounds for the cubic spline interpolation of lower soomth functions are obtained.

A Study on Spatial Interpolation of Temperature in Anhui Province Based on ANUSPLIN

To achieve refined temperature grid data with high accuracy and high spatial resolution,hourly temperature grid dataset with spatial resolution of 1 km in Anhui Province from January to December in 2016 was established using the ANUSPLIN thin plate spline algorithm,which meets the needs of climate change research and meteorological disaster risk assessment. And the interpolation error was analyzed. The results show that the interpolated values of hourly temperature by ANUSPLIN are close to the observed values in 2016. The error is generally below 1. 5 ℃,and the root mean square error is 0. 937 6 ℃. On monthly scale,the interpolated values of hourly temperature by ANUSPLIN are also close to the observed values.In October,November,June and May,the interpolation accuracy is the highest,and the proportion of absolute error of hourly temperature lower than 2 ℃ is up to 99%,97. 4%,98. 1% and 97. 4% respectively. In February,March,August and December,the interpolation accuracy is the lowest,and the proportion of absolute error higher than 2 ℃ is 8. 1%,5. 3%,4. 1% and 4. 2% respectively. Due to the effect of complex topography in Anhui,the interpolation accuracy is the lowest in the mountainous areas of southern and western Anhui,and the interpolation error in these regions even exceeds 1. 5 ℃ annually and 1. 8 ℃ monthly.

A Universal Approach to Designing an Image Interpolator with an Image Smoothing Filter

A number of conventional interpolation techniques have been proposed. However, it seems that there do not exist good criteria for the design of optimal linear interpolators. Also, such an interpolator can hardly provide a satisfactory solution for interpolating noisy images. In this paper, the novelty of this research is that a universal approach is proposed to design an image interpolator with any one image smoothing filter, thereby not only interpolating a down-sampled image but also preserving the characteristics of the performing filtering.

A novel twice-interpolation finite element method for solid mechanics problems

Formulation and numerical evaluation of a novel twice-interpolation finite element method （TFEM） is presented for solid mechanics problems. In this method, the trial function for Galerkin weak form is constructed through two stages of consecutive interpolation. The primary interpolation follows exactly the same procedure of standard FEM and is further reproduced according to both nodal values and averaged nodal gradients obtained from primary interpolation. The trial functions thus constructed have continuous nodal gradients and contain higher order polynomial without increasing total freedoms. Several benchmark examples and a real dam problem are used to examine the TFEM in terms of accuracy and convergence. Compared with standard FEM, TFEM can achieve significantly better accuracy and higher convergence rate, and the continuous nodal stress can be obtained without any smoothing operation. It is also found that TFEM is insensitive to the quality of the elemental mesh. In addition, the present TFEM can treat the incompressible material without any modification.

Interpolation and approximation for data living on manifold surfaces

Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be recognized as data living on mani- fold surfaces. So interpolation and approximation for these data are of general interest. This paper presents two approaches for mani- fold data interpolation and approximation through the properties of Laplace-Beltrami operator （Laplace operator defined on a mani- fold surface）. The first one is to use Laplace operator minimizing the membrane energy of a scalar function defined on a manifold. The second one is to use bi-Laplace operator minimizing the thin plate energy of a scalar function defined on a manifold. These two approaches can process data living on high genus meshed surfaces. The approach based on Laplace operator is more suitable for manifold data approximation and can be applied manifold data smoothing, while the one based on bi-Laplace operator is more suit- able for manifold data interpolation and can be applied image extremal envelope computation. All the application examples demon- strate that our procedures are robust and efficient.

APPROXIMATION PROPERTIES OF LAGRANGE INTERPOLATION POLYNOMIAL BASED ON THE ZEROS OF (1-x^2)cosnarccosx

We study some approximation properties of Lagrange interpolation polynomial based on the zeros of （1-x^2）cosnarccosx. By using a decomposition for f（x） ∈ C^τC^τ＋1 we obtain an estimate of ‖f（x） -Ln＋2（f, x）‖ which reflects the influence of the position of the x＇s and ω（f^（r＋1）,δ）j,j = 0, 1,... , s,on the error of approximation.

极限下限分析的区域光滑径向点插值法

极限分析的高效数值计算方法在结构设计和安全评定中具有非常重要的作用.为了更加有效地求解极限分析问题,将区域光滑径向点插值法与二阶锥规划相结合,提出了理想弹塑性结构极限下限分析的一种新方法.将问题域离散为简单的三角形背景单元,每个单元进一步划分成若干个光滑域.为了将复杂的域积分转化为简单的边界积分,并且避免计算形函数的导数,采用广义梯度光滑技术对每个光滑域进行应变光滑处理.由于径向点插值法构造的形函数满足Kronecker delta性质,本质边界条件可以直接施加.依据下限定理,在满足以等效积分弱形式表达的自平衡应力场平衡条件的基础上,用二阶锥规划成功构建了极限分析下限法的计算模型,从而可方便地通过基于原始-对偶内点法的数学规划求解器MOSEK直接求解该问题.数值算例结果表明,本文所提方法有效地克服了维数障碍问题,具有较高的计算精度,并且计算结果对网格畸变十分不敏感.

Orlicz空间中二元多项式插值的逼近

该文研究Orlicz空间中以Lissajous-Chebyshev结点为插值结点的二元多项式插值逼近问题.借助Holder不等式,光滑模等基本工具,利用Marcinkiewicz-Zygmund不等式及最佳单边逼近首先给出了Orlicz空间中高阶插值逼近的逼近度,其次研究了在不同情况下的二元插值逼近问题,利用光滑模,有界变差函数的总变差及最佳多项式逼近的阶给出了二元插值逼近度的估计.

一种S型加减速组合的速度规划算法

针对传统NURBS曲线插补S型加减速的改进难以在加工柔性和加工效率上同时兼顾的问题,提出一种将多种S型加减速组合的速度规划算法。选取分别在加工柔性和加工效率上单独改进的两种S型加减速,并设计了一种兼顾柔性和效率的新改进S型加减速。在速度规划中,根据简化后的4种加减速形式,灵活组合这3种S型加减速,并采取合并曲线分段的速度平滑方式,减少了曲线段间的速度波动。仿真结果表明:该算法能在提高加工效率的同时满足加加速度的连续,最终实现加工柔性和加工效率的兼得。

数控代码中的特征数据识别与处理技术研究及实现

针对现有插补文献均缺乏对G01数控小线段识别处理细节的问题,提出了一种识别特征的滑动窗口法及相应的算法,将数控代码识别成直线、圆弧和自由曲线。给出了基于型值点的3次、5次NURBS分段光滑插值衔接所需的一、二阶导矢计算方法,使得各个特征之间能够达到GC1和GC2连续。运用5次NURBS插值曲线对自由曲线进行建模较3次NURBS插值曲线具有更好的连续性。对“S”样件的仿真实验与加工均验证了算法的可行性。对CNC插补计算和提高加工质量有参考价值。

局部可调的四次Catmull-Rom样条曲面及其形状优化

当控制顶点保持不变时,无法对三次Catmull-Rom样条曲面的形状进行局部调整。为满足实际工程对插值曲面形状设计的要求,给出了一种含局部参数的四次Catmull-Rom样条曲面,并讨论了2种对四次Catmull-Rom样条曲面形状进行优化的方案。结果表明,四次Catmull-Rom样条曲面不仅继承了三次Catmull-Rom样条曲面的插值性与连续性,而且容易利用所含的参数对曲面形状进行局部或整体调整,通过计算所含参数的最优值获得尽可能光顺和尽可能保形的四次Catmull-Rom样条曲面,为插值曲面的构造提供了方法。

基于五次B样条插值的机械臂路径平滑研究

针对机械臂路径规划后的轨迹平滑及角速度和角加速度的突变问题,提出五次B样条插值的机械臂路径平滑方法。通过MATLAB对机械臂建模,并对平滑后的轨迹进行仿真,得到轨迹、角度、角速度及角加速度图。通过与五次多项式和样条曲线对比,证明该算法能够提升机械臂角速度和角加速度的平滑性,保证起、止点速度加速度均为零,过控制点保证路径的有效性。该算法提升了机械臂运动的平顺性,降低运动冲击,为机械臂实物验证提供充分的理论支撑。

欠驱动无人船全局轨迹规划方法研究

针对大范围水域内传统全局轨迹规划算法收敛速度慢的问题,提出了基于高效收敛随机树与样条插值的欠驱动无人船全局轨迹规划方法。首先,引入目标区域偏置采样、动态步长扩展以及双向搜索策略,显著缩短渐近最优航路点的规划时间。其次,采用B样条插值技术拟合以上航路点,生成一条参数化路径,再利用期望速度与参数导数得到平滑轨迹,便于无人船跟踪。最后,开展综合的仿真研究,结果表明该方法在收敛速度上明显优于传统轨迹规划方法,且在规划轨迹的引导下,无人船能够安全、稳定地航行。

基于激光视觉的鞋底喷胶路径生成方法研究

为了实现鞋底喷胶的自动化,提出了一种基于激光视觉生成喷胶路径的方法。利用线激光三维扫描仪获取鞋底的深度图,并对其进行中值滤波处理。采用传统的边缘检测算法提取鞋底内边缘,然后针对其不足,提出了分区最大值算法。首先通过Moore边界追踪算法提取鞋底外边缘轮廓,然后利用质心定位算法获取鞋底外边缘轮廓的质心,再通过分区搜索最大值提取离散的内边缘点,最后采用NURBS插值算法对内边缘点进行插值处理,获取平滑的内边缘曲线。将平滑后的内边缘曲线向鞋底内侧偏置生成喷胶路径。文中介绍了系统的硬件组成和工作原理。试验结果表明,鞋底喷胶均匀,能够满足鞋底黏合要求,验证了该方法的有效性和可行性。

MFCDD优化三次样条平滑算法在继电器数据插值中的应用

继电器参数众多,并且对各参数的测量方式和测量间隔不同,释放电压等参数相较于时间参数等实时测量参数,数据量较少,在进行相关分析时会造成结果精度较差的情况。提出一种形态波动一致性偏移距离(MFCDD)优化的平滑指标改进三次样条插值算法。引入平滑指标改进,对数据序列相关点的方差贡献率及单点平滑度进行分析,确定数据序列的平滑点及波动点;采用三次指数平滑对三次样条算法进行改进,确定改进后的插值表达式;引入形态波动一致性偏移距离对插值间隔进行确定,完成数据扩充。采用继电器吸合电压参数和释放电压参数对上述方法进行验证,结果表明上述方法对数据扩充具有较好的准确性。

基于Hermite插值的仿真动态成像平滑过渡设计

针对实现与真实硬件一致的仿真效果的需求,提出了一种平滑过渡方法,旨在改善整个仿真系统的成像效果。通过对视觉暂留效应和系统成像延迟进行分析,采用两点三次Hermite插值法,分别处理平滑过渡时间和成像颜色。通过对比实验验证,结果表明该方法能使整个仿真系统的成像自适应平滑,解决了实时动态成像闪烁和不稳定的问题。实验结果表明,该方法提升了嵌入式微控制器的虚拟3D仿真实验系统的成像质量,能改善嵌入式微控制器三维仿真的视觉效果,并减轻突变和伪影等的影响,表明嵌入式微控制器的虚拟3D仿真实验系统在教育和设计领域的重要应用价值。