基于基样条局部逼近散乱数据拟合中的Shepard方法

本文针对散乱数据拟合的shepard方法,提出了一种局部逼近的新方法.该方法以局部三次基样条函数作为Shepard公式中的权函数,新的权函数具有良好的衰减性和二阶连续性,从而改进了传统方法的不足之处,使实际应用效果更好.     

复杂外形设计中的C^1,C^2样条插值曲面

根据几种复杂外形设计的特点，木文构造了三角形域上Ｓ１２样条插值曲面，三角形域上的Ｃ２超限插值曲面，矩形参数域上Ｃ２超限插值曲面和任意四边形域上双三次Ｃ１，Ｃ２样条插值曲面，给出了一类有效的边界条件确定方法．同时，算法皆已应用到人体外形描述和飞机外形设计中．     

C~k连续的保形分段2k次多项式插值

1．引言在每个子区间上，通过插入至多一个内结点，Brodlie和Butt［1］给出了分段三次多项式保形插值算法，Randal［2］等讨论了分段五次多项式插值，作者［31讨论了一般分段奇次多项式的保形插值，并且给1了内结点的位置范围公式．这种插值方法完全解决了一般的分段奇次多项式的保形插值问题．关于分段偶次多项式的保形插值，大多数文献只讨论分段二次保形插值，这里要特别指出的是Shumake［4j导出了二次样条保凸的充要条件，并且给出了一个二次样条保形插值的方法．在每一个子区间上至多插入一个内结点，则一个二次插值样条就可得到．作…     

一种四次有理插值样条及其逼近性质

1引言有理样条函数是多项式样条函数的一种自然推广,但由于有理样条空间的复杂性,所以有关它的研究成果不象多项式样条那样完美,许多问题还值得进一步的研究．近几十年来,有理插值样条,特别是有理三次有理插值样条,由于它们在曲线曲面设计中的应用,已有许多学者进行了深入研究,取得了一系列的成果(见[1]-[7])．但四次有理插值样条由于其构造所花费的计算量太大以及在使用上很不方便而让人们忽视了其重要的应用价值,因此很少有人研究他们．实际上,在某些情况下四次有理插值样条有其独特的应用效果,如文[8]建立的一种具有局部插值性质的分母为二次的四次有理样条,即一个剖分     

几种有理插值函数的逼近性质

1　引　　言在曲线和曲面设计中,样条插值是有用的和强有力的工具.不少作者已经研究了很多种类型的样条插值[1,2,3,4].近些年来,有理插值样条,特别是三次有理插值样条,以及它们在外型控制中的应用,已有了不少工作[5,6,7].有理插值样条的表达式中有某些参数,正是由于这些参数,有理插值样条在外型控制中充分显示了它的灵活性;但也正是由于这些参数,使它的逼近性质的研究增加了困难.因此,关于有理插值样条的逼近性质的研究很少见诸文献.本文在第二节首先叙述几种典型的有理插值样条,其中包括分母为一次、二次的三次有理插值样条和仅基于函数值…     

一类基于l1模的最佳二次样条插值

本文讨论了二次样条插值的定解条件,在l_1模意义下给出了一类最佳二次样条插值的概念,以及寻找最佳二次样条插值的定解条件的方法.最后讨论了误差估计问题,并给出了实际算例.     

基于三次样条插值函数的非线性动力系统数值求解

三次样条插值函数具有良好的收敛性、稳定性与二阶光滑性.研究了借助三次样条插值函数构造的非线性动力系统数值求解方法,分析了该方法与已有的非线性动力系统数值求解方法的优缺点,刻画了误差估计且给出了数值算例.结果表明基于三次样条插值函数构造的数值方法比已有的方法收敛速度快、逼近精度高且能够很好地逼近非线性动力系统的解析解.     

一种新的带参数双三次有理插值样条的有界性与点控制

文[19]中,作者构造了一种基于函数值的带参数的分子为双三次、分母为双二次的二元有理插值样条.本文进一步研究该种二元有理插值样条的有界性,给出插值的逼近表达式,讨论插值曲面形状的点控制问题.在插值条件不变的情况下,插值区域内任一点插值函数的值可以根据设计的需要通过对参数的选取修改,从而达到插值曲面局部修改的目的.     

分数年龄生存函数的估计

本文主要讨论了生存函数的插值问题,使用了非节点端点的三次样条插值和α-power插值两种方法对生存函数进行了插值,并与传统的三种插值假设：死亡均匀分布假设、常数死亡力假设、Balducci假设做了比较.另外,我们对α-power插值中的α进行了拟合,并通过误差分析表明先对α拟合后再进行α-power插值,其插值的误差将会变得非常小,几乎与样条插值相仿.     

关于广义逆的向量连分式插值样条

本文首次引入了关于广义逆的向量有理插值样条的概念．这类插值样条具有Thiele型连分式的截断分式的表现形式．在它的构造过程中,不必用到连分式的三项递推关系,本文得到的新的有效的系数算法具有递推运算的特点．存在性的一个充分条件得以建立．包括唯一性在内的有关插值问题的某些结果得到证明．最后,本文给出了一个精确的插值误差公式．     

