First Advisor

Jack C. Riley

Term of Graduation

Winter 1972

Date of Publication

2-25-1972

Document Type

Thesis

Degree Name

Master of Science (M.S.) in Applied Science

Department

Applied Science

Language

English

Subjects

Numerical analysis -- Computer programs, Feedback control systems, Algorithms

DOI

10.15760/etd.379

Physical Description

1 online resource (3, 50 pages)

Abstract

Many practical problems in the field of engineering become so complex that they may be effectively solved only with the aid of a computer. An effective solution depends on the use of an efficient algorithm. Plotting root locus diagrams is such a problem. This thesis presents such an algorithm.

Root locus design of feedback control systems is a very powerful tool. Stability of systems under the influence of variables can be easily determined from the root locus diagram. For even moderately complex systems of the type found in practical applications, determination of the locus is extremely difficult if accuracy is required. The difficulty lies in the classical method of graphically determining the location of points on the locus by trial and error. Such a method cannot be efficiently applied to a computer program.

The text presents an original algorithm for plotting the root locus of a general system. The algorithm is derived using the combined methods of complex variable algebra and numerical analysis. For each abscissa desired a polynomial is generated. The real roots of this polynomial are the ordinate values for points on the root locus. Root finding methods from numerical analysis enable the solution of the problem to be one of convergent iteration rather than trial and error.

Among the material presented is a computer program for solution of the general problem, an example of a completely analytic solution, and a table of solutions for more simple systems. The program inputs are the coefficients of the open loop transfer function and the range and increments of the real axis which are to be swept. The output lists the real and imaginary components of all solution points at each increment of the sweep. Also listed are the magnitude and angle components of the solution point and the value of system gain for which this is a solution. For less complex problems, the method can be applied analytically. This may result in an explicit relation between the real and imaginary components of all solution points or even in a single expression which can be analyzed using the methods of analytic geometry.

As with any advance in the theory of problem solving, the ideas presented in the thesis are best applied in conjunction with previous solution methods. Specifically, an idea of the approximate location of the root locus can be obtained using sketching rules which are well known. The method presented here becomes much more efficient when even a rough approximation is known. Furthermore, the specific locations of system poles and zeros are not required, but can be helpful in planning areas in which to search for solutions.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

Comments

If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to pdxscholar@pdx.edu and include clear identification of the work, preferably with URL.

Persistent Identifier

http://archives.pdx.edu/ds/psu/9613

Download

Share

COinS