𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for the computation of an upper bound on the μ-norm

✍ Scribed by Craig T. Lawrence; André L. Tits; Paul Van Dooren

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
269 KB
Volume
36
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

✦ Synopsis

A fast algorithm for the computation of the optimally frequency-dependent scaled H -norm of a "nite-dimensional LTI system is presented. It is well known that this quantity is an upper bound to the ` -norma; furthermore, it was recently shown to play a special role in the context of slowly time-varying uncertainty. Numerical experimentation suggests that the algorithm generally converges quadratically.

📜 SIMILAR VOLUMES

An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d