An efficient algorithm for positive realizations

DOI10.1016/j.sysconle.2007.11.001zbMath1139.93013arXivmath/0612551OpenAlexW1985908492MaRDI QIDQ2427477

Philippe Jaming, Wojciech Czaja, 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

positive linear systemspositive realizationsdiscrete time filtering

Mathematics Subject Classification ID

Related Items (3)

An upper bound on the dimension of minimal positive realizations for discrete time systems ⋮ Minimal positive realizations: A survey ⋮ A construction method for positive realizations with an order bound

Cites Work

• On the existence of a positive realization
• An example of how positivity may force realizations of `large' dimension
• Bounds on the size of minimal nonnegative realizations for discrete-time LTI systems
• Primes in several classes of the positive matrices
• Nonnegative realizations of matrix transfer functions
• A note on the existence of positive realizations
• Minimal positive realizations of transfer functions with positive real poles
• Reachability, Observability, and Realizability of Continuous-Time Positive Systems
• A Tutorial on the Positive Realization Problem
• Minimal positive realizations of transfer functions with nonnegative multiple poles
• Order Bound for the Realization of a Combination of Positive Filters
• Algorithm for positive realization of transfer functions
• A lowerbound on the dimension of positive realizations
• Positive 1D and 2D systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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