We consider an epidemic model of SIR type set on a homogeneous tree and investigate the spreading properties of the epidemic as a function of the degree of the tree, the intrinsic basic reproduction number and the strength of the interactions within
the population of infected individuals. When the degree is one, the homogeneous tree is nothing but the standard lattice on the integers and our model reduces to a SIR model with discrete diffusion for which the spreading properties are very similar to the continuous case. On the other hand, when the degree is larger than two, we observe some new features in the spreading properties. Most notably, there exists a critical value of the strength of interactions above which spreading of the epidemic in the tree is no longer possible.
Nonlinear quantum graphs are metric graphs equipped with a nonlinear Schr{o}dinger equation. Whereas in the last ten years they have known considerable developments on the theoretical side, their study from the numerical point of view remains in its
early stages. The goal of this paper is to present the Grafidi library, a Python library which has been developed with the numerical simulation of nonlinear Schr{o}dinger equations on graphs in mind. We will show how, with the help of the Grafidi library, one can implement the popular normalized gradient flow and nonlinear conjugate gradient flow methods to compute ground states of a nonlinear quantum graph. We will also simulate the dynamics of the nonlinear Schr{o}dinger equation with a Crank-Nicolson relaxation scheme and a Strang splitting scheme. Finally, in a series of numerical experiments on various types of graphs, we will compare the outcome of our numerical calculations for ground states with the existing theoretical results, thereby illustrating the versatility and efficiency of our implementations in the framework of the Grafidi library.
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by heat equa
tions on the edges supplemented with Robin like boundary conditions at the vertices modeling exchanges between incident edges and the associated vertex. We describe the main properties of the system, and also derive the final total population of infected individuals. We present a semi-implicit in time numerical scheme based on finite differences in space which preserves the main properties of the continuous model such as the uniqueness and positivity of solutions and the conservation of the total population. We also illustrate our results with a selection of numerical simulations for a selection of connected graphs.
We show that the Strang splitting method applied to a diffusion-reaction equation with inhomogeneous general oblique boundary conditions is of order two when the diffusion equation is solved with the Crank-Nicolson method, while order reduction occur
s in general if using other Runge-Kutta schemes or even the exact flow itself for the diffusion part. We prove these results when the source term only depends on the space variable, an assumption which makes the splitting scheme equivalent to the Crank-Nicolson method itself applied to the whole problem. Numerical experiments suggest that the second order convergence persists with general nonlinearities.
We introduce and implement a method to compute stationary states of nonlinear Schrodinger equations on metric graphs. Stationary states are obtained as local minimizers of the nonlinear Schrodinger energy at fixed mass. Our method is based on a norma
lized gradient flow for the energy (i.e. a gradient flow projected on a fixed mass sphere) adapted to the context of nonlinear quantum graphs. We first prove that, at the continuous level, the normalized gradient flow is well-posed, mass-preserving, energy diminishing and converges (at least locally) towards stationary states. We then establish the link between the continuous flow and its discretized version. We conclude by conducting a series of numerical experiments in model situations showing the good performance of the discrete flow to compute stationary states. Further experiments as well as detailed explanation of our numerical algorithm are given in a companion paper.
We develop a general strategy in order to implement (approximate) discrete transparent boundary conditions for finite difference approximations of the two-dimensional transport equation. The computational domain is a rectangle equipped with a Cartesi
an grid. For the two-dimensional leapfrog scheme, we explain why our strategy provides with explicit numerical boundary conditions on the four sides of the rectangle and why it does not require prescribing any condition at the four corners of the computational domain. The stability of the numerical boundary condition on each side of the rectangle is analyzed by means of the so-called normal mode analysis. Numerical investigations for the full problem on the rectangle show that strong instabilities may occur when coupling stable strategies on each side of the rectangle. Other coupling strategies yield promising results.
This paper is concerned with the numerical integration in time of nonlinear Schrodinger equations using different methods preserving the energy or a discrete analog of it. The Crank-Nicolson method is a well known method of order 2 but is fully impli
cit and one may prefer a linearly implicit method like the relaxation method introduced in [10] for the cubic nonlinear Schr{o}dinger equation. This method is also an energy preserving method and numerical simulations have shown that its order is 2. In this paper we give a rigorous proof of the order of this relaxation method and propose a generalized version that allows to deal with general power law nonlinearites. Numerical simulations for different physical models show the efficiency of these methods.
We consider a general conservation law on the circle, in the presence of a sublinear damping. If the damping acts on the whole circle, then the solution becomes identically zero in finite time, following the same mechanism as the corresponding ordina
ry differential equation. When the damping acts only locally in space, we show a dichotomy: if the flux function is not zero at the origin, then the transport mechanism causes the extinction of the solution in finite time, as in the first case. On the other hand, if zero is a non-degenerate critical point of the flux function, then the solution becomes extinct in finite time only inside the damping zone, decays algebraically uniformly in space, and we exhibit a boundary layer, shrinking with time, around the damping zone. Numerical illustrations show how similar phenomena may be expected for other equations.
In this paper, we consider artificial boundary conditions for the linearized mixed Korteweg-de Vries (KDV) Benjamin-Bona-Mahoney (BBM) equation which models water waves in the small amplitude, large wavelength regime. Continuous (respectively discret
e) artificial boundary conditions involve non local operators in time which in turn requires to compute time convolutions and invert the Laplace transform of an analytic function (respectively the Z-transform of an holomor-phic function). In this paper, we propose a new, stable and fairly general strategy to carry out this crucial step in the design of transparent boundary conditions. For large time simulations, we also introduce a methodology based on the asymptotic expansion of coefficients involved in exact direct transparent boundary conditions. We illustrate the accuracy of our methods for Gaussian and wave packets initial data.
In this paper we consider two numerical scheme based on trapezoidal rule in time for the linearized KdV equation in one space dimension. The goal is to derive some suitable artificial boundary conditions for these two full discretization using Z-tran
sformation. We give some numerical benchmark examples from the literature to illustrate our findings.
