Balanced realization algorithm for scalar continuous-time systems having simple poles

DOI10.1080/00207728408547205zbMath0545.93015OpenAlexW1990893247MaRDI QIDQ3337288

J. A. de Abreu, Surjit S. Mahil, Frederick W. Fairman

Publication date: 1984

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728408547205

zbMATH Keywords

transfer functionsimple polesbalanced minimal realizations

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Matrix equations and identities (15A24) Minimal systems representations (93B20) Transformations (93B17) Realizations from input-output data (93B15)

Related Items (3)

A new algorithm for the minimal balanced realization of a transfer function matrix ⋮ Model reduction of SISO systems by Routh expansion and balancing method ⋮ Balanced realization using an orthogonalization procedure and modular polynomial arithmetic

Cites Work

• Methods of matrix algebra
• A new set of invariants for linear systems--Application to reduced order compensator design
• On generalized balanced realizations
• Principal component analysis in linear systems: Controllability, observability, and model reduction
• Synthesis of minimum roundoff noise fixed point digital filters

This page was built for publication: Balanced realization algorithm for scalar continuous-time systems having simple poles