Coarse-Graining of a Discrete Model for Edge Dislocations in the Regular Triangular Lattice

We consider a discrete model of planar elasticity where the particles, in the reference configuration, sit on a regular triangular lattice and interact through nearest-neighbor pairwise potentials, with bonds modeled as linearized elastic springs. Within this framework, we introduce plastic slip fields, whose discrete circulation around each tri-angle detects the possible presence of an edge dislocation.

A Preliminary Investigation of a Single Shock Impact on Italian Mortality Rates Using STMF Data: A Case Study of COVID-19

Mortality shocks, such as pandemics, threaten the consolidated longevity improvements, confirmed in the last decades for the majority of western countries. Indeed, just before the COVID-19 pandemic, mortality was falling for all ages, with a different behavior according to different ages and countries. It is indubitable that the changes in the population longevity induced by shock events, even transitory ones, affecting demographic projections, have financial implications in public spending as well as in pension plans and life insurance.

Screw dislocations in periodic media: Variational coarse graining of the discrete elastic energy

We study the asymptotic behavior, as the lattice spacing ? tends to zero, of the discrete elastic energy induced by topological singularities in an inhomogeneous ? periodic medium within a two-dimensional model for screw dislocations in the square lattice. We focus on the |log?| regime which, as ?->0 allows the emergence of a finite number of limiting topological singularities.

Seeking critical nodes in digraphs

The Critical Node Detection Problem (CNDP) consists in finding the set of nodes, defined critical, whose removal maximally degrades the graph. In this work we focus on finding the set of critical nodes whose removal minimizes the pairwise connectivity of a direct graph (digraph). Such problem has been proved to be NP-hard, thus we need efficient heuristics to detect critical nodes in real-world applications. We aim at understanding which is the best heuristic we can apply to identify critical nodes in practice, i.e., taking into account time constrains and real-world networks.

A multi-GPU aggregation-based AMG preconditioner for iterative linear solvers

We present and release in open source format a sparse linear solver which efficiently exploits heterogeneous parallel computers. The solver can be easily integrated into scientific applications that need to solve large and sparse linear systems on modern parallel computers made of hybrid nodes hosting Nvidia Graphics Processing Unit (GPU) accelerators.

On the probability of (falsely) connecting two distinct components when learning a GGM

In this paper, we extend the result on the probability of (falsely) connecting two distinct components when learning a GGM (Gaussian Graphical Model) by the joint regression based technique. While the classical method of regression based technique learns the neighbours of each node one at a time through a Lasso penalized regression, its joint modification, considered here, learns the neighbours of each node simultaneously through a group Lasso penalized regression.

Excluded volume effects on active ring polymers

The properties of semiflexible active ring polymers are studied by numerical simulations. The two-dimensionally confined polymer is modeled as a closed bead-spring chain subject to tangential active forces, and the interaction with the fluid is described by the Brownian multiparticle collision dynamics approach. Both phantom polymers and chains with excluded-volume interactions are considered. The size and shape strongly depend on the relative ratio of the persistence length to the ring length as well as on the active force.

Computing integrals with an exponential weight on the real axis in floating point arithmetic

The aim of this work is to propose a fast and reliable algorithm for computing integrals of the type $$\int_{-\infty}^{\infty} f(x) e^{\scriptstyle -x^2 -\frac{\scriptstyle 1}{\scriptstyle x^2}} dx,$$ where $f(x)$ is a sufficiently smooth function, in floating point arithmetic. The algorithm is based on a product integration rule, whose rate of convergence depends only on the regularity of $f$, since the coefficients of the rule are ``exactly'' computed by means of suitable recurrence relations here derived. We prove stability and convergence in the space of locally continuous functions

A long-time behavior preserving numerical scheme for age-of-infection epidemic models with heterogeneous mixing

In this manuscript we propose a numerical method for non-linear integro-differential systems arising in age-of-infection models in a heterogeneously mixed population. The discrete scheme is based on direct quadrature methods and provides an unconditionally positive and bounded solution. Furthermore, we prove the existence of the numerical final size of the epidemic and show that it tends to its continuous equivalent as the discretization steplength vanishes.

Rational QZ Steps with perfect shifts

In this paper we analyze the stability of the problem of performing a rational QZ$step with a shift that is an eigenvalue of a given regular pencil H-lambda K in unreduced Hessenberg-Hessenberg form. In exact arithmetic, the backward rational QZ step moves the eigenvalue to the top of the pencil, while the rest of the pencil is maintained in Hessenberg-Hessenberg form, which then yields a deflation of the given shift. But in finite-precision the rational QZ step gets ``blurred'' and precludes the deflation of the given shift at the top of the pencil.