Let $A$ be a square matrix. The resolvent, $(A-z I)^{-1}, z \in \mathbb{C}$, plays an important role in many applications; for example, in studying functions of $A$, one often uses the Cauchy integral formula,$$f(A)=-\frac{1}{2 \pi i} \int_{\Gamma}(A-z I)^{-1} f(z) d z$$where $\Gamma$ is the boundary of a region $\Omega$ that contains the spectrum of $A$ and on which $f$ is analytic. If $z$ is very close to a simple eigenvalue $\lambda$ of $A$ - much closer to $\lambda$ than to any other eigenvalue of $A$ - then $(A-z I)^{-1} \approx \frac{1}{\lambda-z} x y^*$, where $x$ and $y$ are right and left normalized eigenvectors of $A$ corresponding to eigenvalue $\lambda$. It is sometimes observed, however, that $(A-z I)^{-1}$ is close to a rank one matrix even when $z$ is not very close to an eigenvalue of $A$. In this case, one can write $(A-z I)^{-1} \approx \sigma_1(z) u_1(z) v_1(z)^*$, where $\sigma_1(z)$ is the largest singular value of $(A-z I)^{-1}$ and $u_1(z)$ and $v_1(z)$ are the corresponding left and right singular vectors. We use singular value/vector perturbation theory to describe conditions under which $(A-$ $z I)^{-1}$ can be well-approximated by rank one matrices for a wide range of $z$ values. If $\lambda$ is a simple ill-conditioned eigenvalue of $A$, if the smallest nonzero singular value of $A-\lambda I$ is well-separated from 0 , and if a certain other condition involving the singular vectors of $A-\lambda I$ is satisfied, then it is shown that $(A-z I)^{-1}$ is close to a rank one matrix for a wide range of $z$ values. An application of this result in comparing bounds on $\|f(A)\|$ is described [1] for example, in studying functions of $A$, one often uses the Cauchy integral formula,$$f(A)=-\frac{1}{2 \pi i} \int_{\Gamma}(A-z I)^{-1} f(z) d z$$where $\Gamma$ is the boundary of a region $\Omega$ that contains the spectrum of $A$ and on which $f$ is analytic. If $z$ is very close to a simple eigenvalue $\lambda$ of $A$ - much closer to $\lambda$ than to any other eigenvalue of $A$ - then $(A-z I)^{-1} \approx \frac{1}{\lambda-z} x y^*$, where $x$ and $y$ are right and left normalized eigenvectors of $A$ corresponding to eigenvalue $\lambda$. It is sometimes observed, however, that $(A-z I)^{-1}$ is close to a rank one matrix even when $z$ is not very close to an eigenvalue of $A$. In this case, one can write $(A-z I)^{-1} \approx \sigma_1(z) u_1(z) v_1(z)^*$, where $\sigma_1(z)$ is the largest singular value of $(A-z I)^{-1}$ and $u_1(z)$ and $v_1(z)$ are the corresponding left and right singular vectors.We use singular value/vector perturbation theory to describe conditions under which $(A-$ $z I)^{-1}$ can be well-approximated by rank one matrices for a wide range of $z$ values. If $\lambda$ is a simple ill-conditioned eigenvalue of $A$, if the smallest nonzero singular value of $A-\lambda I$ is well-separated from 0 , and if a certain other condition involving the singular vectors of $A-\lambda I$ is satisfied, then it is shown that $(A-z I)^{-1}$ is close to a rank one matrix for a wide range of $z$ values. An application of this result in comparing bounds on $\|f(A)\|$ is described [1].[-]

We provide an asymptotic analysis of a nonlinear integro-differential equation which describes the evolutionary dynamics of a population which reproduces sexually and which is subject to selection and competition. The sexual reproduction is modeled via a nonlinear integral term, known as the 'infinitesimal model'. We consider a regime of small segregational variance, where a parameter in the infinitesimal operator, which measures the deviation between the trait of the offspring and the mean parental trait, is small. We prove that in this regime the phenotypic distribution remains close to a Gaussian profile with a fixed small variance and we characterize the dynamics of the mean phenotypic trait via an ordinary differential equation. We also briefly discuss the extension of the method to the study of steady solutions and their stability.[-]

