共查询到20条相似文献,搜索用时 140 毫秒
1.
对特殊工件的磨削加工过程进行抽象、建模和求解.将砂轮和底座看成刚性坐标系,将工件所在的下台、中台、上台看成可平移旋转的变换坐标系,基于工件母线方程,以砂轮和工件母线相切为紧约束,运用平面坐标变换理论设计加工方案,并对方案进行了误差分析,最后考虑砂轮的实际磨损,分别提出圆柱形和轮式砂轮修整磨削策略. 相似文献
2.
分段三次保形插值法 总被引:1,自引:0,他引:1
方逵 《高等学校计算数学学报》1996,18(2):104-113
1 引言 计算机图形学的一个基本问题就是寻找一条光滑曲线过一组型值点{x_i,y_i}(i=0,1,…n+1),解决这一问题最简单的办法是用分段三次Hermite插值,这种插值构造容易,绘图简单. 分段三次Hermite插值的关键是估计型值点处的导数,只要估计出一组导数值,就对应一个分段三次Hermite插值.但在实际应用中,必须考虑插值曲线对型值点组某些特征的继承性,如曲线的保凸性,保形性等. [1—2]研究了分段三次Hermite插值的保单调性.[3]导出了分段三次Hermite插值保形的一个充要条件,这一条件表明并非任何型值点组都存在保形插值.正因为如此,许多文献采用了不同的方法解决保形插值问题.[4—5]用分段有理三次,但计算量增加较大;[6] 相似文献
3.
由于分段三次参数Hermite插值的切矢往往被作为变量,故可对其进行优化以使得构造的插值曲线满足特定的要求.为了构造兼具保形性与光顺性的平面分段三次参数Hermite插值曲线,给出了一种通过同时极小化导数振荡和应变能来确定切矢的方法.首先以导数振荡函数和应变能函数为双目标建立了切矢满足的方程系统;然后证明了方程系统存在唯一解,并给出了解的具体表达式;最后给出了误差分析,并通过数值算例表明方法的有效性.结果表明,相对于导数振荡极小化方法和应变能极小化方法,所提出的导数振荡和应变能极小化方法同时兼顾了平面分段三次参数Hermite插值曲线的保形性和光顺性. 相似文献
4.
C~k连续的保形分段2k次多项式插值 总被引:4,自引:0,他引:4
1.引言在每个子区间上,通过插入至多一个内结点,Brodlie和Butt[1]给出了分段三次多项式保形插值算法,Randal[2]等讨论了分段五次多项式插值,作者[31讨论了一般分段奇次多项式的保形插值,并且给1了内结点的位置范围公式.这种插值方法完全解决了一般的分段奇次多项式的保形插值问题.关于分段偶次多项式的保形插值,大多数文献只讨论分段二次保形插值,这里要特别指出的是Shumake[4j导出了二次样条保凸的充要条件,并且给出了一个二次样条保形插值的方法.在每一个子区间上至多插入一个内结点,则一个二次插值样条就可得到.作… 相似文献
5.
6.
7.
提出了带Hermite插值条件的最小二乘拟合问题,并给出了带Hermite插值条件的最小二乘拟合的拟合曲线的具体表达式.利用Lingo建模语言设计了求解带Hermite插值条件的最小二乘拟合的拟合曲线的Lingo程序,并通过Excel软件得到了求解带Hermite插值条件的最小二乘拟合的拟合曲线的应用软件. 相似文献
8.
9.
10.
11.
可拓策略生成方法与技术研究 总被引:3,自引:0,他引:3
知识激活乃至策略生成问题目前仍然是属于探索性阶段.研究了知识生成和智能激发的可拓方法,其核心是利用可拓变换与拓展推理解决矛盾问题,它为技术实现策略生成探索出一条可行之路. 相似文献
12.
R. G. Underwood 《Journal of Optimization Theory and Applications》1978,25(2):263-288
This paper develops a procedure for numerically solving continuous games (and also matrix games) using a gradient projection method in a general Hilbert space setting. First, we analyze the symmetric case. Our approach is to introduce a functional which measures how far a strategy deviates from giving zero value (i.e., how near the strategy is to being optimal). We then incorporate this functional into a nonlinear optimization problem with constraints and solve this problem using the gradient projection algorithm. The convergence is studied via the corresponding steepest-descent differential equation. The differential equation is a nonlinear initial-value problem in a Hilbert space; thus, we include a proof of existence and uniqueness of its solution. Finally, nonsymmetric games are handled using the symmetrization techniques of Ref. 1. 相似文献
13.
Bilevel programming approach applied to the flow shop scheduling problem under fuzziness 总被引:1,自引:0,他引:1
Samir A. Abass 《Computational Management Science》2005,2(4):279-293
This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered
here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision
makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to
minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan.
In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating
optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is
given.
Mathematics Subject Classification:
90C70, 90B36, 90C99 相似文献
14.
We solve two stochastic control problems in which a player tries to minimize or maximize the exit time from an interval of a Brownian particle, by controlling its drift. The player can change from one drift to another but is subject to a switching cost. In each problem, the value function is written as the solution of a free boundary problem involving second order ordinary differential equations, in which the unknown boundaries are found by applying the principle of smooth fit. For both problems, we compute the value function, we exhibit the optimal strategy and we prove its generic uniqueness. 相似文献
15.
Bahram Alidaee 《The Journal of the Operational Research Society》1993,44(2):125-132
In this paper we are concerned with the problem of sequencing a given set of jobs without preemption on a single machine so as to minimize total cost, where associated with each job is a processing time and a differentiable cost function defined on the completion time of the job. The problem, in general, is NP-complete and, therefore, there is unlikely to be an algorithm to solve the problem in reasonable time, thus a heuristic algorithm is desirable. We present two heuristic algorithms to solve the problem. The first algorithm is based on the differential of the cost functions, and the second algorithm is based on the least square approximation of the cost functions. Computational experiences for the case of quadratic, cubic, and exponential cost functions are presented. 相似文献
16.
17.
The paper deals with the problem of finding the field of force that generates a given (N ? 1)-parametric family of orbits for a mechanical system with N degrees of freedom. This problem is usually referred to as the inverse problem of dynamics. We study this problem in relation to the problems of celestial mechanics. We state and solve a generalization of the Dainelli and Joukovski problem and propose a new approach to solve the inverse Suslov’s problem. We apply the obtained results to generalize the theorem enunciated by Joukovski in 1890, solve the inverse Stäckel problem and solve the problem of constructing the potential-energy function U that is capable of generating a bi-parametric family of orbits for a particle in space. We determine the equations for the sought-for function U and show that on the basis of these equations we can define a system of two linear partial differential equations with respect to U which contains as a particular case the Szebehely equation. We solve completely a special case of the inverse dynamics problem of constructing U that generates a given family of conics known as Bertrand’s problem. At the end we establish the relation between Bertrand’s problem and the solutions to the Heun differential equation. We illustrate our results by several examples. 相似文献
18.
The controllability of a slowly rotating non-homogeneous beam clamped to a disc is considered. It is assumed that at the beginning the beam remains at the position of rest and it is supposed to rotate by the given angle and stop. The movement is governed by the system of two differential equations with non-constant coefficients: mass density, flexural rigidity and shear stiffness. To solve the problem of controllability, the spectrum of the operator generating the dynamics of the model is studied. Then the problem of controllability is reduced to the moment problem that is, in turn, solved with the use of the asymptotics of the spectrum. 相似文献
19.
《Applied Mathematical Modelling》2014,38(9-10):2648-2660
The finite transfer method is going to be used to solve a p system of linear ordinary differential equations. The complete problem is extended by adding the p boundary equations involved. It is chosen a fourth order scheme to obtain finite transfer expressions. A recurrence strategy is used in these equations and permits one to relate different points in the domain where boundary equations are defined. Finally a 2p algebraic system of equations is noted and solved. To show the efficiency and accuracy, the method is applied to determine the structural behavior of a bending beam with different supports and to solve a differential equation of second degree with different boundary conditions. 相似文献
20.
LQG量测反馈最优控制的精细积分 总被引:1,自引:0,他引:1
对于线性二次型高斯(LQG)量测反馈最优控制问题,提出了精细积分解法。根据分离性原理,LQG控制问题可以分成为最优状态反馈控制问题以及最优状态估计问题,即:离线计算的两套黎卡提微分方程的求解以及状态向量的时变微分方程的在线积分解。该算法不仅适用于求解二点边值问题及其相应的黎卡提微分方程,也适用于求解状态估计的时变微分方程。精细积分高精度的特点,对控制和估计都是有利的。数值算例表明了算法的高精度及有效性。 相似文献