arXiv subjects

Maxime Breden

Publications and source records attributed to Maxime Breden.

28 records · Page 2Linked to original sources

arXiv2018

Computing invariant sets of random differential equations using polynomial chaos

Differential equations with random parameters have gained significant prominence in recent years due to their importance in mathematical modelling and data assimilation. In many cases, random ordinary differential equations (RODEs) are studied by using Monte-Carlo methods or by direct numerical simulation techniques using polynomial chaos (PC), i.e., by a series expansion of the random parameters in combination with forward integration. Here we take a dynamical systems viewpoint and focus on the invariant sets of differential equations such as steady states, stable/unstable manifolds, periodic orbits, and heteroclinic orbits. We employ PC to compute representations of all these different types of invariant sets for RODEs. This allows us to obtain fast sampling, geometric visualization of distributional properties of invariants sets, and uncertainty quantification of dynamical output such as periods or locations of orbits. We apply our techniques to a predator-prey model, where we compute steady states and stable/unstable manifolds. We also include several benchmarks to illustrate the numerical efficiency of adaptively chosen PC depending upon the random input. Then we employ the methods for the Lorenz system, obtaining computational PC representations of periodic orbits, stable/unstable manifolds and heteroclinic orbits.

math.DS↗

arXiv2018

Rigorous study of the equilibria of collision kernels appearing in the theory of weak turbulence

In this paper, we rigorously obtain all the equilibria of collision kernels of type "two particles give two particles" appearing in weak turbulence theory under very general assumptions, thus completing the "equality case" in Boltzmann's H-theorem for those models. We also provide some rigorous results for collision kernels of type "two particles give one particle", under assumptions which include some of the most classical kernels of this type. The method of proof is inspired by the quantitative estimates obtained for the Landau equation by Desvillettes in [J. Funct. Anal. 269:1359-1403, 2015].

math.AP↗

arXiv2017

Existence and instability of steady states for a triangular cross-diffusion system: a computer-assisted proof

In this paper, we present and apply a computer-assisted method to study steady states of a triangular cross-diffusion system. Our approach consist in an a posteriori validation procedure, that is based on using a fxed point argument around a numerically computed solution, in the spirit of the Newton-Kantorovich theorem. It allows us to prove the existence of various non homogeneous steady states for different parameter values. In some situations, we get as many as 13 coexisting steady states. We also apply the a posteriori validation procedure to study the linear stability of the obtained steady states, proving that many of them are in fact unstable.

math.AP↗

arXiv2017

Polynomial interpolation and a priori bootstrap for computer-assisted proofs in nonlinear ODEs

In this work, we introduce a method based on piecewise polynomial interpolation to enclose rigorously solutions of nonlinear ODEs. Using a technique which we call a priori bootstrap, we transform the problem of solving the ODE into one of looking for a fixed point of a high order smoothing Picard-like operator. We then develop a rigorous computational method based on a Newton-Kantorovich type argument (the radii polynomial approach) to prove existence of a fixed point of the Picard-like operator. We present all necessary estimates in full generality and for any nonlinearities. With our approach, we study two systems of nonlinear equations: the Lorenz system and the ABC flow. For the Lorenz system, we solve Cauchy problems and prove existence of periodic and connecting orbits at the classical parameters, and for ABC flows, we prove existence of ballistic spiral orbits.

math.DS↗

arXiv2017

Applications of improved duality lemmas to the discrete coagulation-fragmentation equations with diffusion

In this paper, we investigate the use of so called "duality lemmas" to study the system of discrete coagulation-fragmentation equations with diffusion. When the fragmentation is strong enough with respect to the coagulation, we show that we have creation and propagation of superlinear moments. In particular this implies that strong enough fragmentation can prevent gelation even for superlinear coagulation, a statement which was only known up to now in the homogeneous setting. We also use this control of superlinear moments to extend a recent result about the regularity of the solutions in the pure coagulation case, to strong fragmentation models.

math.AP↗

arXiv2017

Continuation of homoclinic orbits in the suspension bridge equation: a computer-assisted proof

In this paper, we prove existence of symmetric homoclinic orbits for the suspension bridge equation $u""+βu" + e^u-1=0$ for all parameter values $β\in [0.5,1.9]$. For each $β$, a parameterization of the stable manifold is computed and the symmetric homoclinic orbits are obtained by solving a projected boundary value problem using Chebyshev series. The proof is computer-assisted and combines the uniform contraction theorem and the radii polynomial approach, which provides an efficient means of determining a set, centered at a numerical approximation of a solution, on which a Newton-like operator is a contraction.

math.DS↗

arXiv2015

Smoothness of moments of the solutions of discrete coagulation equations with diffusion

In this paper, we establish smoothness of moments of the solutions of discrete coagulation-diffusion systems. As key assumptions, we suppose that the coagulation coefficients grow at most sub-linearly and that the diffusion coefficients converge towards a strictly positive limit (those conditions also imply the existence of global weak solutions and the absence of gelation).

math.AP↗

arXiv2015

Computation of maximal local (un)stable manifold patches by the parameterization method

In this work we develop some automatic procedures for computing high order polynomial expansions of local (un)stable manifolds for equilibria of differential equations. Our method incorporates validated truncation error bounds, and maximizes the size of the image of the polynomial approximation relative to some specified constraints. More precisely we use that the manifold computations depend heavily on the scalings of the eigenvectors: indeed we study the precise effects of these scalings on the estimates which determine the validated error bounds. This relationship between the eigenvector scalings and the error estimates plays a central role in our automatic procedures. In order to illustrate the utility of these methods we present several applications, including visualization of invariant manifolds in the Lorenz and FitzHugh-Nagumo systems and an automatic continuation scheme for (un)stable manifolds in a suspension bridge problem. In the present work we treat explicitly the case where the eigenvalues satisfy a certain non-resonance condition.

math.DS↗

arXiv2015

Global bifurcation diagram of steady states of systems of PDEs via rigorous numerics: a 3-component reaction-diffusion system

In this paper, we use rigorous numerics to compute several global smooth branches of steady states for a system of three reaction-diffusion PDEs introduced by Iida et al. [J. Math. Biol., {\bf 53}, 617--641 (2006)] to study the effect of cross-diffusion in competitive interactions. An explicit and mathematically rigorous construction of a global bifurcation diagram is done, except in small neighborhoods of the bifurcations. The proposed method, even though influenced by the work of van den Berg et al. [Math. Comp., {\bf 79}, 1565--1584 (2010)], introduces new analytic estimates, a new {\em gluing-free} approach for the construction of global smooth branches and provides a detailed analysis of the choice of the parameters to be made in order to maximize the chances of performing successfully the computational proofs.

math.DS↗

arXiv2015

Rigorous numerics for nonlinear operators with tridiagonal dominant linear part

We present a method designed for computing solutions of infinite dimensional non linear operators $f(x) = 0$ with a tridiagonal dominant linear part. We recast the operator equation into an equivalent Newton-like equation $x = T(x) = x - Af(x)$, where $A$ is an approximate inverse of the derivative $Df(\overline x)$ at an approximate solution $\overline x$. We present rigorous computer-assisted calculations showing that $T$ is a contraction near $\overline x$, thus yielding the existence of a solution. Since $Df(\overline x)$ does not have an asymptotically diagonal dominant structure, the computation of $A$ is not straightforward. This paper provides ideas for computing $A$, and proposes a new rigorous method for proving existence of solutions of nonlinear operators with tridiagonal dominant linear part.

math.DS↗