- NumPI - Mailing list — Dipartimento di Matematica, UniPI

I: Possibile postdoc al flatiron institute
by Stefano Massei 29 Sep '26

29 Sep '26

Care tutti e cari tutti, Inoltro per conoscenza. A presto, Stefano ________________________________ Da: Marco Barbone <mbarbone(a)flatironinstitute.org> Inviato: lunedì 28 settembre 2026 19:55 A: Luca Gemignani <luca.gemignani(a)unipi.it> Oggetto: Possibile postdoc al flatiron institute Gentile Luca, Vi prego di inoltrare quanto segue ai vostri studenti e mentee, e ad altri giovani ricercatori di talento nel campo del calcolo scientifico che conoscete. Come specificato in passato, offriamo alloggio (sussidiato) e stipendio di 90k+ USD. Grazie mille! Marco Sono aperte le candidature per le Flatiron Research Fellowships (FRF), posizioni post-dottorali della durata di 3 anni presso il Center for Computational Mathematics (CCM) del Flatiron Institute, una divisione della Simons Foundation, con sede a New York. Scadenza: 15 novembre 2026. Descrizione completa e candidatura: https://apply.interfolio.com/193799 Le aree di ricerca di interesse sono in linea con quelle dello staff del CCM e includono: * analisi numerica, in particolare equazioni alle derivate parziali, equazioni integrali, algoritmi veloci, metodi spettrali e metodi di ordine elevato; * machine learning, in particolare ottimizzazione, teoria dell’apprendimento, modellazione probabilistica, deep learning, analisi di dati ad alta dimensionalità e applicazioni scientifiche; * metodologie statistiche, modellazione e inferenza; * biofisica computazionale e imaging, inclusi microscopia crioelettronica, dinamica molecolare e biologia strutturale; * calcolo ad alte prestazioni (HPC) e librerie software open source. Uno degli obiettivi principali del CCM è sviluppare la prossima generazione di metodi di simulazione e analisi e renderli disponibili alla comunità scientifica. Per una descrizione completa delle attività e dello staff scientifico, consultare: https://www.simonsfoundation.org/flatiron/center-for-computational-mathemat… Per qualsiasi domanda, non esitate a contattare un collega del CCM che lavori nella vostra area di ricerca.

1 0

NumPI day 2026
by Stefano Massei 15 Sep '26

15 Sep '26

Dear all, On Friday, 18 September, the numerical analysis workshop NumPI 2026 will take place in the Aula Magna of the Department of Mathematics. You can find the full workshop program here: https://numpi.dm.unipi.it/2026/08/31/upcoming-workshop-numpi-day-2026/ Everyone is welcome to attend! Best wishes, Stefano Massei

1 0

Fwd: Talk by Luca Dieci - June 30th
by Fabio Durastante 23 Jun '26

23 Jun '26

Dear all, I am forwarding the announcement below from the FLorence OPtimization talkS (FLOPS) mailing list, as the topic may be of interest to many of you. Please find the details of the seminar hereunder. Best, Fabio -------- Messaggio Inoltrato -------- Oggetto: Talk by Luca Dieci - June 30th Data: Mon, 22 Jun 2026 04:59:22 -0700 (PDT) Mittente: FLOPtalks <floptalks-group(a)unifi.it> A: FLOPtalks <floptalks-group(a)unifi.it> CC: luca.dieci(a)math.gatech.edu Dear colleagues and friends, we are pleased to announce next seminar of the FLorence OPtimization talkS (FLOPS) series. Luca Dieci <https://dieci.math.gatech.edu/>(Professor at Georgia Tech - USA),will give a talk entitled "Optimal trajectories for optimal transport". The talk will be on *June** 30th at noon *in Room 012, Centro Didattico Morgagni <https://maps.app.goo.gl/HhqQqcY8sr5H2qav9>. The abstract of the talk is available at the following link <https://sites.google.com/unifi.it/floptalks/home?authuser=3> (as well as in the attached poster). Best regards, Marianna & Margherita -- You received this message because you are subscribed to the Google Groups "FLOPtalks" group. To unsubscribe from this group and stop receiving emails from it, send an email to floptalks-group+unsubscribe(a)unifi.it. To view this discussion, visit https://groups.google.com/a/unifi.it/d/msgid/floptalks-group/8e64f421-2d7e-… <https://groups.google.com/a/unifi.it/d/msgid/floptalks-group/8e64f421-2d7e-…>.

