Search

Based on the control strategies, transmission mechanism and clinical progression of COVID-19, we propose a compartmental model with time delays. Two time delays are introduced into the model to describe the incubation period of the disease and the quarantine period of uninfected individuals who have contacts with infected people. In order to reveal the spread rule for COVID-19, we study the threshold dynamics for the model. The basic reproduction number \begin{document}$ \mathcal R_0 $\end{document} is obtained. When \begin{document}$ \mathcal R_0 , the disease-free equilibrium is locally asymptotically stable, when \begin{document}$ \mathcal R_0>1 $\end{document} , the disease-free equilibrium is unstable and the disease is uniformly persistent. As the model's applications, we study COVID-19 transmission in the United States. The parameters are chosen to fit public data in the US. The numerical results indicate that an outbreak peak time in the US will appear in the middle of March. Sensitive analysis results show that enhancing the control measures, such as keeping social distance, wearing masks, isolation etc., can significantly contribute to the prevention and control of COVID-19 infection.

This paper applies a powerful scheme, namely Bernoulli sub-equation function method, to some partial differential equations with high non-linearity. Many new travelling wave solutions, such as mixed dark-bright soliton, exponential and complex domain, are reported. Under a suitable choice of the values of parameters, wave behaviours of the results obtained in the paper – in terms of 2D, 3D and contour surfaces – are observed.

In this paper, we study the null controllability of a nonlinear age, space and two-sex structured population dynamics model. This model is such that the nonlinearity and the couplage are at birth level. We consider a population with males and females and we are dealing with two cases of null controllability problems. The first problem is related to the total extinction, which means that, we estimate a time \begin{document}$ T $\end{document} to bring the male and female subpopulation density to zero. The second case concerns null controllability of male or female subpopulation. Since the absence of males or females in the population stops births; so, if we have the total extinction of the females at time \begin{document}$ T, $\end{document} and if \begin{document}$ A $\end{document} is the life span of the individuals, at time \begin{document}$ T+A $\end{document} one will get certainly the total extinction of the population. Our method uses first an observability inequality related to the adjoint of an auxiliary system, a null controllability of the linear auxiliary system, and after the Schauder's fixed point theorem.

In this paper, we propose an efficient numerical method for a comprehensive infection model that is formulated by a system of nonlinear coupling advection-diffusion-reaction equations. Using some subtle mixed explicit-implicit treatments, we construct a linearized and decoupled discrete scheme. Moreover, the proposed scheme is capable of preserving the positivity of variables, which is an essential requirement of the model under consideration. The proposed scheme uses the cell-centered finite difference method for the spatial discretization, and thus, it is easy to implement. The diffusion terms are treated implicitly to improve the robustness of the scheme. A semi-implicit upwind approach is proposed to discretize the advection terms, and a distinctive feature of the resulting scheme is to preserve the positivity of variables without any restriction on the spatial mesh size and time step size. We rigorously prove the unique existence of discrete solutions and positivity-preserving property of the proposed scheme without requirements for the mesh size and time step size. It is worthwhile to note that these properties are proved using the discrete variational principles rather than the conventional approaches of matrix analysis. Numerical results are also provided to assess the performance of the proposed scheme.

Hyperbolic systems of conservation laws in multiple spatial dimensions display features absent in the one-dimensional case, such as involutions and non-trivial stationary states. These features need to be captured by numerical methods without excessive grid refinement. The active flux method is an extension of the finite volume scheme with additional point values distributed along the cell boundary. For the equations of linear acoustics, an exact evolution operator can be used for the update of these point values. It incorporates all multi-dimensional information. The active flux method is stationarity preserving, i.e., it discretizes all the stationary states of the PDE. This paper demonstrates the experimental evidence for the discrete stationary states of the active flux method and shows the evolution of setups towards a discrete stationary state.

Classical bearing capacity theory was developed mainly based on spatially uniform soil properties, which cannot account for the influence of inherent soil variability. If the soil strength is heterogeneous, then using the average strength may overestimate the bearing capacity of foundations, because the failure mechanism may preferentially mobilise the weaker soils. In this study the aim is to establish a theoretical model using upper-bound solutions applied to the bearing capacity analysis of shallow foundations on undrained clay considering spatial variability. The model is derived on the principle of least energy dissipation using a four-parameter variation on Prandtl's mechanism. The theoretical model developed is verified by the random finite-element (FE) method in spatially varying soil conditions. The results show that the model can accurately capture the effect of spatially varying strength on the shallow foundation failure mechanism. The difference of bearing capacity factor between the proposed model and the FE model is within 5%, which demonstrates that the four-parameter model has an accuracy that is comparable to FE analysis with many hundreds of degrees of freedom. Another advantage of the theoretical model is that the possible non-convergence in FE analysis can be avoided, and hence, the calculation efficiency is significantly enhanced. The model is therefore suitable for rapid quantification of bearing capacity in spatially varying soils.