We consider clustering problems that are fundamental when dealing with trajectory and time series data. The Fréchet distance provides a natural way to measure similarity of curves under continuous reparametrizations. Applied to trajectories and time series, it has proven to be very versatile as it allows local non-linear deformations in time and space. Subtrajectory clustering is a variant of the trajectory clustering problem, where the start and endpoints of trajectory patterns within the collected trajectory data are not known in advance. We study this problem in the form of a set cover problem for a given polygonal curve: find the smallest number k of representative curves such that any point on the input curve is contained in a subcurve that has Fréchet distance at most a given r to a representative curve.[-]

The aim of this talk is to present a new variation formulation of the time-dependent many-body electronic Schrödinger equation with Coulombic singularities. More precisely, its solution can actually be expressed as the solution of a global space-time quadratic minimization problem that proves to be useful for several tasks:
1) first, it is amenable to Galerkin time-space discretization schemes, using an appropriate least-square formulation
2) it enables to yield a new variational principle for the construction dynamical low-rank approximations, that is different from the classical Dirac-Frenkel variational principle
3) it enables to obtain fully certified a posteriori error estimators between the exact solution and approximate solutions.
The present analysis can be applied to the electronic many-body time-dependent Schrödinger equation with an arbitrary number of electrons and interaction potentials with Coulomb singularities.[-]

The development of a suitable, efficient and accurate numerical method to solve wave problems is encountered in many academic and industrial applications. The Boundary Integral Equation (BIE) technique, whose discretization is known as the Boundary Element Method (BEM), is an appealing alternative to classical domain method because it allows to handle problems defined on the exterior of bounded domains as easily as those defined in the interior, without the introduction of an artificial boundary to truncate the computational domain. Very recently, an Isogeometric Analysis based Boundary Element Method (IgA-BEM) has been proposed in literature for the numerical solution of frequency-domain (Helmholtz) wave problems on 3D domains admitting a multi-patch representation of the boundary surface. While being powerful and applicable to many situations, this approach shares with standard BEMs a disadvantage which can easily become significant in the 3D setting. Indeed, when the required accuracy is increased, it can soon lead to large dense linear systems, whose numerical solution requires huge memory, resulting also in important computational cost. Recently the development of fast H-matrix based direct and iterative solvers for oscillatory kernels, as the Helmholtz one, has been studied. Here, we investigate the effectiveness of the H-matrix technique, along with a suitable GMRES iterative solver, when used in the context of multi-patch IgA-BEM.[-]

We will present in this talk a mathematical model for a mixture composed by solid particles immersed in a viscous liquid. In a dense regime (high concentration of solid particles), the lubrication effects are predominant in the dynamics. Our goal is to study mathematically a minimal effective model, based on compressible Navier-Stokes equations, which take into account lubrication effects via a singular dissipation term. We will also consider the regime where the viscosity of the interstitial fluid tends to 0.[-]

The Grothendieck-Knudsen moduli space of stable rational curves n markings is arguably one of the simplest moduli spaces: it is a smooth projective variety that can be described explicitly as a blow-up of projective space, with strata corresponding to nodal curves similar to the torus invariant strata of a toric variety. Conjecturally, its Mori cone of curves is generated by strata, but this is known only for n up to 7. In contrast, the cones of effective divisors are not f initely generated, in all characteristics, when n is at least 10. After a general introduction to these topics, I will discuss what we call elliptic pairs and LangTrotter polygons, relating the question of finite generation of effective cones of blow-ups of certain toric surfaces to the arithmetic of elliptic curves. These lectures are based on joint work with Antonio Laface, Jenia Tevelev and Luca Ugaglia.[-]