Computing the Kalman form

Clément Pernet, Aude Rondepierre, Gilles Villard

Abstract

We present two algorithms for the computation of the Kalman form of a linear control system. The first one is based on the technique developed by Keller-Gehrig for the computation of the characteristic polynomial. The cost is a logarithmic number of matrix multiplications. To our knowledge, this improves the best previously known algebraic complexity by an order of magnitude. Then we also present a cubic algorithm proven to more efficient in practice.
BibTeX
@misc{pernet2005computing,
  author = {Clément Pernet and Aude Rondepierre and Gilles Villard},
  title = {{Computing the Kalman form}},
  year = {2005},
  eprint = {cs/0510014},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/cs/0510014},
}
Figure