Balanced realization using an orthogonalization procedure and modular polynomial arithmetic

DOI10.1016/S0016-0032(96)00138-XzbMath1031.93055OpenAlexW2090588091MaRDI QIDQ5959148

Stéphane Azou, P. Vilbe, L. C. Calvez

Publication date: 23 June 2002

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0016-0032(96)00138-x

zbMATH Keywords

balanced realizationblock-factorized transfer function matrixmodular polynomial arithmeticorthogonalization processes of input mapsRouth-Aström tables

Mathematics Subject Classification ID

Minimal systems representations (93B20) Realizations from input-output data (93B15)

Related Items (1)

Realization and canonical representation of linear systems through I/O maps

Cites Work

• Unnamed Item
• On generalized balanced realizations
• Balanced realization algorithm for scalar continuous-time systems having simple poles
• Representation and realisation of stable systems using input maps
• Minimal realization of transfer function matrices via one orthogonal transformation
• A simple algorithm on minimal balanced realization for transfer function matrices
• Minimal balanced realization of transfer function matrices using Markov parameters
• Internally balanced minimal realization of discrete SISO systems
• Balanced realization of orthogonally symmetric transfer function matrices
• Direct Minimal Balanced Realization from Impulse Response Matrices Using I/O Map Decomposition
• 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 using an orthogonalization procedure and modular polynomial arithmetic