论文信息 - Root-locus algorithms for microcomputers

Root-locus algorithms for microcomputers

root-finding routine (Melsa, 1970; N-Nagy and AlTickriti, 1972; Richard et al, 1979; Thomas, 1976; and Vernon, 1967). However, if a microcomputer is used, attempts to generate root-locus plots with a root-finding routine usually prove unsuccessful. The reason is due primarily to the architecture of the microcomputer, which makes its mode of operation relatively slow. Typically, a root-locus problem which may take a few seconds to solve

D. C. Riordan | S. Thompson | S. Thompson | D. Riordan

[1] F. N.-Nagy,et al. Computer-program description. Root-locus plotting by digital computer using operational-array technique , 1972 .

[2] D. H. Mee. A Computer Graphics Demonstration for Teaching Root Locus , 1976 .

[3] R. J. Simpson,et al. Introduction to Dynamics and Control , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4] Y. Shamash. Comments on the Routh-Hurwitz criterion , 1980 .

[5] Venkatarama Krishnan,et al. Semi-analytic approach to root locus , 1966 .

[6] R. Ash,et al. Numerical computation of root loci using the Newton-Raphson technique , 1968 .

[7] K. Yeung,et al. Routh-Hurwitz test under vanishing leading array elements , 1983 .

[8] James L. Melsa,et al. Computer programs for computational assistance in the study of linear control theory , 1970 .

[9] C. F. Chen,et al. The determination of root loci using Routh's algorithm , 1966 .

[10] C. Pan,et al. A computer-aided root-locus method , 1978 .