共查询到20条相似文献,搜索用时 250 毫秒
1.
2.
3.
4.
讨论了带有多个滞时量的延时微分方程的数值稳定性,分析了用块θ-方法求解多延迟微分方程GPm-急定和GPLm-稳定的条件,基于Lagrange插值,证明了块θ-方法GPm-稳定的充分必要条件是方法是A-稳定的,块θ-方法GPLm-稳定的充分必要条件是θ=1. 相似文献
5.
6.
模糊奇异摄动系统H∞分析与综合 总被引:1,自引:0,他引:1
针对一类非线性奇异摄动系统,建立基于T-S模型的模糊奇异摄动系统模型,通过Lyapunov方法和Schur补定理,研究其稳定性、H∞性能指标和状态反馈H∞控制.将系统稳定性分析和状态反馈H∞控制器的设计,归结为求解一组与摄动参数ε无关的线性矩阵不等式问题,可以避免由ε引起数值求解的病态问题.该方法适用于标准和非标准非线性奇异摄动系统,仿真实例说明该方法的有效性. 相似文献
7.
针对一类非线性奇异摄动系统,建立基于T-S模型的时滞模糊奇异摄动系统模型,通过Lyapunov方法和Schur补定理,研究其状态反馈H∞控制.将系统状态反馈H∞控制器的设计,归结为求解一组与摄动参数ε无关的线性矩阵不等式问题,避免由ε引起数值求解的病态问题.所得控制器使闭环系统渐进稳定且达到给定的H∞性能指标.该方法适用于标准和非标准非线性奇异摄动系统,仿真实例说明该方法的有效性. 相似文献
8.
9.
10.
戴诗正 《系统工程与电子技术》1988,(2)
本文介绍了奇异摄动法在线性控制系统中的应用。利用这一方法可以将一个高阶系统的求解分为两个低阶系统分别求解问题,这样既可降低求解的系统阶次,又能克服系统方程组的刚性,从而大大减小计算量。因此它可用于控制系统的分析、综合和设计。文中对多重时间尺度模型、线性奇异摄动模型、利用逆变换的奇异摄动法、稳定性、可控性和可观测性、最佳线性调节器及最优线性控制等问题作了阐述。 相似文献
11.
XU Dachuan 《系统科学与复杂性》1996,(3)
ANEWSUFFICIENTCONDITIONFORTHECONVERGENCEOFTHEDFPALGORITHMWITHWOLFELINESEARCH¥XUDachuan(DepartmentofMathematics,QufuNormalUniv... 相似文献
12.
13.
针对专家决策带有犹豫性和偏好性的多属性决策问题,提出一种基于概率犹豫-直觉模糊熵和证据推理的决策方法。在概率犹豫模糊集和犹豫直觉模糊集的基础上,考虑专家偏好,提出一种新的概率犹豫-直觉模糊集,对混合型属性的决策信息进行统一描述;基于犹豫熵和直觉模糊熵,提出概率犹豫-直觉模糊熵对决策信息的犹豫性和不确定性进行测度,并确定属性权重;采用证据推理算法进行属性信息的集结,并基于效用理论对方案进行排序。通过算例对比分析验证了所提方法得到的决策结果更为科学、准确。 相似文献
14.
以求解双曲守恒律组的FD-WENO格式为基础提出了两类用于求解非守恒可压缩理想流体力学方程组的数值方法。通过求解若干Riemann问题及周期漩涡问题对这两类方法及已有的其它方法进行了测试和比较。数值试验表明这两类格式用于求解非守恒理想流体力学方程组时,计算是稳定的,能够算出较好的数值结果。 相似文献
15.
A CLASS OF REVISED BROYDEN ALGORITHMS 总被引:1,自引:0,他引:1
PUDingguo TIANWeiwen 《系统科学与复杂性》2003,16(2):213-221
In this paper, we discuss the convergence of the Broyden algorithms with revised search direction. Under some inexact llne searches, we prove that the algorithms are globally convergent for continuously differentiable functions and the rate of convergence of the algorithms is one-step superlinear and n-step second-order for uniformly convex objective functions. 相似文献
16.
There recently has been much interest in studying some optimization problems over symmetric cones. This paper deals with linear
programming over symmetric cones (SCLP). The objective here is to extend the Qi-Sun-Zhou’s smoothing Newton algorithm to solve
SCLP, where characterization of symmetric cones using Jordan algebras forms the fundamental basis for our analysis. By using
the theory of Euclidean Jordan algebras, the authors show that the algorithm is globally and locally quadratically convergent
under suitable assumptions. The preliminary numerical results for solving the second-order cone programming are also reported. 相似文献
17.
为有效求解动态多目标问题,提出一种基于分解技术的动态多目标引力搜索算法.首先为在环境变化前,得到解集分布性和收敛性都较好的非支配解集,采用基于分解技术的静态多目标引力搜索算法求解环境变化前的静态多目标问题;当环境变化后,根据相邻子种群最优解的相似性与同一权重向量对应子种群最优解的相似性,提出一种新的对最优解的预测模型,以缩小环境变化后各子问题的搜索空间,提高算法的求解效率.最后与目前较先进的静态多目标算法和预测策略在四个测试问题上进行比较,实验结果表明,当待优化问题随时间变化时,本文方法能够取得收敛精度更高、解集分布性更好的最优解集. 相似文献
18.
ZHU Detong 《系统科学与复杂性》2000,(4)
1. IntroductionGiven some function f(x): Wu - FI over a nonempty closed set n C W", one is interestedin solving the fOllowing optimization problem with constraints amin f(x)s.t. x E n (1.1)where f(x): Q C Wu - FI is twice continuously differentiable. This problem has receivedconsiderable attention extensively. The linear constrained case where n is a polyhedron is ofspecial inferest. Recently, there are quite a few articles proposing projected gradient methodsto solve the problem (see, fo… 相似文献
19.
Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software, which makes them impossible to find out an optimal solution to constrained optimization problems. In this paper, a novel penalty function (called M-objective penalty function) with one penalty parameter added to both objective and constrained functions of inequality constrained optimization problems is proposed. Based on the M-objective penalty function, an algorithm is developed to solve an optimal solution to the inequality constrained optimization problems, with its convergence proved under some conditions. Furthermore, numerical results show that the proposed algorithm has a much better convergence than the classical penalty function algorithms under big penalty parameters, and is efficient in choosing a penalty parameter in a large range in Matlab software. 相似文献
20.
UPF based autonomous navigation scheme for deep space probe 总被引:2,自引:0,他引:2
The autonomous "celestial navigation scheme" for deep space probe departing from the earth and the autonomous "optical navigation scheme" for encountering object celestial body are presented. Then, aiming at the conditions that large initial estimation errors and non-Gaussian distribution of state or measurement errors may exist in orbit determination process of the two phases, UPF (unscented particle filter) is introduced into the navigation schemes. By tackling nonlinear and non-Gaussian problems, UPF overcomes the accuracy influence brought by the traditional EKF (extended Kalman filter), UKF (unscented Kalman filter), and PF (particle filter) schemes in approximate treatment to nonlinear and non-Gaussian state model and measurement model. The numerical simulations demonstrate the feasibility and higher accuracy of the UPF navigation scheme. 相似文献