共查询到10条相似文献,搜索用时 31 毫秒
1.
本文给出正切函数的有理展开和契比协夫展开式系数的加速计算方法;同时在YH-1机上进行了数值试验,结果表明:用现在的系数来计算正切函数,其精度比原来正切函数的精度可提高30%左右。 相似文献
2.
Groebner基下分离子插值函数模型 总被引:1,自引:0,他引:1
给出Groebner基下建立分离子插值函数模型的方法。对于任意离散时间序列可在字典序下找到相关分离子,并用此分离子构建该离散时间序列的函数模型,及其满足所给点列的多元插值函数。通过实例说明了模型建立过程。 相似文献
3.
对固定形式的变结构控制对应的趋近律进行了研究,分别推导出用全部状态构成的控制、用部分状态构成的控制以及形式为u=ueq+ud的控制所对应的趋近律. 相似文献
4.
We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
5.
讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。 相似文献
6.
一种攻击机动目标的变结构导引律研究 总被引:3,自引:0,他引:3
无人机在快速接敌的过程中,传统比例导引法系数的最优解与目标和载机的距离有关,而且一旦目标机动或增加了干扰,跟踪效果都会变差.为了解决这一问题,提出了一种变结构的跟踪方法.仿真结果表明:该方法在未知目标距离的情况下能够快速接敌,且能减小无人机所需过载,提高制导精度和跟踪鲁棒性,限制了视线角速度. 相似文献
7.
带裂缝钢筋混凝土梁振动特性变刚度模型分析 总被引:2,自引:0,他引:2
按常规等刚度、匀质线性材料来考虑开裂后的钢筋混凝土梁,必然带来较大的误差,与实际情况存在较大差距。基于条带法提出了建立带裂缝钢筋混凝土梁的变刚度模型分析方法,对考虑开裂和材料非线性的钢筋混凝土简支梁的振动特性进行了理论计算和试验研究。结果表明:提出的方法从理论上可以得到既有钢筋混凝土简支梁的振动特性、裂缝开展情况等参数,理论计算结果与试验结果吻合较好,且精度较高,具有良好的可行性和工程适用性。 相似文献
8.
研究了一类具有时滞和变消耗率的比率型Chemostat模型,讨论了边界平衡点和正平衡点的局部稳定性以及Hopf分支的存在性;利用比较原理和构造Lyapunov泛函,给出了边界平衡点和正平衡点的全局稳定性的充分性条件;并通过数值模拟验证了理论结果。 相似文献
9.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
10.
将分段幂多项式拟合方法与线性兴波阻力理论相结合,提出一种针对复杂线型小水线面双体船的兴波阻力数值计算方法,该方法应用于常规小水线面双体船的兴波阻力计算,表明该方法能在常规的幂多项式拟合方法的基础上进一步提高计算精度,同时也验证了该方法的正确性,将该方法的计算结果与复杂线型小水线面双体船剩余阻力的试验结果相比,两者吻合较好,证明了该方法用于复杂线型小水线面双体船的兴波阻力计算是可行的。 相似文献