Have a personal or library account? Click to login
Convex linear combination of the controllability pairs for linear systems Cover

Convex linear combination of the controllability pairs for linear systems

Open Access
|Jun 2022

References

  1. Kaczorek, T. (1993) Linear Control Systems, Vol. 1. J. Wiley, New York.
  2. Kaczorek, T. (2008) Reachability and controllability to zero tests for standard and positive fractional discrete-time systems. Journal Européen des Systèmes Automatisés, JESA, 42, 6-8, 770-781.10.3166/jesa.42.769-787
  3. Kaczorek, T. (2010) Decomposition of the pair (A,B) and (A,C) of the positive discrete-time linear systems. Archives of Control Sciences, 20, 3, 253-273.10.2478/v10170-010-0021-8
  4. Kaczorek, T. (2018) Reachability and observability of discrete-time linear systems with integer positive and negative powers of the state Frobenius matrices. Archives of Control Sciences, 28, 1, 5-20.
  5. Kailath, T. (1980) Linear Systems. Prentice-Hall, Englewood Cliffs, New York.
  6. Kalman, R. E. (1963) Mathematical Descriptions of Linear Systems. SIAM Journal on Control, 1, 1, 152-192.10.1137/0301010
  7. Klamka, J. (1981) Controllability of Dynamical Systems. Kluwer, Dordrecht, The Netherlands.
  8. Klamka, J. (2018) Controllability and Minimum Energy Control. Studies in Systems, Decision and Control, 162, Springer Verlag.10.1007/978-3-319-92540-0
  9. Jagadish, V., Srikanth, R. and Patruccione, F. (2020) Convex combinations of CP-divisible Pauli channels, arXiv; 1912, [0754v2-quant], 29 September 2020.
DOI: https://doi.org/10.2478/candc-2021-0030 | Journal eISSN: 2720-4278 | Journal ISSN: 0324-8569
Language: English
Page range: 541 - 551
Submitted on: Jun 1, 2021
Accepted on: Oct 1, 2021
Published on: Jun 27, 2022
Published by: Systems Research Institute Polish Academy of Sciences
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2022 Tadeusz Kaczorek, Jerzy Klamka, published by Systems Research Institute Polish Academy of Sciences
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.