Computing the Kalman form
符号计算
2016-08-16 v4 最优化与控制
摘要
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.
引用
@article{arxiv.cs/0510014,
title = {Computing the Kalman form},
author = {Clément Pernet and Aude Rondepierre and Gilles Villard},
journal= {arXiv preprint arXiv:cs/0510014},
year = {2016}
}
备注
10 pages