<div dir="ltr"><div>Seminari di Matematica Applicata, Dipartimento di Matematica "F. Casorati" e Istituto del CNR IMATI "E. Magenes" di Pavia.<br><br>Martedì 18 Marzo 2025, alle ore 15 precise, presso l'aula Beltrami del Dipartimento di Matematica,<br><br><h4 style="padding:0px;margin:0px 0px 10px;clear:none;color:rgb(23,28,36);font-weight:300;font-stretch:normal;font-size:24px;line-height:1.2;font-family:Montserrat,-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,sans-serif;font-size-adjust:none;font-kerning:auto;font-variant-alternates:normal;font-variant-ligatures:normal;font-variant-numeric:normal;font-variant-east-asian:normal;font-feature-settings:normal;box-sizing:border-box">Michael Herty (RWTH Aachen University)</h4><div><br></div><h4 style="padding:0px;margin:0px 0px 10px;clear:none;color:rgb(23,28,36);font-weight:300;font-stretch:normal;line-height:1.2;font-family:Montserrat,-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,sans-serif;box-sizing:border-box"><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif">terrà un seminario dal titolo:</span></h4><div><br></div><h3 style="padding:0px;margin:5px 0px 8px;clear:none;color:rgb(23,28,36);font-weight:300;font-stretch:normal;font-size:28px;line-height:1.2;font-family:Montserrat,-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,sans-serif;font-size-adjust:none;font-kerning:auto;font-variant-alternates:normal;font-variant-ligatures:normal;font-variant-numeric:normal;font-variant-east-asian:normal;font-feature-settings:normal;box-sizing:border-box">New Results for Consensus Based Optimization,</h3></div><div><br></div><div>e alle ore 16 precise,</div><div><br></div><div><h4 style="padding:0px;margin:0px 0px 10px;clear:none;color:rgb(23,28,36);font-weight:300;font-stretch:normal;font-size:24px;line-height:1.2;font-family:Montserrat,-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,sans-serif;font-size-adjust:none;font-kerning:auto;font-variant-alternates:normal;font-variant-ligatures:normal;font-variant-numeric:normal;font-variant-east-asian:normal;font-feature-settings:normal;box-sizing:border-box">Charles Parker (University of Oxford)</h4></div><div><br></div><div>terrà un seminario dal titolo:</div><div><br></div><div><h3 style="padding:0px;margin:5px 0px 8px;clear:none;color:rgb(23,28,36);font-weight:300;font-stretch:normal;font-size:28px;line-height:1.2;font-family:Montserrat,-apple-system,BlinkMacSystemFont,"Segoe UI",Roboto,sans-serif;font-size-adjust:none;font-kerning:auto;font-variant-alternates:normal;font-variant-ligatures:normal;font-variant-numeric:normal;font-variant-east-asian:normal;font-feature-settings:normal;box-sizing:border-box">Locking-free methods for nonclamped, holely Reissner-Mindlin plates.</h3></div><div><br></div><div><br></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px">Abstract (Herty): </span><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px">We are interested in the construction of numerical methods for (constrained) very high-dimensional constrained nonlinear optimization problems by gradient free techniques appearing data assimilation problems as well as learning applications. Gradients are replaced by particle approximations and recently different methods have been proposed, e.g. consensus-based or swarm-based methods. We discuss new results on constrained and parametric case as well as their corresponding mean field descriptions in the many particle limit. Those allow to show convergence as well as the analysis of properties of the new algorithm. Several numerical examples, also in high dimensions, illustrate the theoretical findings as well as the performance of those methods.</span></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px"><br></span></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px"><br></span></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px">Abstract (Parker): Most standard discretizations of Reissner-Mindlin plates suffer from shear locking in the zero-thickness limit. While many methods have been developed over the past 40 years to overcome the issue of locking, it is almost always assumed that the plate is simply connected and clamped “for simplicity.” In this talk, we show that the analysis of MITC elements with other boundary conditions and nontrivial topologies is not so simple. Fortunately, the standard MITC elements and some high-order schemes without reduction operators remain locking-free in the more general setting. We then show how the analysis naturally leads to a method to compute H2-conforming finite element approximations without implementing C1-continuous elements.</span><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px"><br></span></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px"><br></span></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px;font-variant-ligatures:normal;text-decoration-style:initial;text-decoration-color:initial">-----------------------------------------</span></div><div><span style="color:rgb(61,61,61);font-family:Roboto,sans-serif;font-size:15px;font-variant-ligatures:normal;text-decoration-style:initial;text-decoration-color:initial"><a href="https://matematica.unipv.it/ricerca/cicli-di-seminari/seminari-di-matematica-applicata/" target="_blank">https://matematica.unipv.it/ricerca/cicli-di-seminari/seminari-di-matematica-applicata/</a><div class="gmail-yj6qo"></div><div class="gmail-adL"></div><div class="gmail-adL"></div><div class="gmail-adL"></div></span></div><br class="gmail-Apple-interchange-newline"><div><br></div></div>