CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Numerical sensitivity of Linear Matrix Inequalities for shorter sampling periods

Bengt Lennartson (Institutionen för signaler och system, Automation) ; R. Middleton
51st IEEE Conference on Decision and Control, CDC 2012, Maui, HI, 10 through13 December 2012 (0191-2216). Article number 6425801, p. 4247-4252. (2012)
[Konferensbidrag, refereegranskat]

The numerical sensitivity of Linear Matrix Inequalities (LMIs) arising in the H∞ norm computation in discrete time is analyzed. Rapid sampling scenarios are examined comparing both shift and delta operator formulations of the equations. The shift operator formulation is shown in general to be arbitrarily poorly conditioned as the sampling rate increases. The delta operator formulation includes both recentering (to avoid cancellation problems) and rescaling, and avoids these difficulties. However, it is also shown that rescaling of the shift operator formulation gives substantial improvements in numerical conditioning, whilst recentering is of more limited benefit.

Denna post skapades 2013-03-07. Senast ändrad 2015-02-26.
CPL Pubid: 174498


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Automation


Elektroteknik och elektronik

Chalmers infrastruktur