1 0

Fwd: Talk by Paulo José da Silva e Silva - June 15th
by Fabio Durastante 08 Jun '26

08 Jun '26

Dear all, I am forwarding the announcement below from the FLorence OPtimization talkS (FLOPS) mailing list, as the topic may be of interest to many of you. Please find the details of the seminar hereunder. Best, Fabio -------- Messaggio Inoltrato -------- Oggetto: Talk by Paulo José da Silva e Silva - June 15th Data: Mon, 8 Jun 2026 20:51:58 +0100 Mittente: Margherita Porcelli <margherita.porcelli(a)unifi.it> A: FLOPtalks <floptalks-group(a)unifi.it> CC: pjssilva(a)unicamp.br Dear colleagues and friends, we are pleased to announce the next seminar of the FLorence OPtimization talkS (FLOPS) series. Paulo José da Silva e Silva <https://cemeai.icmc.usp.br/paulo-jose-da-silva-e-silva/> (Associate Professor at Universidade Estadual de Campinas - Brazil), will give a talk entitled "*Parallel Newton methods for the continuous quadratic knapsack problem: A Jacobi and Gauss-Seidel tale*". The talk will be on *June 15th at 2:30 p.m.* in Room 012, Centro Didattico Morgagni <https://maps.app.goo.gl/HhqQqcY8sr5H2qav9>. The abstract of the talk is available at the following link <https://sites.google.com/unifi.it/floptalks/upcoming?authuser=0> (as well as in the attached poster). Best regards, Margherita & Marianna -- You received this message because you are subscribed to the Google Groups "FLOPtalks" group. To unsubscribe from this group and stop receiving emails from it, send an email to floptalks-group+unsubscribe(a)unifi.it. To view this discussion, visit https://groups.google.com/a/unifi.it/d/msgid/floptalks-group/CALvpQTfM3%2Br… <https://groups.google.com/a/unifi.it/d/msgid/floptalks-group/CALvpQTfM3%2Br…>.

1 0

[Indico] [Event reminder] A Riemannian Framework for Optimization Problems in Reversible Markov Chains (19/05/2026, 11:00 Europe/Rome)
by Fabio Durastante 18 May '26

18 May '26

