Computation of zeros of linear multivariable systems
(1982) Automatica — Vol. 18, n° 4, p. 415-430 (1982)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- Several algorithms have been proposed in the literature for the computation of the zeros of a linear system described by a state-space model {A,B,C,D}. In this report we discuss the numerical properties of a new algorithm and compare it with some earlier techniques of computing zeros. The new approach to shown to handle both nonsquare and/or degenerate systems without difficulties whereas earlier methods would either fail or would require special treatment fo r these cases. The method is also shown to be backward stable in a rigorous sense. Several numerical examples are given in order to compare speed and accuracy of the algorithm with its nearest competitors.
- Affiliations
Stanford Univ EE Dept
Citations
Emami-Naeini, A., & Van Dooren, P. (1982). Computation of zeros of linear multivariable systems. Automatica, 18(4), 415-430. https://hdl.handle.net/2078.5/51414 (Original work published 1982)