We study fluid-saturated porous materials that undergo poro-elastic deformations in thin domains. The mechanics in such materials are described using a biphasic model based on the theory of porous media (TPM) and consisting of a system of differential equations for material’s displacement and fluid’s pressure. These equations are in general strongly coupled and nonlinear, such that exact solutions are hard to obtain and numerical solutions are computationally expensive. This paper reduces the complexity of the biphasic model in thin domains with a scale separation between domain’s width and length. Based on standard asymptotic analysis, we derive a reduced model that combines two sub-models. Firstly, a limit model consists of averaged equations that describe the fluid pore pressure and displacement in the longitudinal direction of the domain. Secondly, a corrector model re-captures the mechanics in the transverse direction. The validity of the reduced model is finally tested using a set of numerical examples. These demonstrate the computational efficiency of the reduced model, while maintaining reliable solutions in comparison with original biphasic TPM model in thin domain., Deutsche Forschungsgemeinschaft, Projekt DEAL

Statistical solutions have recently been introduced as an alternative solution framework for hyperbolic systems of conservation laws. In this work, we derive a novel a posteriori error estimate in the Wasserstein distance between dissipative statistical solutions and numerical approximations obtained from the Runge-Kutta Discontinuous Galerkin method in one spatial dimension, which rely on so-called regularized empirical measures. The error estimator can be split into deterministic parts which correspond to spatio-temporal approximation errors and a stochastic part which reflects the stochastic error. We provide numerical experiments which examine the scaling properties of the residuals and verify their splitting., Baden-Württemberg Stiftung, Projekt DEAL, Deutsche Forschungsgemeinschaft

We propose a new three-dimensional formulation based on the mixed tangential-displacement normal-normal-stress method for elasticity. In elastic tangential-displacement normal-normal-stress elements, the tangential component of the displacement field and the normal component of the stress vector are degrees of freedom and continuous across inter-element interfaces. Tangential-displacement normal-normal-stress finite elements have been shown to be locking-free with respect to shear locking in thin elements, which makes them suitable for the discretization of laminates or macro-fiber composites. In the current paper, we extend the formulation to piezoelectric materials by adding the electric potential as degree of freedom.

We show that the solution (in the sense of distribution) to the Cauchy problem with the periodic boundary condition associated with the modified Benjamin–Ono equation is unique in $L^\infty _t(H^s(\mathbb{T} ))$ for $s>1/2$. The proof is based on the analysis of a normal form equation obtained by infinitely many reduction steps using integration by parts in time after a suitable gauge transform.

We design a virtual element method for the numerical treatment of the two-dimensional parabolic variational inequality problem on unstructured polygonal meshes. Due to the expected low regularity of the exact solution, the virtual element method is based on the lowest-order virtual element space that contains the subspace of the linear polynomials defined on each element. The connection between the nonnegativity of the virtual element functions and the nonnegativity of the degrees of freedom, i.e., the values at the mesh vertices, is established by applying the Maximum and Minimum Principle Theorem. The mass matrix is computed through an approximate L 2 polynomial projection, whose properties are carefully investigated in the paper. We prove the well-posedness of the resulting scheme in two different ways that reveal the contractive nature of the VEM and its connection with the minimization of quadratic functionals. The convergence analysis requires the existence of a nonnegative quasi-interpolation operator, whose construction is also discussed in the paper. The variational crime introduced by the virtual element setting produces five error terms that we control by estimating a suitable upper bound. Numerical experiments confirm the theoretical convergence rate for the refinement in space and time on three different mesh families including distorted squares, nonconvex elements, and Voronoi tesselations.

The understanding of nonlinear, high dimensional flows, e.g, atmospheric and ocean flows, is critical to address the impacts of global climate change. Data Assimilation techniques combine physical models and observational data, often in a Bayesian framework, to predict the future state of the model and the uncertainty in this prediction. Inherent in these systems are noise (Gaussian and non-Gaussian), nonlinearity, and high dimensionality that pose challenges to making accurate predictions. To address these issues we investigate the use of both model and data dimension reduction based on techniques including Assimilation in Unstable Subspaces, Proper Orthogonal Decomposition, and Dynamic Mode Decomposition. Algorithms that take advantage of projected physical and data models may be combined with Data Analysis techniques such as Ensemble Kalman Filter and Particle Filter variants. The projected Data Assimilation techniques are developed for the optimal proposal particle filter and applied to the Lorenz'96 and Shallow Water Equations to test the efficacy of our techniques in high dimensional, nonlinear systems., 30 pages, 13 figures, 3 tables To appear in Computers & Mathematics with Applications, 2021,ISSN 0898-1221

