Recursive Reduced-Order Algorithm for Singularly Perturbed Cross Grammian Algebraic Sylvester Equation

Intessar Al-Iedani and Zoran Gajic

Mathematical Problems in Engineering, 2016, vol. 2016, 1-9

Abstract:

A new recursive algorithm is developed for solving the algebraic Sylvester equation that defines the cross Grammian of singularly perturbed linear systems. The cross Grammian matrix provides aggregate information about controllability and observability of a linear system. The solution is obtained in terms of reduced-order algebraic Sylvester equations that correspond to slow and fast subsystems of a singularly perturbed system. The rate of convergence of the proposed algorithm is , where is a small singular perturbation parameter that indicates separation of slow and fast state variables. Several real physical system examples are solved to demonstrate efficiency of the proposed algorithm.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/2452746.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/2452746.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:2452746

DOI: 10.1155/2016/2452746

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().