Abstract
This paper proposes a set of modifications to the algorithm proposed earlier, that finds a complete set of minimal solutions for the characteristic polynomial on basis of digraphs theory and parallel computation. Changes proposed allow for parallelisation of previously sequential part of the algorithm, accurate estimation of number of solutions created and speed-up of both parts of the algorithm. Reduction of algorithm’s complexity is greatest for monomials consisting of only one variable and for one-variable polynomial a complete set of minimal solutions can be found as fast as in linearithmic time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2009)
Benvenuti, L., Farina, L.: A tutorial on the positive realization problem. IEEE Transactions on Automatic Control 49(5), 651–664 (2004)
Bona, M.: Combinatorics of Permutations, 2nd edn. Chapman Hall, CRC Press (2012)
Fornasini, E., Marchesini, G.: State-space realization theory of two-dimensional filters. IEEE Trans. Autom. Contr. 21, 481–491 (1976)
Fornasini, E., Valcher, M.E.: Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs. Linear Algebra and Its Applications 263, 275–310 (1997)
Fornasini, E., Valcher, M.E.: On the positive reachability of 2D positive systems. In: Benvenuti, L., De Santis, A., Farina, L. (eds.) Positive Systems. LNCIS, vol. 294, pp. 297–304. Springer, Heidelberg (2003)
Hryniów, K., Markowski, K.A.: Conditions for digraphs representation of the characteristic polynomial. In: Young Scientists Towards the Challenges of Modern Technology, pp. 77–80 (2014)
Hryniów, K., Markowski, K.A.: Parallel digraphs-building algorithm for polynomial realisations. In: Proceedings of 2014 15th International Carpathian Control Conference (ICCC), pp. 174–179 (2014), http://dx.doi.org/10.1109/CarpathianCC.2014.6843592
Hryniów, K., Markowski, K.A.: Reachability index calculation by parallel digraphs-building. In: 19th International Conference on Methods and Models in Automation and Robotics (MMAR), Miedzyzdroje, Poland, September 2-5, pp. 808–813 (2014), http://dx.doi.org/10.1109/MMAR.2014.6957460
Hryniów, K., Markowski, K.A.: Digraphs minimal realisations of state matrices for fractional positive systems. In: Szewczyk, Zieliński, Kaliczyńska (eds.) Progress in Automation, Robotics and Measuring Techniques. AISC, vol. 350, pp. 63–72 (2015)
Hryniów, K., Markowski, K.A.: Digraphs-building of complete set of minimal characteristic polynomial realisations as means for solving minimal realisation problem of nD systems. International Journal of Control (Submitted to)
Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and System Sciences 62, 367–375 (2001)
Kaczorek, T.: Two-dimensional Linear Systems. Springer, London (1985)
Kaczorek, T.: Positive 1D and 2D systems. Springer, London (2001)
Kurek, J.: The general state-space model for a two-dimensional linear digital system. IEEE Trans. Austom. Contr. 30, 600–602 (1985)
Wallis, W.D.: A Beginner’s Guide to Graph Theory. Biiokhäuser (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hryniów, K., Markowski, K.A. (2015). Optimisation of Digraphs-Based Realisations for Polynomials of One and Two Variables. In: Szewczyk, R., Zieliński, C., Kaliczyńska, M. (eds) Progress in Automation, Robotics and Measuring Techniques. ICA 2015. Advances in Intelligent Systems and Computing, vol 350. Springer, Cham. https://doi.org/10.1007/978-3-319-15796-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-15796-2_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15795-5
Online ISBN: 978-3-319-15796-2
eBook Packages: EngineeringEngineering (R0)