Jean‐Philippe Lessard

DS
h-index21
4papers
88citations
Novelty44%
AI Score27

4 Papers

1.2DSDec 20, 2011
Rigorous numerics in Floquet theory: computing stable and unstable bundles of periodic orbits

Roberto Castelli, Jean-Philippe Lessard

In this paper, a new rigorous numerical method to compute fundamental matrix solutions of non-autonomous linear differential equations with periodic coefficients is introduced. Decomposing the fundamental matrix solutions $Φ(t)$ by their Floquet normal forms, that is as product of real periodic and exponential matrices $Φ(t)=Q(t)e^{Rt}$, one solves simultaneously for $R$ and for the Fourier coefficients of $Q$ via a fixed point argument in a suitable Banach space of rapidly decaying coefficients. As an application, the method is used to compute rigorously stable and unstable bundles of periodic orbits of vector fields. Examples are given in the context of the Lorenz equations and the $ζ^3$-model.

2.3DSDec 21, 2011
A method to rigorously enclose eigendecompositions of interval matrices

Roberto Castelli, Jean-Philippe Lessard

In this paper, a rigorous computational method to enclose eigendecompositions of complex interval matrices is proposed. Each eigenpair $x=(λ,v)$ is found by solving a nonlinear equation of the form $f(x)=0$ via a contraction argument. The set-up of the method relies on the notion of radii polynomials, which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable.

2.0LGJul 28, 2023Code
Worrisome Properties of Neural Network Controllers and Their Symbolic Representations

Jacek Cyranka, Kevin E M Church, Jean-Philippe Lessard

We raise concerns about controllers' robustness in simple reinforcement learning benchmark problems. We focus on neural network controllers and their low neuron and symbolic abstractions. A typical controller reaching high mean return values still generates an abundance of persistent low-return solutions, which is a highly undesirable property, easily exploitable by an adversary. We find that the simpler controllers admit more persistent bad solutions. We provide an algorithm for a systematic robustness study and prove existence of persistent solutions and, in some cases, periodic orbits, using a computer-assisted proof methodology.

1.2DSSep 29, 2015
Rigorous numerics for ill-posed PDEs: periodic orbits in the Boussinesq equation

R. Castelli, M. Gameiro, J. -P. Lessard

In this paper, we develop computer-assisted techniques for the analysis of periodic orbits of ill-posed partial differential equations. As a case study, our proposed method is applied to the Boussinesq equation, which has been investigated extensively because of its role in the theory of shallow water waves. The idea is to use the symmetry of the solutions and a Newton-Kantorovich type argument (the radii polynomial approach), to obtain rigorous proofs of existence of the periodic orbits in a weighted $\ell^1$ Banach space of space-time Fourier coefficients with geometric decay. We present several computer-assisted proofs of existence of periodic orbits at different parameter values.