An efficient strategy for the numerical solution of time-fractional diffusion-reaction problems is devised. A standard finite difference discretization of the space derivative is initially applied which results in a linear stiff term. Then a rectangular product-integration (PI) rule is implemented in an implicit-explicit (IMEX) framework in order to implicitly treat this linear stiff term and handle in an explicit way the non-linear, and usually non-stiff, term. The kernel compression scheme (KCS) is successively adopted to reduce the overload of computation and storage need for the persistent memory term. To reduce the computational effort the semidiscretized problem is described in a matrix-form, so as to require the solution of Sylvester equations only with small matrices. Theoretical results on the accuracy, together with strategies for the optimal selection of the main parameters of the whole method, are derived and verified by means of numerical experiments carried out in two-dimensional domains. The computational advantages with respect to other approaches are also shown and some applications to the detection of pattern formation are illustrated at the end of the paper.

We address the issue of designing robust stabilization terms for the nonconforming virtual element method. To this end, we transfer the problem of defining the stabilizing bilinear form from the elemental nonconforming virtual element space, whose functions are not known in closed form, to the dual space spanned by the known functionals providing the degrees of freedom. By this approach, we manage to construct different bilinear forms yielding optimal or quasi-optimal stability bounds and error estimates, under weaker assumptions on the tessellation than the ones usually considered in this framework. In particular, we prove optimality under geometrical assumptions allowing a mesh to have a very large number of arbitrarily small edges per element. Finally, we numerically assess the performance of the VEM for several different stabilizations fitting with our new framework on a set of representative test cases.

In this paper we develop a general computer-assisted proof method for periodic solutions to delay differential equations. The class of problems considered includes systems of delay differential equations with an arbitrary number of (forward and backward) delays. When the nonlinearities include nonpolynomial terms we introduce auxiliary variables to first rewrite the problem into an equivalent polynomial one. We then apply a flexible fixed point technique in a space of geometrically decaying Fourier coefficients. We showcase the efficacy of this method by proving periodic solutions in the well-known Mackey–Glass delay differential equation for the classical parameter values.

Part of the work was done while the authors were visiting the South China University of Science and Technology (SUSTech), Shenzhen, in 2018, and we are grateful (in particular to Professor Cai Heng Li) for the hospitality that we received.The authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no.EP/R014604/1), where further work on this paper was undertaken. In particular we acknowledge a Simons Fellowship (Cameron) and a Kirk Distinguished Visiting Fellowship (Praeger) during this programme. Schneider thanks the Centre for the Mathematics of Symmetry and Computation of The University of Western Australia and Australian Research Council Discovery Grant DP160102323 for hosting his visit in 2017 and acknowledges the support of the CNPq projects Produtividade em Pesquisa (project no.: 308212/2019-3) and Universal (project no.:421624/2018-3). Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied in general. The main purpose of this paper is to describe and characterise such structures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan-Scott theorem, which are defined over finite characteristically simple groups, our construction works over arbitrary groups, finite or infinite. A diagonal semilattice depends on a dimension m and a group T. For m=2, it is a Latin square, the Cayley table of T, though in fact any Latin square satisfies our combinatorial axioms. However, for m≥3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in great profusion but higher-dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set Ω, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions turn out to be equivalent for diagonal groups). Associated with the diagonal semilattice is a graph, the diagonal graph, which has the same automorphism group as the diagonal semilattice except in four small cases with m

This article examines the accuracy for large times of asymptotic expansions from periodic homogenization of wave equations. As usual, $\epsilon$ denotes the small period of the coefficients in the wave equation. We first prove that the standard two scale asymptotic expansion provides an accurate approximation of the exact solution for times $t$ of order $\epsilon^{-2+\delta}$ for any $\delta>0$. Second, for longer times, we show that a different algorithm, that is called criminal because it mixes different powers of $\epsilon$, yields an approximation of the exact solution with error $O(\epsilon^N)$ for times $\epsilon^{-N}$ with $N$ as large as one likes. The criminal algorithm involves high order homogenized equations that, in the context of the wave equation, were first proposed by Santosa and Symes and analyzed by Lamacz. The high order homogenized equations yield dispersive corrections for moderate wave numbers. We give a systematic analysis for all time scales and all high order corrective terms.

In this article we derive the expression of \textit{renormalized energies} for unit-valued harmonic maps defined on a smooth bounded domain in \(\mathbb{R}^2\) whose boundary has several connected components. The notion of renormalized energies was introduced by Bethuel-Brezis-H\'elein in order to describe the position of limiting Ginzburg-Landau vortices in simply connected domains. We show here, how a non-trivial topology of the domain modifies the expression of the renormalized energies. We treat the case of Dirichlet boundary conditions and Neumann boundary conditions as well.

