Computer Science – Symbolic Computation
Scientific paper
2005-10-05
Computer Science
Symbolic Computation
10 pages
Scientific paper
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.
Pernet Clément
Rondepierre Aude
Villard Gilles
No associations
LandOfFree
Computing the Kalman form does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing the Kalman form, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the Kalman form will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-249840