Reachability Analysis of Linear Systems


Paul Hänsch

Title Reachability Analysis of Linear Systems
When 20.05.2010, 15:00
Where Seminarraum Informatik 11
Abstract Numeric approaches to reachability analysis of linear systems are known to be capable of handling high dimensional systems. The most common type of algorithm is based on (very coarse) estimates that provide the means for safe overapproximations. However, this is in contrast to the usual implementation which introduces roundoff errors in each iteration. We are especially interested in the gain of approximation accuracy when replacing safe estimations with numerical approximations.