Algorithm for positive realization of transfer functions

Nagy, Béla and Matolcsi, Máté (2003) Algorithm for positive realization of transfer functions. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I - FUNDAMENTAL THEORY AND APPLICATIONS, 50 (5). pp. 699-702. ISSN 1057-7122

algorithm for.pdf

Download (131kB) | Preview


The aim of this brief is to present a finite-step algorithm for the positive realization of a rational transfer function H(z). In comparision with previously described algorithms we emphasize that we do not make an a priori assumption on (but, instead, include a finite step procedure for checking) the non- negativity of the impulse response sequence of H(z). For primitive transfer functions a new method for reducing the pole order of the dominant pole is also proposed.

Item Type: Article
Uncontrolled Keywords: Linear systems; Impulse response sequence; Finite step procedure; Transfer functions; Poles and zeros; Matrix algebra; Impulse response; Discrete time control systems; Constraint theory; Boundary conditions; Algorithms; Positive realization; Positive linear systems; Impulse-response sequence; SYSTEMS
Subjects: Q Science / természettudomány > QA Mathematics / matematika
Depositing User: MTMT SWORD
Date Deposited: 10 Dec 2013 14:46
Last Modified: 10 Dec 2013 14:52

Actions (login required)

Edit Item Edit Item