Search NASASearch

NASA NTRS · 19860020076

A simple algorithm for computing canonical forms

Abstract

It is well known that all linear time-invariant controllable systems can be transformed to Brunovsky canonical form by a transformation consisting only of coordinate changes and linear feedback. However, the actual procedures for doing this have tended to be overly complex. The technique introduced here is envisioned as an on-line procedure and is inspired by George Meyer's tangent model for nonlinear systems. The process utilizes Meyer's block triangular form as an intermedicate step in going to Brunovsky form. The method also involves orthogonal matrices, thus eliminating the need for the computation of matrix inverses. In addition, the Kronecker indices can be computed as a by-product of this transformation so it is necessary to know them in advance.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ford, H., Hunt, L. R., Renjeng, S.. 1986-01-01. A simple algorithm for computing canonical forms. https://ntrs.nasa.gov/citations/19860020076

Cite the original work for its findings. Save a collection to share your selection of sources.