隐式极限状态方程可靠性研究

针对非线性隐式极限状态方程失效概率的计算,提出了精度更高的改进的均值二次法,并提出了与响应面法相结合的改进均值法,给出了所提方法的实现策略．具体算例表明,改进的均值二次法的精度较改进的均值一次法有明显提高,而改进均值法与响应面法结合后的精度改善更为明显,并且这种结合方法对响应面法的插值点位置不敏感,插值点在较大范围内变化均能得到稳健的高精度结果,从而说明所提方法的有效性．     

(0,M)插值的推广

本文对周期为2ψ的函数引入了一类新的函数插值并建立了插值的收敛速度估计．通常的Birkhoff插值是该插值的极限情形．     

同位网格界面速度插值方法研究

讨论了同位网格下,离散的连续性方程、动量方程及标量方程中控制容积界面上速度的计算方法．分别采用动量插值技术和线性插值技术计算了动量方程和标量方程的离散系数中的界面速度,并将两种方法得到的计算结果进行了比较．指出当采用线性插值技术去计算离散方程系数中的界面速度时,离散系数中的质量残余必须等于0,这样才能保证数值解的准确性和计算的收敛速度．     

分数阶光滑函数线性和二次插值公式余项估计

本文在局部分数阶导数定义的基础上给出了高阶局部分数阶导数定义,并据此得到了一般形式的分数阶Taylor公式.用该公式给出了分数阶光滑函数线性和二次插值公式余项的表达式,并进一步导出了分段线性插值的收敛阶估计.针对分数阶导数临界阶计算困难的问题,本文利用线性插值余项设计了一种外推算法,能够比较准确地求出函数在某点的局部分数阶导数的临界阶.最后通过编写算法的Mathematica程序,验证了理论分析的正确性,并用实例说明了算法的有效性.     

第二类两端奇异Fredholm积分方程的分数阶线性插值方法

考虑第二类两端奇异的Fredholm积分方程,假设核函数在区间的两个端点非光滑,存在分数阶的Taylor展开式.对于这种类型的核函数,在包含端点的小区间上采用分数阶插值,在剩余区间上采用分段线性插值逼近,由此得到一种分数阶线性插值退化核方法.本文讨论该方法收敛的条件,给出收敛阶估计.数值算例表明这种分数阶混合线性插值方法对于两端奇异核函数有着较好的计算效果.     

拟线性Sobolev方程Carey元解的高精度分析

在一种半离散格式下讨论了拟线性Sobolev方程Carey元的超收敛及外推.根据Carey元的构造证明了其有限元解的线性插值与三角形线性元的解相同,再结合线性元的高精度分析和插值后处理技巧导出了超逼近和整体超收敛及后验误差估计.与此同时,根据线性元的误差渐近展开式,构造了一个新的辅助问题,得到了比传统的有限元误差高三阶的外推结果.     

结构可靠性分析的支持向量机方法

针对结构可靠性分析中功能函数不能显式表达的问题,将支持向量机方法引入到结构可靠性分析中．支持向量机是一种实现了结构风险最小化原则的分类技术,它具有出色的小样本学习性能和良好的泛化性能,因此提出了两种基于支持向量机的结构可靠性分析方法．与传统的响应面法和神经网络法相比,支持向量机可靠性分析方法的显著特点是在小样本下高精度地逼近函数,并且可以避免维数灾难．算例结果也充分表明支持向量机方法可以在抽样范围内很好地逼近真实的功能函数,减少隐式功能函数分析（通常是有限元分析）的次数,具有一定的工程实用价值．     

插值法在数据修正中的应用

为了使评估的结果达到某种规定的水平,本文研究了运用线性插值、拉格朗日插值以及牛顿插值方法对某公司员工考核数据按照一定的规则进行了修正,同时,对各种方法的修正前、后的结果做了比较．结果表明拉格朗日插值法效果最好,但是计算量偏大;线性插值法虽然效果一般,但是计算复杂度却较低;而牛顿插值法达不到我们预期的效果．     

非定常扩散方程基于调和平均点插值的有限体积格式

