共查询到19条相似文献,搜索用时 125 毫秒
1.
2.
根据几种复杂外形设计的特点,木文构造了三角形域上S12样条插值曲面,三角形域上的C2超限插值曲面,矩形参数域上C2超限插值曲面和任意四边形域上双三次C1,C2样条插值曲面,给出了一类有效的边界条件确定方法.同时,算法皆已应用到人体外形描述和飞机外形设计中. 相似文献
3.
C~k连续的保形分段2k次多项式插值 总被引:4,自引:0,他引:4
1.引言在每个子区间上,通过插入至多一个内结点,Brodlie和Butt[1]给出了分段三次多项式保形插值算法,Randal[2]等讨论了分段五次多项式插值,作者[31讨论了一般分段奇次多项式的保形插值,并且给1了内结点的位置范围公式.这种插值方法完全解决了一般的分段奇次多项式的保形插值问题.关于分段偶次多项式的保形插值,大多数文献只讨论分段二次保形插值,这里要特别指出的是Shumake[4j导出了二次样条保凸的充要条件,并且给出了一个二次样条保形插值的方法.在每一个子区间上至多插入一个内结点,则一个二次插值样条就可得到.作… 相似文献
4.
一种四次有理插值样条及其逼近性质 总被引:3,自引:0,他引:3
1引言有理样条函数是多项式样条函数的一种自然推广,但由于有理样条空间的复杂性,所以有关它的研究成果不象多项式样条那样完美,许多问题还值得进一步的研究.近几十年来,有理插值样条,特别是有理三次有理插值样条,由于它们在曲线曲面设计中的应用,已有许多学者进行了深入研究,取得了一系列的成果(见[1]-[7]).但四次有理插值样条由于其构造所花费的计算量太大以及在使用上很不方便而让人们忽视了其重要的应用价值,因此很少有人研究他们.实际上,在某些情况下四次有理插值样条有其独特的应用效果,如文[8]建立的一种具有局部插值性质的分母为二次的四次有理样条,即一个剖分 相似文献
5.
几种有理插值函数的逼近性质 总被引:6,自引:1,他引:5
1 引 言在曲线和曲面设计中,样条插值是有用的和强有力的工具.不少作者已经研究了很多种类型的样条插值[1,2,3,4].近些年来,有理插值样条,特别是三次有理插值样条,以及它们在外型控制中的应用,已有了不少工作[5,6,7].有理插值样条的表达式中有某些参数,正是由于这些参数,有理插值样条在外型控制中充分显示了它的灵活性;但也正是由于这些参数,使它的逼近性质的研究增加了困难.因此,关于有理插值样条的逼近性质的研究很少见诸文献.本文在第二节首先叙述几种典型的有理插值样条,其中包括分母为一次、二次的三次有理插值样条和仅基于函数值… 相似文献
6.
本文讨论了二次样条插值的定解条件,在l_1模意义下给出了一类最佳二次样条插值的概念,以及寻找最佳二次样条插值的定解条件的方法.最后讨论了误差估计问题,并给出了实际算例. 相似文献
7.
8.
寇吉垚 《应用数学与计算数学学报》2010,24(2):119-123
本文主要讨论了生存函数的插值问题,使用了非节点端点的三次样条插值和α-power插值两种方法对生存函数进行了插值,并与传统的三种插值假设:死亡均匀分布假设、常数死亡力假设、Balducci假设做了比较.另外,我们对α-power插值中的α进行了拟合,并通过误差分析表明先对α拟合后再进行α-power插值,其插值的误差将会变得非常小,几乎与样条插值相仿. 相似文献
9.
关于广义逆的向量连分式插值样条 总被引:2,自引:1,他引:1
本文首次引入了关于广义逆的向量有理插值样条的概念.这类插值样条具有Thiele型连分式的截断分式的表现形式.在它的构造过程中,不必用到连分式的三项递推关系,本文得到的新的有效的系数算法具有递推运算的特点.存在性的一个充分条件得以建立.包括唯一性在内的有关插值问题的某些结果得到证明.最后,本文给出了一个精确的插值误差公式. 相似文献
10.
本文构造一类新的基于函数值和偏导数值的双变量加权混合有理插值样条.与已有的有理插值样条相比,这类新的有理插值样条具有以下四方面的特性,其一,插值函数可以由简单的对称基函数来表示;其二,对任何正参数,插值函数满足C1连续,而且,在不限制参数取值的条件之下,插值曲面保持光滑;其三,插值函数不但含有参数,而且带有加权系数,增加了插值函数的自由度;其四,插值曲面的形状随着参数与加权系数的变化而变化.同时,本文讨论此类插值曲面的性质,包括基函数的性质、积分加权系数的性质和插值函数的边界性质.此类插值函数的优势在于,不改变给定插值数据的前提下,通过选择合适的参数和不同的加权系数,对插值区域内的任意点的函数值进行修改.因此可将其应用于曲面设计,根据实际设计需要,自由地修改曲面形状.数值实验表明,此类新的有理样条插值具有良好的约束控制性质. 相似文献
11.
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. 相似文献
12.
Keyvan Amini Ashraf Ghorbani Rizi 《Journal of Computational and Applied Mathematics》2010,234(3):805-811
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. 相似文献
13.
关于构造数学物理中非线性发展方程组孤波解的一种新算法 总被引:2,自引:0,他引:2
根据改进的sine-cosine法和吴文俊消元法,给出了一种构造非线性发展方程组孤波解的新算法。这种算法比已知的双曲函数法有更好的结论,并且在使用的过程中更简单。借助于MATHEMATICA软件,这一算法能够在计算机上实现。 相似文献
14.
本文建立了Shepard-Lagrange算子逼近的正逆定理,证明了可以利用高阶光滑模来刻画Shepard-Lagrange算子的逼近性质.从而说明了Shepard-Lagrange算子比一般的Shepard算子具有更好的逼近性质.进一步,所用光滑模的阶梯函数非常广泛,这是多项式逼近所不具有的. 相似文献
15.
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. 相似文献
16.
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. 相似文献
17.
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. 相似文献
18.
一个二元插值函数的连续性与可导性 总被引:1,自引:0,他引:1
给了三维空间上的N个数据点(x_1,y_1,z_1),(x_2,y_2,z_2),…,(x_N,y_N,z_N),这些数据点可能是观察得到的实验数据,也可能是科技计算中得来的离散数据;就其物理背景来说,可以是大地测量中各观察点的高度;海洋的深度;温度场中各点的温度;气象测量中各地的气压;建筑物体各点的压力等等。根据这些离散的数据点,用计算机绘制等值线图时,首先必须通过这些数据点去拟合一个光滑曲面。也就是要建立一个满足条件 相似文献
19.
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. 相似文献