Computing the Kalman form
Lists
Only you see this
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},
}| Brunovsky Riccati Recursion for Linear Model Predictive Control | ACC · 2025 |
| Mathematical Description of Linear Dynamical Systems | Journal of the Society for Industrial and Applied Mathematics Series A Control · 1963 |
| Moment matching based model reduction for LPV state-space models | arXiv · 2015 |
| Computing the matrix exponential and the Cholesky factor of a related finite horizon Gramian | arXiv · 2023 |
| On the general theory of control systems | Ire Transactions on Automatic Control · 1959 |
| Efficient Spectral Control of Partially Observed Linear Dynamical Systems | NeurIPS · 2025 |