Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Further Results on `Infinity Norms as Lyapunov Functions for Linear Systems'

Author(s):

F.J. Christophersen, M. Morari
Conference/Journal:

vol. AUT05-13
Abstract:

This note continues and completes the results proposed in [19, 9] for computing vector 1- or Inf-norm based Lyapunov functions for linear discrete-time systems by presenting an algorithm for the construction of Lyapunov functions of that class. The complexity is bounded by the complexity of solving a feasibility LP with very few constraints or a very simple algebraic test in contrast to solving the original problem where a bilinear matrix equation with rank and norm constraint needs to be solved.

Year:

2005
Type of Publication:

(04)Technical Report
Supervisor:

M. Morari

File Download:

Request a copy of this publication.
(Uses JavaScript)
@TechReport{ChrMor:05:trep,
  author       = {F. J. Christophersen and M. Morari},
  title	       = {{Further Results on `Infinity Norms as Lyapunov
                  Functions for Linear Systems'}},
  year	       = {2005},
  institution  = {Automatic Control Laboratory},
  address      = {Swiss Federal Institute of Technology (ETH)},
  number       = {AUT05-13},
}
Permanent link