Sparse direct solvers using Block Low-Rank compression have been proven efficient to solve problems arising in many real-life applications. Improving those solvers is crucial for being able to 1) solve larger problems and 2) speed up computations. A main characteristic of a sparse direct solver using low-rank compression is when compression is performed. There are two distinct approaches: (1) all blocks are compressed before starting the factorization, which reduces the memory as much as possible, or (2) each block is compressed as late as possible, which usually leads to better speedup. The objective of this paper is to design a composite approach, to speedup computations while staying under a given memory limit. This should allow to solve large problems that cannot be solved with Approach 2 while reducing the execution time compared to Approach 1.We propose a memory-aware strategy where each block can be compressed either at the beginning or as late as possible. We first consider the problem of choosing when to compress each block, under the assumption that all information on blocks is perfectly known, i.e., memory requirement and execution time of a block when compressed or not. We show that this problem is a variant of the NP-complete Knapsack problem, and adapt an existing 2-approximation algorithm for our problem. Unfortunately, the required information on blocks depends on numerical properties and in practice cannot be known in advance. We thus introduce models to estimate those values. Experiments on the PaStiX solver demonstrate that our new approach can achieve an excellent trade-off between memory consumption and computational cost. For instance on matrix Geo1438, Approach 2 uses three times as much memory as Approach 1 while being three times faster. Our new approach leads to an execution time only 30% larger than Approach 2 when given a memory 30% larger than the one needed by Approach 1., Les solveurs directs creux utilisant de la compression low-rank ont montré leur efficacité pour résoudre de grands systèmes. Les améliorer permetde 1) résoudre de plus grands problèmes et 2) accélérer la résolution. Une caractéristique principale de ces solveurs est quand la compression est réalisée. Il existe deux approches: (1) tous les blocs sont compressés avant le début de la factorisation, ce qui minimise la consommation mémoire, ou (2) chaque bloc est compressé au plus tard, ce qui permet d’avoir de meilleures performances. L’objectif de cet article est de proposer une approche intermédiaire, qui accélère les calculs au maximum tout en restant en dessous d’une limite mémoire donnée. Cela devrait permettre de résoudre de grands problèmes que l’approche 2 ne peut pas résoudre ou de réduire le temps d’exécution de l’approche 1. Nous proposonsune stratégie memory-aware où chaque bloc peut ˆêtre compressé au début ou au plus tard. Nous commençons par considérer le problème où toutes les informations (consommation mémoire et temps d’exécution en version compressée ou non) sont parfaitement connues. Nous montrons que ce problème est une variante du problème NP-complet Knapsack et adaptons une 2-approximation pour notre problème. Malheureusement, toutes ces informations dépendent de propriétés numériques et ne sont pas connues `a l’avance. Des modèles sont donc introduits afin d’estimer ces valeurs. Des expérimentations avec le solveur PaStiX montrent que notre approche permet d’avoir un excellent compromis entre consommation mémoire et temps d’exécution. Par exemple, pour la matrice Geo1438, l’approche 2 utilise trois fois plus de mémoire que l’approche 1, qui est trois fois plus lente. Notre nouvelle méthode permet d’obtenir à la fois un temps d’exécution seulement 30% supérieur à celui de l’approche 2 tout en ayant une consommation mémoire seulement supérieure de 30% à celle de l’approche 1.

We present a gentle approach to the justification of effective media approximations, for PDE's set outside the union of $n \gg 1$ spheres with low volume fraction. To illustrate our approach, we consider three classical examples: the derivation of the so-called strange term, made popular by Cioranescu and Murat, the derivation of the Brinkman term in the Stokes equation, and a scalar analogue of the effective viscosity problem. Under some separation assumption on the spheres, valid for periodic and random distributions of the centers, we recover effective models as $n$ goes to infinity by simple arguments., 20 pages. Final version, to appear in Asympt. Anal

In this paper, we investigate the relationships between proper efficiency and the solutions of a general scalarization problem in multi-objective optimization. We provide some conditions under which the solutions of the dealt with scalar program are properly efficient and vice versa. We also show that, under some conditions, if the considered general scalar problem is unbounded, then the original multi-objective problem does not have any properly efficient solution. In another part of the work, we investigate a general transformation of the objective functions which preserves proper efficiency. We show that several important results existing in the literature are direct consequences of the results of the present paper.

Beam-like compliant elements have found wide-ranging application in many fields of engineering and science often where 3D large deflections can be of concern such as soft robotics, DNA mechanics and helicopter/wind turbine rotor blades. The homotopy analysis method (HAM) is used for the first time to obtain a novel analytical solution in converged series form for the arbitrary large deflection of geometrically exact beams subject to both conservative and follower loading scenarios. The homotopy analysis method, which offers desirable characteristics such as being free from small or large parameters, coupled with auxiliary parameters controlling convergence, is applied directly to the intrinsic governing equations of a geometrically exact beam theory. The system of first-order differential governing equations of geometrically exact beams with intrinsic formulation is free from rotation and displacement variables, and offers a low degree of nonlinearity (quadratic at most) and compact mathematical form, making it suitable for analytical solutions. Due to the relatively poor convergence of the original HAM algorithm, the iterative HAM technique is employed which is known to accelerate convergence and to improve the computational efficiency of the homotopy analysis method. The obtained homotopy series offers a number of novel features in the context of the analytical solutions for the large deflection of beams, including (a) the direct calculation of internal forces and moments which is significant for engineering design purposes, (b) being able to capture 3D deflections, (c) considering transverse shear effects which can be important for thicker beams or when the Young’s modulus to shear modulus ratio is significant (such as composite materials) and (d) considering conservative and follower tip and distributed loads, in a unified framework. In order to investigate the efficacy, applicability and accuracy of the proposed method, a number of numerical examples are considered in which a cantilever beam subject to tip or distributed loads undergoes large deflection. Large deflection results for both conservative and follower loads are compared against those of less comprehensive analytical solutions as well as against numerical methods including finite element and Chebyshev collocation methods where good agreement is observed. These results demonstrate the applicability and effectiveness of HAM for the large deflection analysis of geometrically exact beams.

This paper is concerned with the recovery of (approximate) solutions to parabolic problems from incomplete and possibly inconsistent observational data, given on a time-space cylinder that is a strict subset of the computational domain under consideration. Unlike previous approaches to this and related problems our starting point is a regularized least squares formulation in a continuous infinite-dimensional setting that is based on stable variational time-space formulations of the parabolic partial differential equation. This allows us to derive a priori as well as a posteriori error bounds for the recovered states with respect to a certain reference solution. In these bounds the regularization parameter is disentangled from the underlying discretization. An important ingredient for the derivation of a posteriori bounds is the construction of suitable Fortin operators which allow us to control oscillation errors stemming from the discretization of dual norms. Moreover, the variational framework allows us to contrive preconditioners for the discrete problems whose application can be performed in linear time, and for which the condition numbers of the preconditioned systems are uniformly proportional to that of the regularized continuous problem. In particular, we provide suitable stopping criteria for the iterative solvers based on the a posteriori error bounds. The presented numerical experiments quantify the theoretical findings and demonstrate the performance of the numerical scheme in relation with the underlying discretization and regularization.

In a previous paper, we obtained several "compact versions" of Rubio de Francia's weighted extrapolation theorem, which allowed us to extrapolate the compactness of linear operators from just one space to the full range of weighted Lebesgue spaces, where these operators are bounded. In this paper, we study the extrapolation of compactness for bilinear operators in terms of bilinear Muckenhoupt weights. As applications, we easily recover and improve earlier results on the weighted compactness of commutators of bilinear Calder\'{o}n-Zygmund operators, bilinear fractional integrals and bilinear Fourier multipliers. More general versions of these results are recently due to Cao, Olivo and Yabuta (arXiv:2011.13191), whose approach depends on developing weighted versions of the Fr\'echet--Kolmogorov criterion of compactness, whereas we avoid this by relying on "softer" tools, which might have an independent interest in view of further extensions of the method., Comment: v3: final version, incorporated referee comments, to appear in Indagationes Mathematicae, 27 pages

We introduce and analyze a stress-based formulation for Zener's model in linear viscoelasticity. The method is aimed to tackle efficiently heterogeneous materials that admit purely elastic and viscoelastic parts in their composition. We write the mixed variational formulation of the problem in terms of a class of tensorial wave equation and obtain an energy estimate that guaranties the well-posedness of the problem through a standard Galerkin procedure. We propose and analyze mixed continuous and discontinuous Galerkin space discretizations of the problem and derive optimal error bounds for each semidiscrete solution in the corresponding energy norm., Comment: arXiv admin note: text overlap with arXiv:2005.01021

Many problems in engineering can be understood as controlling the bifurcation structure of a given device. For example, one may wish to delay the onset of instability, or bring forward a bifurcation to enable rapid switching between states. We propose a numerical technique for controlling the bifurcation diagram of a nonlinear partial differential equation by varying the shape of the domain. Specifically, we are able to delay or advance a given branch point to a target parameter value. The algorithm consists of solving a shape optimization problem constrained by an augmented system of equations, the Moore--Spence system, that characterize the location of the branch points. Numerical experiments on the Allen--Cahn, Navier--Stokes, and hyperelasticity equations demonstrate the effectiveness of this technique in a wide range of settings., 20 pages, 11 figures

We present a new discretization approach to advection-diffusion problems with Robin boundary conditions on complex, time-dependent domains. The method is based on second order cut cell finite volume methods introduced by Bochkov et al. [8] to discretize the Laplace operator and Robin boundary condition. To overcome the small cell problem, we use a splitting scheme along with a semi-Lagrangian method to treat advection. We demonstrate second order accuracy in the L 1 , L 2 , and L ∞ norms for both analytic test problems and numerical convergence studies. We also demonstrate the ability of the scheme to convert one chemical species to another across a moving boundary.

The Kuramoto–Sinelshchikov–Cahn–Hilliard equation models the spinodal decomposition of phase separating systems in an external field, the spatiotemporal evolution of the morphology of steps on crystal surfaces and the growth of thermodynamically unstable crystal surfaces with strongly anisotropic surface tension. In this paper, we prove the well-posedness of the Cauchy problem, associated with this equation.

Many systems in life sciences have been modeled by reaction–diffusion equations. However, under some circumstances, these biological systems may experience instantaneous and periodic perturbations (e.g. harvest, birth, release, fire events, etc) such that an appropriate formalism like impulsive reaction–diffusion equations is necessary to analyze them. While several works tackled the issue of traveling waves for monotone reaction–diffusion equations and the computation of spreading speeds, very little has been done in the case of monotone impulsive reaction–diffusion equations. Based on vector-valued recursion equations theory, we aim to present in this paper results that address two main issues of monotone impulsive reaction–diffusion equations. Our first result deals with the existence of traveling waves for monotone systems of impulsive reaction–diffusion equations. Our second result tackles the computation of spreading speeds for monotone systems of impulsive reaction–diffusion equations. We apply our methodology to a planar system of impulsive reaction–diffusion equations that models tree–grass interactions in fire-prone savannas. Numerical simulations, including numerical approximations of spreading speeds, are finally provided in order to illustrate our theoretical results and support the discussion.

The earliest events leading to atherosclerosis involve the transport of lpw density lipooprotein (LDL) cholesterol from the blood across endothelial cells that line the artery wall. Laplace’s equation describes the steady state diffusion profile of a tracer through the vessel wall. This gives rise to a boundary value problem with mixed Dirichlet and Robin conditions. We construct a linear system of integral equations that approximate the coefficients of the series expansion of the solution. We prove the existence of the solution to this problem analytically by using Gershgorin’s theorem on the location of the eigenvalues of the corresponding matrix. We give a uniqueness proof using Miranda’s theorem [C. Miranda, P.D.E. of Elliptic Type, Springer-Verlag, Berlin, 1970]. The analytical construction method forms the basis for a numerical calculation algorithm. We apply our results to the transport problem above, and use them to interpret experimental observations of the growth of localized tracer leakage spots with tracer circulation time.

Dans les Discours, Machiavel pose que les conflits entre le peuple et l’aristocratie ont assuré la grandeur de Rome ; mais il doit considérer aussi les cas des désordres sociaux incontrôlables et la nécessité d’un pouvoir autocratique pour les maîtriser. Machiavel est ainsi conduit à une analyse des passions qui sont à la base des émeutes populaires, notamment dans les Histoires florentines. Lorsque Guichardin écrivit ses Considérations, il essaya d’offrir une autre théorie du conflit social. In Discours, Machiavelli suggests that a moderate social conflict, namely that between patricians and plebeians in Rome, is likely to create the best conditions for state improvement; but he also needs to consider the case of an overwhelming conflict, and the subsequent advent of an extraordinary autocratic power to harness it. For this reason, especially in Histoires florentines, he analyses the popular passions founding the riots. After Machiavelli’s death, Guicciardini wrote his Considérations advancing an alternative thesis about social disorders.

Qui est habilité à prendre la plume, lorsque cette plume écrit l’histoire ? Du milieu du XIVe au début du XVIe siècle, la question n’a cessé d’accompagner le développement de nouvelles formes d’historiographie et la conquête, par les écrivains d’histoire, de statuts socio-culturels valorisés. La cour de Bourgogne a été l’un des principaux foyers de ce phénomène, que le livre d’Alexandre Grosjean contribue à mieux cerner. Il faut d’emblée saluer trois apports fondamentaux de cet ouvrage pionn...

C’est infime mais c’est quelque chose.Louis-Ferdinand Celine, Entretien, octobre 1954. Le détail défie le sens commun : on passe sur les détails, on entre dans le détail, on peut aussi se perdre dans les détails ; il est tantôt superflu, tantôt essentiel. Ce qui est un détail pour l’un est tout sauf un détail pour l’autre : « car un détail “vu” peut ne pas avoir été “fait” ; un détail peut être “inventé”, au sens archéologique du terme par le désir de celui qui regarde », nous rappelle Daniel...

International audience; This paper discusses George R. R. Martin’s literary saga, A Song of Ice and Fire, and its now famous adaptation as a TV show, Game of Thrones. Critics have been keen to underline the “realism” of these cycles; but the authors of the present study seek to re-examine what kind of real is being represented and re-created here. Which Middle Ages are we talking about? Far from being a unified historical block, the Middle Ages are a rich and complex period, marked by many evolutions. The world created by Martin thus merits close analysis: which elements are being used or left out, and which play a crucial or marginal role in the story? Such questions will allow us to gain a better understanding of how Middle Ages are represented today.; Cet article se penche sur la grande saga de George R.R. Martin, A Song of Ice and Fire, et sa célèbre adaptation en série télé, Game of Thrones. Là où tous les critiques soulignent le « réalisme » de ces cycles, les auteurs de cet article se demandent quel est ce réel représente et réimaginé : de quel Moyen Age parle-t-on ? Car le Moyen Age, loin d'être un bloc historique, est une période riche et complexe, marquée par de nombreuses évolutions. Il s'agit des lors de s'intéresser de près au monde crée par Martin, pour se demander quels éléments sont retenus ou laisses de cote, places au cœur de l'intrigue ou en marge de l'histoire, ce qui conduit aussi à s'interroger sur ce que cela nous dit des représentations contemporaines du Moyen Age.

International audience; In Book III of his Essays, Montaigne denounces the passions as diseases of the soul, originators of the private and public vices played out in the theater of France’s civil wars. By contrast, he represents himself as an example of the vir bonus, a man if not entirely liberated from the passions, at least making a constant effort to free himself from them: control of the passions is a defining feature of the ethos which has underpinned the exemplary scope of his discourse, which is located within a framework of true civil humanism.; Dans le livre III des Essais, Montaigne dénonce les passions comme des maladies de l’âme, à l’origine des vices privés et publics dont la France des guerres civiles est le théâtre. Il donne ainsi de lui-même, par contraste, une représentation en vir bonus, sinon entièrement libéré des passions, du moins faisant un effort constant pour s’en libérer : le contrôle des passions définit l’éthos qui garantit la portée exemplaire de son discours, dans le cadre d’un véritable humanisme civil.

Dans la culture théologique du Moyen Âge, le scandale est une notion centrale mais relativement diffuse, jusqu’à ce qu’une typologie soit proposée au XIIIe siècle. « Esclandre » puis « scandale » font alors leur entrée dans la langue vernaculaire. Aux XVe et XVIe siècles, ils sont employés par diverses formes théâtrales, notamment les moralités. Ces jeux pédagogiques, diffusés souvent par des intellectuels, s’intéressent au scandale dans la mesure où ils y voient un paradoxe : objectif à dénoncer en le révélant sur scène, il offre des types de personnages, des mises en scène, et une forme particulière de communication morale avec le spectateur. Au début du XVIe siècle, se produit une importante remise en perspective du scandale par les penseurs réformés. Les catégories sont bouleversées, des tensions se produisent entre loi et liberté, entre ordre et désordre, et se répercutent dans les champs politiques, sociaux et culturels. De 1520 à 1550, la moralité dramatique connaît une croissance exceptionnelle dans un espace public en crise où elle apporte réflexions et débats. Puis, surveillée, souvent condamnée, elle doit, au milieu du XVIe siècle, faire face aux ambiguïtés « scandaleuses » dont elle avait fait la source de son succès. In early medieval theology, scandal was a crucial but somewhat unspecified notion until a new classification appeared in the 13th century, at which point the terms “esclandre”, then “scandale” entered the French language. In the 15th and 16th centuries, these terms were used in morality plays, a literary form that was very popular in academic circles because of its pedagogical potential, with the result that scandal began to be seen in a new light. These plays used the notion as a dramatic paradox. Since their aim was to examine the problems that needed to be overcome in order to attain salvation, they sought to denounce sins and weaknesses through visual performance, creating thereby “salutary scandals” in the audience’s mind. Theological arguments thus inspired particular types of characters, staging techniques and moral messages for the benefit of spectators. However, in the 16th century, debates between Catholics and Reformers made the notion of scandal more complicated and ambiguous, under the influence of new ideas about law and freedom, order and disorder. From 1520 to 1550, morality plays dominated French-speaking theatrical culture, providing extensive discussions about what was “scandalous” or “non-scandalous” in the eyes of the public. By the middle of the 16th century, when they were in danger of being censored, morality plays eventually had to confront and resolve the very ambiguities on which they had built their former success.

International audience; The aim of this essay is to analyze Machiavellian strategies of reading and using Herodian (in particular the Latin version of Herodian, published by Poliziano in 1493) as a source of patterns of examples in The Prince and Discourses on Livy's Roman History.; Cette étude a pour but la réception de la version latine d'Hérodien, que Politien publia en 1493, dans le Prince et les Discours sur la première décade de Tite Live de Machiavel.

International audience; In the first edition of this book, we discussed methods for determining the support of an inhomogeneous media from measured far field data as well as an extensive study of the central role played by the transmission eigenvalue problem in the mathematical development of these methods. In particular, we introduced the generalized linear sampling method (GLSM) and showed that this method provides a mathematical explanation of why it is permissible to use Tikhonov regularization to obtain an approximate solution of the far field equation associated with the linear sampling method.In the five years since the first edition of our book appeared, there has been considerable progress in both the development of GLSM as well as the theory of transmission eigenvalues. In this second edition, in addition to correcting typos in the first edition, we have added several highlights taken from these new developments. In particular, we have included new chapters on 1) the use of modified background media in the nondestructive testing of materials and in particular methods for determining the modified transmission eigenvalues that arise in such applications from measured far field data, 2) a study of a subset of transmission eigenvalues, called non-scattering wave numbers, through the use of techniques taken from the theory of free boundary value problems for elliptic partial differential equations and 3) the duality between scattering poles and transmission eigenvalues which, in addition to their intrinsic mathematical interest, leads to new methods for the numerical computation of scattering poles.

In this paper, we give a short proof of the Lorentz estimates for gradients of very weak solutions to the linear parabolic equations with the Muckenhoupt class A q -weights u t − div ( A ( x , t ) ∇ u ) = div ( F ) , in a bounded domain Ω × ( 0 , T ) ⊂ R N + 1 , where A has a small mean oscillation, and Ω is a Lipchistz domain with a small Lipschitz constant.

In this paper, we consider a class of nonlocal equations where the convolution kernel is given by a Bessel potential symbol of order $\alpha$ for $\alpha > 1$. Based on the properties of the convolution operator, we apply a global bifurcation technique to show the existence of a highest, even, $2\pi$-periodic traveling-wave solution. The regularity of this wave is proved to be exactly Lipschitz., Comment: 22 pages. arXiv admin note: text overlap with arXiv:1810.00248 by other authors

We present a construction of a multi-scale Gaussian beam parametrix for the Dirichlet boundary value problem associated with the wave equation, and study its convergence rate to the true solution in the highly oscillatory regime. The construction elaborates on the wave-atom parametrix of Bao, Qian, Ying, and Zhang and extends to a multi-scale setting the technique of Gaussian beam propagation from a boundary of Katchalov, Kurylev and Lassas., Comment: 64 pages, 7 figures, minor update

Geological disasters such as slope failure and landslides can cause loss of life and property. Therefore, reproducing their evolution process is of great importance for risk assessment and mitigation. The recently developed SIMSAND critical state sand model combined with the smoothed particle hydrodynamics (SPH) method is adopted in this work to study slope failure under large deformations. To illustrate the efficiency and accuracy of the SIMSAND-SPH approach, a series of slope collapse studies using the discrete element method (DEM) considering various particle shapes (i.e. spherical, tetrahedral and elongated) is adopted as benchmarks. The parameters of the SIMSAND model are calibrated using DEM triaxial tests. In comparison to the DEM simulations, the runout distance and final slope height are well characterized with the SIMSAND-SPH approach with less computational cost. All comparisons show that the SIMSAND-SPH approach is highly efficient and accurate, which can be an alternative numerical tool to simulate real scale granular flow.

We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu and of Bhatia and Davis concerning measures on the line to several dimensions. This is done using convex duality and (infinite-dimensional) linear programming. The following consequence of our bounds exhibits symmetry breaking, provides a new proof of Jung’s theorem, and turns out to have applications to the aggregation dynamics modelling attractive–repulsive interactions: among probability measures on [Formula: see text] whose support has diameter at most [Formula: see text], we show that the variance around the mean is maximized precisely by those measures that assign mass [Formula: see text] to each vertex of a standard simplex. For [Formula: see text], the [Formula: see text] th moment—optimally centered—is maximized by the same measures among those satisfying the diameter constraint.

We address a Timoshenko system with memory in the history context and thermoelasticity of type III for heat conduction. Our main goal is to prove its uniform (exponential) stability by illustrating carefully the sensitivity of the heat and history couplings on the Timoshenko system. This investigation contrasts previous insights on the subject and promotes a new perspective with respect to the stability of the thermo-viscoelastic problem carried out, by combining the whole strength of history and thermal effects.

Frequently, the design of physicochemical processes requires screening of large numbers of alternative designs with complex geometries. These geometries may result in conformal meshes which introduce stability issues, significant computational complexity, and require user-interaction for their creation. In this work, a method for simulation of heat transfer using the diffuse interface method to capture complex geometry is presented as an alternative to a conformal meshing, with analysis and comparisons given. The methods presented include automated non-iterative generation of phase fields from CAD geometries and an extension of the diffuse interface method for mixed boundary conditions. Simple measures of diffuse interface quality are presented and found provide predictions of performance. The method is applied to a realistic heat transfer problem and compared to the traditional conformal mesh approach. It is found to enable reasonable accuracy at an order-of-magnitude reduction in simulation time or comparable accuracy for equivalent simulation times.

In this article, we investigate some of the fine properties of the value function associated to an optimal control problem in the Wasserstein space of probability measures. Building on new interpolation and linearisation formulas for non-local flows, we prove semiconcavity estimates for the value function, and establish several variants of the so-called sensitivity relations which provide connections between its superdifferential and the adjoint curves stemming from the maximum principle. We subsequently make use of these results to study the propagation of regularity for the value function along optimal trajectories, as well as to investigate sufficient optimality conditions and optimal feedbacks for mean-field optimal control problems., Comment: 55 pages

Using the approach of so-called c-sequences introduced by the fifth author in his recent work, we give much simpler and shorter proofs of multivalued Perov's type results with respect to the ones presented in the recently published paper by M. Abbas et al. Our proofs improve, complement, unify and enrich the ones from the recent papers. Further, in the last section of this paper, we correct and generalize the well-known Perov's fixed point result. We show that this result is in fact equivalent to Banach's contraction principle.

In this article we continue with the research initiated in our previous work on singular Liouville equations with quantized singularity. The main goal of this article is to prove that as long as the bubbling solutions violate the spherical Harnack inequality near a singular source, the first derivatives of coefficient functions must tend to zero., 24 pages. arXiv admin note: substantial text overlap with arXiv:2202.10825