BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//6.6.4.4//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:0-225@aerospace.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20220112T133000

DTEND;TZID=Asia/Jerusalem:20220112T143000

DTSTAMP:20230409T141227Z

URL:https://aerospace.technion.ac.il/events/the-product-form-of-projection
 -based-reduced-order-models-and-its-application-to-model-reduction-for-mul
 ti-agent-systems/

SUMMARY:The Product Form of Projection-Based Reduced Order Models and Its A
 pplication to Model Reduction for Multi-Agent Systems
DESCRIPTION:Lecturer:Noam Leiter\n Faculty:Department of Aerospace Engineer
 ing\n Institute:Technion – Israel Institute of Technology\n Location:Cla
 ssroom 165\, ground floor\, Library\, Aerospace Eng. & https://technion.zo
 om.us/j/96270648292\n Zoom: \n Abstract: \n Details: \n Model-order reduct
 ion is an essential tool for large-scale systems introduced by modern tech
 nologies for which full order controller design and implementation may be 
 numerically and computationally infeasible. Model order reduction is a wel
 l established field of research in control and systems theory. Of particul
 ar interest in recent years is the study of model reduction for multi-agen
 t systems which are characterized by their increasingly large scales.\nIn 
 this talk\,  we reexamine the well known orthogonal projection-based redu
 ced-order models (PROMs) and their realizations. A novel product form is d
 erived for the reduction error system of these reduced models\, and invest
 igating the error system product form\, we then define interface-invariant
  PROMs\, model order reductions with projection-invariant input and output
  matrices. It is shown that for such PROMs the error product systems are s
 trictly proper. Furthermore\, exploiting this structure\, an analytic H∞
  reduction error bound is obtained and an H∞ bound optimization problem 
 is defined. We then leverage these results for model reduction of large-sc
 ale multi-agent systems.  We show how graph contractions can be used to o
 btain structure-preserving PROMs\, and present a sub-optimal  H∞ graph-
 based efficient algorithm for model reduction of multi-agent systems. We t
 hen demonstrate these results on the classical controlled consensus model.
 \nZoom Meeting
CATEGORIES:Seminars
LOCATION:Classroom 165\, ground floor\, Library\, Aerospace Eng. & https://
 technion.zoom.us/j/96270648292

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:STANDARD

DTSTART:20211031T010000

TZOFFSETFROM:+0300

TZOFFSETTO:+0200

TZNAME:IST

END:STANDARD

END:VTIMEZONE
END:VCALENDAR