Implementation of balanced realization algorithms in a symbolic environment

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