An efficient algorithm for positive realizations

DOI10.1016/J.SYSCONLE.2007.11.001MaRDI QIDQ2427477zbMATH OpenOpenAlexFDO

Authors Wojciech Czaja, Philippe Jaming, Máté Matolcsi

Publication date 13 May 2008

Published in Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0612551

zbMATH Keywords

discrete time filteringpositive linear systemspositive realizations

Mathematics Subject Classification ID

Realizations from input-output data (93B15) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55)

Abstract: We observe that successive applications of known results from the theory of positive systems lead to an {it efficient general algorithm} for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one of which complements an earlier result of cite{large}. Finally, we improve a lower-bound of cite{mn2} to indicate that the algorithm is indeed efficient in general.

Recommendations

• scientific article; zbMATH DE number 1036304
• Realization of positive linear systems
• A construction method for positive realizations with an order bound
• Positive stable realizations for linear systems
• Minimal positive realizations of transfer functions with positive real poles

Cites work

• A lowerbound on the dimension of positive realizations
• A note on the existence of positive realizations
• A Tutorial on the Positive Realization Problem
• Algorithm for positive realization of transfer functions
• An example of how positivity may force realizations of `large' dimension
• Bounds on the size of minimal nonnegative realizations for discrete-time LTI systems
• scientific article; zbMATH DE number 3718924 (Why is no real title available?)
• scientific article; zbMATH DE number 1516499 (Why is no real title available?)
• scientific article; zbMATH DE number 975550 (Why is no real title available?)
• Minimal positive realizations of third-order systems with complex poles
• Minimal positive realizations of transfer functions with nonnegative multiple poles
• Minimal positive realizations of transfer functions with positive real poles
• Nonnegative realizations of matrix transfer functions
• On the existence of a positive realization
• Order Bound for the Realization of a Combination of Positive Filters
• Positive 1D and 2D systems
• Primes in several classes of the positive matrices
• Reachability, Observability, and Realizability of Continuous-Time Positive Systems

Cited in

(9)

• Minimal positive realizations: A survey
• scientific article; zbMATH DE number 5150769 (Why is no real title available?)
• An algorithm for the construction of nonnegative realizations
• scientific article; zbMATH DE number 3938450 (Why is no real title available?)
• A construction method for positive realizations with an order bound
• The dimension reduction algorithm for the positive realization of discrete phase-type distributions
• System realizations by mammillary models with an application to propofol pharmacokinetics
• An upper bound on the dimension of minimal positive realizations for discrete time systems
• Faster algorithms for computing Hong's bound on absolute positiveness

This page was built for publication: An efficient algorithm for positive realizations

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