Title: A Riemannian Framework for Optimization Problems in Reversible Markov Chains, Speaker(s): Miryam Gnazzo, , Date and time: 19 May 2026, 11:00 (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Dipartimento di Matematica (Aula Magna). Address: Largo Bruno Pontecorvo, 5 – 56127 Pisa You can access the full event here: https://events.dm.unipi.it/e/342 Abstract -------- An ergodic Markov chain with transition matrix $P$ and stationary distribution ${\pi}$ is said to be reversible if $D_{{\pi}} P = P^\top D_{{\pi}}$, where $D_{{\pi}}$ denotes the diagonal matrix with the components of ${\pi}$ on its diagonal. Reversibility is a key property in Markov chain theory, with applications ranging from computational biology to network models, such as those arising in power grid analysis. In this talk, we present an approach to optimization problems over reversible Markov chains, with prescribed stationary distribution ${\pi}$. Our framework is based on Riemannian optimization over suitable manifolds of stochastic matrices associated with reversible chains, and it allows us to employ efficient and reliable Riemannian solvers. Within this framework, we address the approximation of the reversible Markov chain closest to a given one. In addition, we describe an application for minimizing Kemeny’s constant, which measures the efficiency of a Markov chain in traversing its states. Note ---- Reminder of tomorrow's seminar. -- Indico :: Email Notifier https://events.dm.unipi.it/e/342

1 0

Fwd: Reminder: dealii-X Seminar Tuesday at 14:00
by Fabio Durastante 05 May '26

05 May '26

Good morning, I apologize for the short notice. Below is an announcement for an online seminar for the Deal.II-X project* (of which some of us are members) for this afternoon (May 5th) at 2:00 PM. The topic might be of interest. Best regards, Fabio * https://www.dealii-x.eu/ -------- Messaggio Inoltrato -------- Oggetto: Reminder: dealii-X Seminar Tuesday at 14:00 Data: Mon, 4 May 2026 21:09:46 +0200 Mittente: 'Ivan Prusak' via dealiix project <dealiix-project(a)vph-institute.org> Rispondi-a: Ivan Prusak <ivan.prusak(a)rub.de> A: dealiix-project(a)vph-institute.org <dealiix-project(a)vph-institute.org> CC: Alberto Salvadori <alberto.salvadori(a)unibs.it>, Mattia Serpelloni <mattia.serpelloni(a)unibs.it> Dear Colleagues, this is a kind reminder about the dealii-X seminar *tomorrow, May 5 *at*14:00. *The speakers are Alberto Salvadori and Mattia Serpelloni from UNIBS. Please find below the title and the abstract. The usual dealii-X meeting link: https://ruhr-uni-bochum.zoom-x.de/j/67234625691?pwd=tNlXdhaQVGakRuQ7ScR5mXY… Best regards, Ivan *Title*: "Cellular Motility and Integrins Relocation: From Theory to HPC Simulations" *Abstract*: Numerous biological processes rely on cell motility and mechanosensing. These functions emerge from the coordinated interplay of multiple mechanotransductive mechanisms, in which the actin cytoskeleton and cell-matrix adhesions play a central role. During migration, actin polymerization at the leading edge drives protrusion against the resistance of the plasma membrane, generating forces that propagate through the lamellipodium and are ultimately transmitted to the extracellular matrix (ECM) via adhesion protein complexes. Those are mainly made of integrins, transmembrane adhesion receptors that are laterally mobile within the lipid bilayer. The membrane diffusion and active relocation enable integrins to sample the substrate, cluster upon ligand binding, and nucleate nascent focal adhesions at the leading edge. As retrograde actin flow engages integrins via talin and kindlin, mobile receptors are captured and stabilized, converting transient encounters into adhesive complexes. This coupling between integrin mobility and force transmission underlies the transition from short-lived nascent adhesions to more stable focal adhesions, while unengaged integrins continue to redistribute, sustaining adhesion turnover and directional cell migration. In this talk, we will present a continuum multiphysics theory for the engine, the adhesion, the relocation of integrins during cell locomotion. HPC simulations carried out in the dealii-X project of integrin redistribution during membrane advection are compared with experimental evidence. To unsubscribe from this group and stop receiving emails from it, send an email to dealiix-project+unsubscribe(a)vph-institute.org.

1 0

Fwd: Talk by Justo Puerto - May 13th
by Fabio Durastante 04 May '26

04 May '26

Dear Everybody, Please find attached the announcement for an upcoming FLOPtalks from our friends in Florence. The seminar may be of interest to many of you. Best, Fabio -------- Messaggio Inoltrato -------- Oggetto: Talk by Justo Puerto - May 13th Data: Mon, 4 May 2026 06:34:09 -0700 (PDT) Mittente: FLOPtalks <floptalks-group(a)unifi.it> A: FLOPtalks <floptalks-group(a)unifi.it> CC: JUSTO PUERTO ALBANDOZ <puerto(a)us.es> Dear colleagues and friends, we are pleased to announce next seminar of the FLorence OPtimization talkS (FLOPS) series. Justo Puerto <https://www.us.es/trabaja-en-la-us/directorio/justo-puerto-albandoz>, Professor at Universidad de Sevilla,will give a talk entitled "Ordered optimization: theory and applications". The talk will be on *May** 13th at 2:00 p.m. *in**Aula Caminetto, Scuola di ingegneria Santa Marta <https://maps.app.goo.gl/iWi2TtY2rM49epux5> The abstract of the talk is available at the following link <https://sites.google.com/unifi.it/floptalks/home?authuser=3> (as well as in the attached poster). Best regards, Marianna & Margherita -- You received this message because you are subscribed to the Google Groups "FLOPtalks" group. To unsubscribe from this group and stop receiving emails from it, send an email to floptalks-group+unsubscribe(a)unifi.it. To view this discussion, visit https://groups.google.com/a/unifi.it/d/msgid/floptalks-group/970f5d90-f649-… <https://groups.google.com/a/unifi.it/d/msgid/floptalks-group/970f5d90-f649-…>.

1 0

[Indico] [Event reminder] A Riemannian Framework for Optimization Problems in Reversible Markov Chains (19/05/2026, 11:00 Europe/Rome)
by Fabio Durastante 04 May '26

04 May '26

Title: A Riemannian Framework for Optimization Problems in Reversible Markov Chains, Speaker(s): Miryam Gnazzo, , Date and time: 19 May 2026, 11:00 (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Dipartimento di Matematica (Aula Magna). Address: Largo Bruno Pontecorvo, 5 – 56127 Pisa You can access the full event here: https://events.dm.unipi.it/e/342 Abstract -------- An ergodic Markov chain with transition matrix $P$ and stationary distribution ${\pi}$ is said to be reversible if $D_{{\pi}} P = P^\top D_{{\pi}}$, where $D_{{\pi}}$ denotes the diagonal matrix with the components of ${\pi}$ on its diagonal. Reversibility is a key property in Markov chain theory, with applications ranging from computational biology to network models, such as those arising in power grid analysis. In this talk, we present an approach to optimization problems over reversible Markov chains, with prescribed stationary distribution ${\pi}$. Our framework is based on Riemannian optimization over suitable manifolds of stochastic matrices associated with reversible chains, and it allows us to employ efficient and reliable Riemannian solvers. Within this framework, we address the approximation of the reversible Markov chain closest to a given one. In addition, we describe an application for minimizing Kemeny’s constant, which measures the efficiency of a Markov chain in traversing its states. Note ---- Announcing the next seminar in the NUMPI series. -- Indico :: Email Notifier https://events.dm.unipi.it/e/342

1 0

[Indico] [Event reminder] Efficient edge-centrality measures based on matrix functions of the line graph (28/04/2026, 11:00 Europe/Rome)
by Fabio Durastante 27 Apr '26

27 Apr '26

Title: Efficient edge-centrality measures based on matrix functions of the line graph, Speaker(s): Francesco Zigliotto, , Date and time: 28 Apr 2026, 11:00 (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Dipartimento di Matematica (Aula Magna). Address: Largo Bruno Pontecorvo, 5 – 56127 Pisa You can access the full event here: https://events.dm.unipi.it/e/341 Abstract -------- While network centrality is predominantly studied from a node perspective, here we investigate edge-centrality measures based on matrix functions. Specifically, we examine centrality within the context of the line graph, a structure where the roles of nodes and edges are inverted. Although any standard node-centrality metric can theoretically be applied to a line graph to assess edge importance, line graphs generally possess significantly more nodes than their original counterparts, which makes computing matrix functions of their adjacency matrices computationally infeasible. To address this bottleneck, we introduce novel matrix function identities that reduce the dimensionality of the required calculations. By operating on matrices of a much smaller size, these identities yield edge-centrality algorithms that are, in practice, nearly as fast as their node-level equivalents. Both directed and undirected graphs are treated. Note ---- Reminder of tomorrow's seminar -- Indico :: Email Notifier https://events.dm.unipi.it/e/341

1 0

[Indico] [Event reminder] Efficient edge-centrality measures based on matrix functions of the line graph (28/04/2026, 11:00 Europe/Rome)
by Fabio Durastante 13 Apr '26

13 Apr '26

Title: Efficient edge-centrality measures based on matrix functions of the line graph, Speaker(s): Francesco Zigliotto, , Date and time: 28 Apr 2026, 11:00 (Europe/Rome), Lecture series: Seminar on Numerical Analysis, Venue: Dipartimento di Matematica (Aula Magna). Address: Largo Bruno Pontecorvo, 5 – 56127 Pisa You can access the full event here: https://events.dm.unipi.it/e/341 Abstract -------- While network centrality is predominantly studied from a node perspective, here we investigate edge-centrality measures based on matrix functions. Specifically, we examine centrality within the context of the line graph, a structure where the roles of nodes and edges are inverted. Although any standard node-centrality metric can theoretically be applied to a line graph to assess edge importance, line graphs generally possess significantly more nodes than their original counterparts, which makes computing matrix functions of their adjacency matrices computationally infeasible. To address this bottleneck, we introduce novel matrix function identities that reduce the dimensionality of the required calculations. By operating on matrices of a much smaller size, these identities yield edge-centrality algorithms that are, in practice, nearly as fast as their node-level equivalents. Both directed and undirected graphs are treated. Note ---- Next NUMPI Seminar by Francesco Zigliotto, SNS (Pisa) -- Indico :: Email Notifier https://events.dm.unipi.it/e/341

1 0