Apportionment methods

Most democratic countries use apportionment methods to transform election results into whole numbers, which usually give the number of seats in a legislative body that the parties obtained. Which apportionment method does this best can be specified by measuring the error between the allocated result and the ideal proportion. We show how to find an apportionment method which is best suited to a given error function. We also discuss several properties of apportionment methods that have been labelled paradoxa. In particular we explain the highly publicised “Alabama” Paradox for the Hare/Hamilton method and show that other popular apportionment methods come with their very own paradoxa.     

A new structured quasi-Newton algorithm using partial information on Hessian

This paper presents a modified quasi-Newton method for structured unconstrained optimization. The usual SQN equation employs only the gradients, but ignores the available function value information. Several researchers paid attention to other secant conditions to get a better approximation of the Hessian matrix of the objective function. Recently Yabe et al. (2007) [6] proposed the modified secant condition which uses both gradient and function value information in order to get a higher-order accuracy in approximating the second curvature of the objective function. In this paper, we derive a new progressive modified SQN equation, with a vector parameter which use both available gradient and function value information, that maintains most properties of the usual and modified structured quasi-Newton methods. Furthermore, local and superlinear convergence of the algorithm is obtained under some reasonable conditions.     

关于构造数学物理中非线性发展方程组孤波解的一种新算法

根据改进的sine-cosine法和吴文俊消元法,给出了一种构造非线性发展方程组孤波解的新算法。这种算法比已知的双曲函数法有更好的结论,并且在使用的过程中更简单。借助于MATH-EMATICA软件,这一算法能够在计算机上实现。     

Shepard-Lagrange算子的逼近

本文建立了Shepard-Lagrange算子逼近的正逆定理,证明了可以利用高阶光滑模来刻画Shepard-Lagrange算子的逼近性质.从而说明了Shepard-Lagrange算子比一般的Shepard算子具有更好的逼近性质.进一步,所用光滑模的阶梯函数非常广泛,这是多项式逼近所不具有的.     

An efficient algorithm for large scale global optimization of continuous functions

A fast descent algorithm, resorting to a “stretching” function technique and built on one hybrid method (GRSA) which combines simulated annealing (SA) algorithm and gradient based methods for large scale global optimizations, is proposed. Unlike the previously proposed method in which the original objective functions remain unchanged during the whole course of optimization, the new method firstly constructs an auxiliary function on one local minimizer obtained by gradient based methods and then SA is executed on this constructed auxiliary function instead of on the original objective function in order that we can improve the jumping ability of SA algorithm to escape from the currently discovered local minimum to a better one from which the gradient based methods restart a new local search. The above procedure is repeated until a global minimum is detected. In addition, corresponding to the adopted “stretching” technique, a new next trial point generating scheme is designed. It is verified by simulation especially on large scale problems that the convergence speed is greatly accelerated, which is its main difference from many other reported methods that mostly cope with functions with less than 50 variables and does not apply to large scale optimization problems. Furthermore, the new algorithm functions as a global optimization procedure with a high success probability and high solution precision.     

A nonmonotone conic trust region method based on line search for solving unconstrained optimization

In this paper, we present a nonmonotone conic trust region method based on line search technique for unconstrained optimization. The new algorithm can be regarded as a combination of nonmonotone technique, line search technique and conic trust region method. When a trial step is not accepted, the method does not resolve the trust region subproblem but generates an iterative point whose steplength satisfies some line search condition. The function value can only be allowed to increase when trial steps are not accepted in close succession of iterations. The local and global convergence properties are proved under reasonable assumptions. Numerical experiments are conducted to compare this method with the existing methods.     

A COLUMN-SECANT UPDATE TECHNIQUE FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

In this paper,we present a column-secant modification of the SCC method,which is called the CSSCC method.The CSSCC method uses function values more efficiently than the SCC method,and it is shown that the CSSCC method has better local q-convergence and r-convergence rates than the SCC method.The numerical results show that the CSSCC method is competitive with some well known methods for some standard test problems.     

一个二元插值函数的连续性与可导性

给了三维空间上的N个数据点(x_1,y_1,z_1),(x_2,y_2,z_2),…,(x_N,y_N,z_N),这些数据点可能是观察得到的实验数据,也可能是科技计算中得来的离散数据;就其物理背景来说,可以是大地测量中各观察点的高度;海洋的深度;温度场中各点的温度;气象测量中各地的气压;建筑物体各点的压力等等。根据这些离散的数据点,用计算机绘制等值线图时,首先必须通过这些数据点去拟合一个光滑曲面。也就是要建立一个满足条件     

解一类二阶延迟常微分方程连续RKN方法的P-稳定性

In this paper, we study the P-stability of the continuous Runge-Kutta Nystroem method for solving the delayed second order differential equation that does not depend on y′. A general theorem is presented which can be used to obtain complete characterizations of the P-stability regions of these continuous RungeKutta- Nystroem methods. We use the condition to two given RKN methods.