Implementation of balanced realization algorithms in a symbolic environment
Implementation of balanced realization algorithms in a symbolic environment
- Author(s): H. Baki and N. Munro
- DOI: 10.1049/cp:19980420
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
UKACC International Conference on Control (CONTROL '98) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): H. Baki and N. Munro Source: UKACC International Conference on Control (CONTROL '98), 1998 p. 1317 – 1321
- Conference: UKACC International Conference on Control (CONTROL '98)
- DOI: 10.1049/cp:19980420
- ISBN: 0 85296 708 X
- Location: Swansea, UK
- Conference date: 1-4 Sept. 1998
- Format: PDF
Calculation of controllability and observability Gramians, and the determination of balanced realizations are considered in a symbolic framework. Two different approaches to balancing transformations are explained step by step, and more efficient, simple and numerically stable algorithms based on these two approaches have been implemented. An example taken from the literature is presented in order to illustrate the superiority of the symbolic implementations.
Inspec keywords: singular value decomposition; eigenvalues and eigenfunctions; reduced order systems; symbol manipulation; observability; control system analysis computing; controllability
Subjects: Algebra; Algebra; Control system analysis and synthesis methods; Control system design and analysis
Related content
content/conferences/10.1049/cp_19980420
pub_keyword,iet_inspecKeyword,pub_concept
6
6