本文研究非定常扩散方程适用于扭曲和非结构网格的单元中心型的有限体积格式.在网格边上离散法向流时,选取当前网格边及与其相邻网格边上的调和平均点作为辅助插值点,通过它们与单元中心点不同的组合形式给出4类法向流的离散近似,最后通过调和平均点的两点插值算法,将其替换成相邻单元的中心未知量,进而建立4种单元中心型有限体积格式.时间导数项采用向后Euler格式进行离散.该格式具有模板小、易实现的优点,满足局部守恒和二阶收敛的特性.在一定网格假设前提下,理论上证明了算法的稳定性和收敛性.数值上考虑扩散系数是连续的、间断的、各向异性的甚至依赖于未知量是非线性的等情形,分别在非结构三角形、四边形和多边形网格上进行求解.结果表明,前两种算法对不同网格不同类型扩散系数问题上的鲁棒性更好, L2误差均可达到二阶收敛, H1误差接近一阶甚至高于一阶收敛;后两种算法对网格的依赖性更强.     

结构动力响应中急动度的计算

急动度(jerk)在工程实践中具有重要的意义.将径向基函数逼近与配点法相结合,发展了一种能够有效求解动力响应的数值算法.该方法使用径向基函数插值来逼近真实的运动规律,能够用于急动度和急动度(三阶)方程的计算,弥补了传统的数值方法无法计算急动度的不足.并针对微分方程的特点,提出了改进的多变量联合插值函数,同时添加与微分方程同阶的初值条件,可显著减小数值震荡.算例表明,该方法具有计算过程简单、精度高的特点,同时对急动度方程也有很好的适用性.     

多模式广义失效概率计算的数值模拟法及其工程应用

提出了安全与失效状态含有模糊信息时,广义失效概率计算的数值模拟,及相应的方差估算,并提出了对应的数值积分方法．当状态变量服从正态分布,且其对模糊安全域的隶属函数为正态型时,单个模式的广义失效概率具有精确解．首先利用这种特殊情况检验了所提数值模拟的精度,结果表明对于数值模拟法,随抽样次数的增加,估计值逐渐收敛于真实值．然后利用扩展原理和概率定理,提出两个及两个以上失效模式数广义失效概率的数值模拟计算方法以及相应的数值积分方法．对于工程结构问题,一般在删除次要失效模式之后,主要失效模式的数目不会太多,因此用该数值模拟与数值积分法可以得到精度较高的解．工程算例结果证明了此结论．另外还对所提的两种方法的适用范围做了讨论．     

Extraction of characteristic points and its fractal reconstruction for terrain profile data

The main objective of this paper is to study reduction rate of 2D DEM (digital elevation model) data profile after data reduction by the Douglas–Peucker (DP) linear simplification method and by fractal interpolation to show original terrain reconstruction. In this paper, two-dimensional data of measured geographic profiles are taken as the study object, by using the DP method and the improved Douglas–Peucker (IDP) method to reduce data. Its aim is to retain spatial linear characteristics and variations, then take reduced data points as basic points and use the random fractal interpolation approach to add more data points up to the same as the original data points, in order to reconstruct the terrain, and compare the experimental data with the random point extraction method addressed in related literature. This paper uses tolerance calibration to generate different reduction rates and utilizes four types of evaluation factors, statistical measurement, image measurement, spectral analysis and elevation cumulative probability distribution graph, to make a quantitative analysis of profile variation. The study result indicates that real profile elevation data, manipulated with varied reduction approaches, then reconstructed by means of fractal interpolation can produce data points with a higher resolution than those originally observed, thereby the reconstructed profile gets more natural and real details.     

Multigrid technique for biharmonic interpolation with application to dual and multiple reciprocity method

