论文部分内容阅读
本文叙述两种求取根轨迹的算法:直接求根法和沿根轨迹逐点搜索法。在逐点搜索法中,我们提出的用参数比较法来确定根轨迹的特殊点的算法,可以避免形成和求解dK/ds=0方程,简化了上机前的准备工作,避免了求解高次方程的麻烦。在求根法中,包括QR分解求根法和牛顿下山法求根两种方法,可以适用于不同的场合,使根轨迹计算程序应用范围更广泛。本程序具有教学的特点,设计者可以通过人机对话,方便地学习有关求取根轨迹的基本知识以及掌握程序的使用方法,因而本程序为用根轨迹法设计系统提供了一个方便、实用的工具。
This article describes two algorithms for finding the root locus: direct root finding and point-by-point searching along the root locus. In the point-by-point search method, we propose a parameter comparison method to determine the special point of the root locus algorithm, to avoid the formation and solution of dK / ds = 0 equation, simplifying the preparatory work before the machine to avoid solving higher order Equation trouble. In the root seeking method, including the QR decomposition root seeking method and Newton downhill root two methods can be applied to different occasions, the root locus calculation program more widely applied. This program has the characteristics of teaching, designers can easily learn through the man-machine dialogue about the basic knowledge of root locus and grasp the use of the program, so this program for root locus design system provides a convenient and practical tool.