`a`
Journal of Computational Dynamics (JCD)
 

The computation of convex invariant sets via Newton's method

Pages: 39 - 69, Volume 1, Issue 1, June 2014      doi:10.3934/jcd.2014.1.39

 
       Abstract        References        Full Text (719.2K)       Related Articles       

R. Baier - Chair of Applied Mathematics, University of Bayreuth, 95440 Bayreuth, Germany (email)
M. Dellnitz - Chair of Applied Mathematics, University of Paderborn, 33098 Paderborn, Germany (email)
M. Hessel-von Molo - Chair of Applied Mathematics, University of Paderborn, 33098 Paderborn, Germany (email)
S. Sertl - Chair of Applied Mathematics, University of Paderborn, 33098 Paderborn, Germany (email)
I. G. Kevrekidis - Department of Chemical and Biological Engineering, Princeton University, Princeton, NJ 08544, United States (email)

Abstract: In this paper we present a novel approach to the computation of convex invariant sets of dynamical systems. Employing a Banach space formalism to describe differences of convex compact subsets of $\mathbb{R}^n$ by directed sets, we are able to formulate the property of a convex, compact set to be invariant as a zero-finding problem in this Banach space. We need either the additional restrictive assumption that the image of sets from a subclass of convex compact sets under the dynamics remains convex, or we have to convexify these images. In both cases we can apply Newton's method in Banach spaces to approximate such invariant sets if an appropriate smoothness of a set-valued map holds. The theoretical foundations for realizing this approach are analyzed, and it is illustrated first by analytical and then by numerical examples.

Keywords:  Nvariant sets, set-valued Newton's method, Newton's method in Banach spaces, directed sets.
Mathematics Subject Classification:  65J15, 52A20, 37M99, 26E25, 54C60.

Received: July 2012;      Revised: February 2014;      Available Online: April 2014.

 References