Algorithms for polynomial spectral factorization and bounded-real balanced state space representations

DOI10.1007/S00498-012-0095-XMaRDI QIDQ358377zbMATH OpenOpenAlexFDO

Authors Paolo Rapisarda, Harry Trentelman, Ha Binh Minh

Publication date 8 August 2013

Published in MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/2383707/2013MathControlSignalsSystRapisarda.pdf

zbMATH Keywords

model reductionbalanced state space representationNevanlinna interpolation problemquadratic differential formstwo-variable polynomial matrices

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) System structure simplification (93B11)

Recommendations

• Balanced realizations via model operators
• Polynomial \(J\)-spectral factorization in minimal state space.
• On balanced realizations of bounded real and positive real functions
• On a Schur-algorithm based approach to spectral factorization: State- space formulae
• New algorithms for polynomial \(J\)-spectral factorization

Cites work

• scientific article; zbMATH DE number 4131017 (Why is no real title available?)
• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 3470217 (Why is no real title available?)
• scientific article; zbMATH DE number 1100439 (Why is no real title available?)
• A contraction mapping preserving balanced reduction scheme and its infinity norm error bounds
• A functional approach to LQG balancing
• A new set of invariants for linear systems--Application to reduced order compensator design
• A transformation approach to stochastic model reduction
• Algebraic system theory: An analyst's point of view
• All optimal Hankel-norm approximations of linear multivariable systems and theirL,^∞-error bounds†
• Balanced State Representations with Polynomial Algebra
• Computational aspects of spectral factorization and the tangential Schur algorithm
• Every storage function is a state function
• Interpolation of rational matrix functions
• LQG balancing and reduced LQG compensation of symmetric passive systems†
• New algorithms for polynomial \(J\)-spectral factorization
• On Quadratic Differential Forms
• On balanced realizations of bounded real and positive real functions
• On polynomial matrix spectral factorization by symmetric extraction
• On the Takagi interpolation problem
• On the state of behaviors
• Pick Matrix Conditions for Sign-Definite Solutions of the Algebraic Riccati Equation
• Principal component analysis in linear systems: Controllability, observability, and model reduction
• Realization by inspection
• Simultaneous block diagonalization of two real symmetric matrices
• Spectral Factorization and Nevanlinna–Pick Interpolation
• Spectral factorization of matrix-valued functions using interpolation theory
• State Maps for Linear Systems
• The Behavioral Approach to Open and Interconnected Systems
• The multiplicative structure of 𝐽-contractive matrix functions
• The simulation problem for high order linear differential systems.
• The subspace Nevanlinna interpolation problem and the most powerful unfalsified model

Cited in

(2)

• Closed-form solutions of singular KYP lemma: strongly passive systems, and fast lossless trajectories
• Balanced State Representations with Polynomial Algebra

This page was built for publication: Algorithms for polynomial spectral factorization and bounded-real balanced state space representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358377)