Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm
From MaRDI portal
Publication:855573
DOI10.1016/J.LAA.2006.03.027zbMATH Open1131.93029arXiv1012.3272OpenAlexW2043668931MaRDI QIDQ855573FDOQ855573
B. Hanzon, Ralf Peeters, M. Olivi
Publication date: 7 December 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: In this paper, the connections are investigated between two different approaches towards the parametrization of multivariable stable all-pass systems in discrete-time. The first approach involves the tangential Schur algorithm, which employs linear fractional transformations. It stems from the theory of reproducing kernel Hilbert spaces and enables the direct construction of overlapping local parametrizations using Schur parameters and interpolation points. The second approach proceeds in terms of state-space realizations. In the scalar case, a balanced canonical form exists that can also be parametrized by Schur parameters. This canonical form can be constructed recursively, using unitary matrix operations. Here, this procedure is generalized to the multivariable case by establishing the connections with the first approach. It gives rise to balanced realizations and overlapping canonical forms directly in terms of the parameters used in the tangential Schur algorithm.
Full work available at URL: https://arxiv.org/abs/1012.3272
Linear systems in control theory (93C05) Multivariable systems, multidimensional control systems (93C35) Discrete-time control/observation systems (93C55)
Cites Work
- Fast projection methods for minimal design problems in linear system theory
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Balanced parametrizations of stable SISO all-pass systems in discrete time
- Cyclic vectors and invariant subspaces of the backward shift operator
- Title not available (Why is that?)
- Model reduction via balanced state space representations
- Matrix RationalH2Approximation: A Gradient Algorithm Based on Schur Analysis
- Chain-scattering approach to \(H^ \infty\) control
- Linear and nonlinear system identification using separable least-squares
- Interpolation of rational matrix functions
- Title not available (Why is that?)
- The multiplicative structure of π½-contractive matrix functions
- Balanced realizations: canonical form, parametrization, model reduction
- On Sigma-lossless transfer functions and related questions
- Linear fractional transformations in rings and modules
- Weighted \(H^2\) approximation of transfer functions
- Overlapping Block-Balanced Canonical Forms and Parametrizations: The Stable SISO Case
- Constructive algebra methods for the \(L_ 2\)-problem for stable linear systems
- Title not available (Why is that?)
- Overlapping block-balanced canonical forms for various classes of linear systems
- Title not available (Why is that?)
Cited In (6)
- Orthogonal matched wavelets with vanishing moments: a sparsity design approach
- Balanced parametrizations of stable SISO all-pass systems in discrete time
- Balanced realization algorithm for scalar continuous-time systems having simple poles
- Nudelman interpolation, parametrizations of lossless functions and balanced realizations
- System identification of microwave filters from multiplexers by rational interpolation
- Canonical lossless state-space systems: staircase forms and the Schur algorithm
Recommendations
- Balanced parametrizations of stable SISO all-pass systems in discrete time π π
- Balanced realizations: canonical form, parametrization, model reduction π π
- Title not available (Why is that?) π π
- Nudelman interpolation, parametrizations of lossless functions and balanced realizations π π
- Balanced realizations via model operators π π
This page was built for publication: Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855573)
