Abstract
By use of Routh approximation method and related reduction method to deal with the reduced-order problem, it is important to avoid or reduce the interval arithmetic expansion leading the failure of the stability criterion. Based on the feature of interval arithmetic and data consistency of Routh approximation, This note guarantees more effective calculation, and modifies interval arithmetic. The present arithmetic reduces the possibility of failure to maintain stability by interval arithmetic. A example is given to illustrate the method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bandyopadhyay, B., Ismail, O., Gorez, R.: Routh-Pade Approximation for Interval Systems. IEEE Trans. Auto. Contr. Vol. 39(12), 2454–2456 (1994)
Dolgin, Y., Zeheb, E.: On Routh-Pade Model Reduction of Interval Systems. IEEE Trans. Automat. Contr. 48(9), 1610–1612 (2003)
Yang, S.F.: Comments on “On Routh-Pade Model Reduction of Interval Systems”. IEEE Trans. Automat. Contr. 50(2), 273–274 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Zz., Li, L., Wang, Xf. (2011). Modification Algorithm on Routh-Pade Model Reduction of Interval Systems. In: Huang, DS., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds) Advanced Intelligent Computing. ICIC 2011. Lecture Notes in Computer Science, vol 6838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24728-6_94
Download citation
DOI: https://doi.org/10.1007/978-3-642-24728-6_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24727-9
Online ISBN: 978-3-642-24728-6
eBook Packages: Computer ScienceComputer Science (R0)