赵空, 李文辉, 袁华. 平行搜索算法求解约束问题[J]. 微电子学与计算机, 2010, 27(11): 158-161,165.
引用本文: 赵空, 李文辉, 袁华. 平行搜索算法求解约束问题[J]. 微电子学与计算机, 2010, 27(11): 158-161,165.
ZHAO Kong, LI Wen-hui, YUAN Hua. Parallel Search Algorithm for Constraint Problem[J]. Microelectronics & Computer, 2010, 27(11): 158-161,165.
Citation: ZHAO Kong, LI Wen-hui, YUAN Hua. Parallel Search Algorithm for Constraint Problem[J]. Microelectronics & Computer, 2010, 27(11): 158-161,165.

平行搜索算法求解约束问题

Parallel Search Algorithm for Constraint Problem

  • 摘要: 求解非线性方程组.运用数值方法求解,最普遍的是采用牛顿迭代法,当初值发生微小变动时,用这种方法求解可能会发散或者收敛到一个用户不想要的解.由于设计者在初始设计阶段的随意性,往往使得系统的初始条件不好,使牛顿法难以收敛.通过分析传统的数值方法在非线性方程组解中的应用,发现存在两大缺陷:(1)对初始点敏感;(2)求解稳定性差.文中提出利用混沌算法的遍历性来解决此类问题.

     

    Abstract: The most common method for numerical solving is New ton iteration method. Generally, the method can reach the solution quickly. It needs a well-designed initial value and is quite sensitive to the initial value. When the initial value changed slightly, the method may emanate or converge the process and generate an unexpected solution. The random selection of the initial value in the initial design stage often makes the initial condition not good enough and gives Newton Raphson method difficulties to converge. We've revealed two major defects after analysis on the traditional numerical method in the application of the nonlinear equation solution:(1) It is too relied on the initial point; (2) The convergence results lack of consistency. In this paper the ergodicity of chaos algorithm introduced can help resolve the issues mentioned above.

     

/

返回文章
返回