Sparse solvers are one of the building blocks of any technology for reliable and high-performance scientific and engineering computing. In this paper we present a software package which implements an efficient multigrid sparse solver running on Graphics Processing Units. The package is a branch of a wider initiative of software development for sparse Linear Algebra computations on emergent HPC architectures involving a large research group working in many application projects over the last ten years.

TEOBResumS and SEOBNRv4 are the two existing semianalytical gravitational waveform models for spin-aligned coalescing black hole binaries based on the effective-one-body (EOB) approach. They are informed by numerical relativity simulations and provide the relative dynamics and waveforms from early inspiral to plunge, merger, and ringdown. The central building block of each model is the EOB resummed Hamiltonian. The two models implement different Hamiltonians that are both deformations of the Hamiltonian of a test spinning black hole moving around a Kerr black hole.

We introduce non-local dynamics on directed networks through the construction of a fractional version of a non-symmetric Laplacian for weighted directed graphs. Furthermore, we provide an analytic treatment of fractional dynamics for both directed and undirected graphs, showing the possibility of exploring the network employing random walks with jumps of arbitrary length. We also provide some examples of the applicability of the proposed dynamics, including consensus over multi-agent systems described by directed networks.

?1-Antitrypsin (AAT) encoded by the SERPINA1 gene is an acute-phase protein synthesized in the liver and secreted into the circulation. Its primary role is to protect lung tissue by inhibiting neutrophil elastase. The Z allele of SERPINA1 encodes a mutant AAT, named ATZ, that changes the protein structure and leads to its misfolding and polymerization, which cause endoplasmic reticulum (ER) stress and liver disease through a gain-of-function toxic mechanism.

Visibility has an encompassing importance in humans' perception of the landscape, since the first encounter with a new environment normally occurs through sight. In historical and archaeological studies, two main methods (i.e., the geometric method and the Geographical Information System [GIS] computation) have been employed to determine the distance from which an object can be recognized. However, neither is exhaustive when applied to a maritime context, where the main factor affecting the visibility radius is weather.

In this work we introduce and study a nonlocal version of the PageRank. In our approach, the random walker explores the graph using longer excursions than just moving between neighboring nodes. As a result, the corresponding ranking of the nodes, which takes into account a long-range interaction between them, does not exhibit concentration phenomena typical of spectral rankings which take into account just local interactions. We show that the predictive value of the rankings obtained using our proposals is considerably improved on different real world problems.

In this paper, we discuss the convergence of an Algebraic MultiGrid (AMG) method for general symmetric positive-definite matrices. The method relies on an aggregation algorithm, named coarsening based on compatible weighted matching, which exploits the interplay between the principle of compatible relaxation and the maximum product matching in undirected weighted graphs.

Extended versions of the Bourgain-Brezis-Mironescu theorems on the limit as s->1^- of the Gagliardo-Slobodeckij fractional seminorm are established in the Orlicz space setting. Our results hold for fractional Orlicz-Sobolev spaces built upon general Young functions, and complement those of [13], where Young functions satisfying the $\Delta_2$ and the $\nabla_2$ conditions are dealt with. The case of Young functions with an asymptotic linear growth is also considered in connection with the space of functions of bounded variation.