BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20151117T231500Z
DTEND:20151118T010000Z
LOCATION:Level 4 - Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Quadratic programming (QP) problems result e.g. from certain methods in image processing or particle dynamics, or finite element discretization of contact problems of mechanics.=0ADomain decomposition methods solve an original large problem by splitting it into smaller subdomain problems that are almost independent, allowing naturally massively parallel computations on supercomputers.=0AWe are mostly interested in combining non-overlapping DDMs, namely FETI (Finite Element Tearing and Interconnecting), with optimal QP algorithms. FETI combines both iterative and direct solvers and allows highly accurate computations scaling up to tens of thousands of processors.=0ADue to limitations of commercial packages, problems often have to be adapted to be solvable and it takes a long time before recent numerical methods needed for HPC are implemented into such packages. These issues lead us to establish the PERMON (Parallel, Efficient, Robust, Modular, Object-oriented, Numerical) toolbox.
SUMMARY:PERMON Toolbox Combining Discretization, Domain Decomposition, and Quadratic Programming
PRIORITY:3
END:VEVENT
END:VCALENDAR