DocumentCode
1835746
Title
Computation of zeros: a decomposition algorithm for large scale systems
Author
Svaricek, F.
Author_Institution
Fac. of Mech. Eng., Duisburg Univ., Germany
fYear
1994
fDate
7-9 Mar 1994
Firstpage
171
Lastpage
176
Abstract
In this paper a new graph-theoretic decomposition algorithm for the computation of zeros of large scale systems is presented. If such a decomposition exists, the algorithm divides the computation of zeros in at least m subproblems, where m is equal to the number of inputs and outputs of a square, invertible system. Several examples illustrate the advantages of the proposed algorithm
Keywords
control system analysis computing; decomposition; graph theory; large-scale systems; matrix algebra; poles and zeros; decomposition algorithm; finite invariant zeros; graph theory; large scale systems; least m subproblems; parallel computation; polynomials; sparse matrix; square invertible system; Concurrent computing; Control systems; Eigenvalues and eigenfunctions; Equations; Large-scale systems; Linear systems; MATLAB; Mathematical model; Mechanical engineering; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Control System Design, 1994. Proceedings., IEEE/IFAC Joint Symposium on
Conference_Location
Tucson, AZ
Print_ISBN
0-7803-1800-5
Type
conf
DOI
10.1109/CACSD.1994.288932
Filename
288932
Link To Document