Computing the Kalman form

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.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00009558
Contributor : Clément Pernet <>
Submitted on : Monday, February 6, 2006 - 5:59:17 PM
Last modification on : Monday, February 18, 2019 - 1:24:08 PM
Long-term archiving on : Friday, September 24, 2010 - 10:30:43 AM

Identifiers

Collections

Citation

Clément Pernet, Aude Rondepierre, Gilles Villard. Computing the Kalman form. 2006. ⟨hal-00009558v4⟩

Share

Metrics

Record views

740

Files downloads

215