A biharmonic-type interpolation method is presented to solve 2D and 3D scattered data interpolation problems. Unlike the methods based on radial basis functions, which produce a large linear system of equations with fully populated and often non-selfadjoint and ill-conditioned matrix, the presented method converts the interpolation problem to the solution of the biharmonic equation supplied with some non-usual boundary conditions at the interpolation points. To solve the biharmonic equation, fast multigrid techniques can be applied which are based on a non-uniform, non-equidistant but Cartesian grid generated by the quadtree/octtree algorithm. The biharmonic interpolation technique is applied to the multiple and dual reciprocity method of the BEM to convert domain integrals to the boundary. This makes it possible to significantly reduce the computational cost of the evaluation of the appearing domain integrals as well as the memory requirement of the procedure. The resulting method can be considered as a special grid-free technique, since it requires no domain discretisation. This revised version was published online in June 2006 with corrections to the Cover Date.     

List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques

A new interpolation-based decoding principle for interleaved Gabidulin codes is presented. The approach consists of two steps: First, a multi-variate linearized polynomial is constructed which interpolates the coefficients of the received word and second, the roots of this polynomial have to be found. Due to the specific structure of the interpolation polynomial, both steps (interpolation and root-finding) can be accomplished by solving a linear system of equations. This decoding principle can be applied as a list decoding algorithm (where the list size is not necessarily bounded polynomially) as well as an efficient probabilistic unique decoding algorithm. For the unique decoder, we show a connection to known unique decoding approaches and give an upper bound on the failure probability. Finally, we generalize our approach to incorporate not only errors, but also row and column erasures.     

Smooth surface reconstruction via natural neighbour interpolation of distance functions

We present an algorithm to reconstruct smooth surfaces of arbitrary topology from unorganised sample points and normals. The method uses natural neighbour interpolation, works in any dimension and accommodates non-uniform samples. The reconstructed surface interpolates the data points and is implicitly represented as the zero set of some pseudo-distance function. It can be meshed so as to satisfy a user-defined error bound, which makes the method especially relevant for small point sets. Experimental results are presented for surfaces in .     

Determining knots by optimizing the bending and stretching energies

For a given set of data points in the plane, a new method is presented for computing a parameter value (knot) for each data point. Associated with each data point, a quadratic polynomial curve passing through three adjacent consecutive data points is constructed. The curve has one degree of freedom which can be used to optimize the shape of the curve. To obtain a better shape of the curve, the degree of freedom is determined by optimizing the bending and stretching energies of the curve so that variation of the curve is as small as possible. Between each pair of adjacent data points, two local knot intervals are constructed, and the final knot interval corresponding to these two points is determined by a combination of the two local knot intervals. Experiments show that the curves constructed using the knots by the new method generally have better interpolation precision than the ones constructed using the knots by the existing local methods.     

Bivariate spline interpolation at grid points

Summary. We describe algorithms for constructing point sets at which interpolation by spaces of bivariate splines of arbitrary degree and smoothness is possible. The splines are defined on rectangular partitions adding one or two diagonals to each rectangle. The interpolation sets are selected in such a way that the grid points of the partition are contained in these sets, and no large linear systems have to be solved. Our method is to generate a net of line segments and to choose point sets in these segments which satisfy the Schoenberg-Whitney condition for certain univariate spline spaces such that a principle of degree reduction can be applied. In order to include the grid points in the interpolation sets, we give a sufficient Schoenberg-Whitney type condition for interpolation by bivariate splines supported in certain cones. This approach is completely different from the known interpolation methods for bivariate splines of degree at most three. Our method is illustrated by some numerical examples. Received October 5, 1992 / Revised version received May 13, 1994     

Block Based Bivariate Blending Rational Interpolation via Symmetric Branched Continued Fractions

This paper constructs a new kind of block based bivariate blending rational interpolation via symmetric branched continued fractions. The construction process may be outlined as follows. The first step is to divide the original set of support points into some subsets (blocks). Then construct each block by using symmetric branched continued fraction. Finally assemble these blocks by Newton’s method to shape the whole interpolation scheme. Our new method offers many flexible bivariate blending rational interpolation schemes which include the classical bivariate Newton’s polynomial interpolation and symmetric branched continued fraction interpolation as its special cases. The block based bivariate blending rational interpolation is in fact a kind of tradeoff between the purely linear interpolation and the purely nonlinear interpolation. Finally, numerical examples are given to show the effectiveness of the proposed method.