Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Robert C. Vandervorst is active.

Publication


Featured researches published by Robert C. Vandervorst.


Foundations of Computational Mathematics | 2005

An Algorithmic Approach to Chain Recurrence

William D. Kalies; Konstantin Mischaikow; Robert C. Vandervorst

AbstractIn this paper we give a new definition of the chain recurrent set of a continuous map using finite spatial discretizations. This approach allows for an algorithmic construction of isolating blocks for the components of Morse decompositions which approximate the chain recurrent set arbitrarily closely as well as discrete approximations of Conley’s Lyapunov function. This is a natural framework in which to develop computational techniques for the analysis of qualitative dynamics including rigorous computer-assisted proofs.


Nonlinear Analysis-theory Methods & Applications | 2001

Slow motion in higher-order systems and G-convergence in one space dimension

William D. Kalies; Robert C. Vandervorst; Thomas Wanner

The slow motion in higher-order systems and Γ-convergence in one space dimension was studied. Some of the theorems and computations that support and proves the stability of the equations are presented.


Transactions of the American Mathematical Society | 2002

Second order Lagrangian twist systems: simple closed characteristics

J. van den Berg; Robert C. Vandervorst

We consider a special class of Lagrangians that play a fundamental role in the theory of second order Lagrangian systems: Twist systems. This subclass of Lagrangian systems is defined via a convenient monotonicity property that such systems share. This monotonicity property (Twist property) allows a finite dimensional reduction of the variational principle for finding closed characteristics in fixed energy levels. This reduction has some similarities with the method of broken geodesics for the geodesic variational problem on Riemannian manifolds. On the other hand, the monotonicity property can be related to the existence of local Twist maps in the associated Hamiltonian flow. The finite dimensional reduction gives rise to a second order monotone recurrence relation. We study these recurrence relations to find simple closed characteristics for the Lagrangian system. More complicated closed characteristics will be dealt with in future work. Furthermore, we give conditions on the Lagrangian that guarantee the Twist property.


Proceedings of the Royal Society of Edinburgh: Section A Mathematics | 2004

Closed characteristics of second-order Lagrangians

William D. Kalies; Robert C. Vandervorst

We study the existence of closed characteristics on three-dimensional energy manifolds of second-order Lagrangian systems. These manifolds are always noncompact, connected, and not necessarily of contact type. Using the specific geometry of these manifolds, we prove that the number of closed characteristics on a prescribed energy manifold is bounded below by its second Betti number, which is easily computable from the Lagrangian.


Comptes Rendus De L Academie Des Sciences Serie I-mathematique | 2000

Closed characteristics of fourth-order twist systems via braids

Robert Ghrist; Jan Bouwe van den Berg; Robert C. Vandervorst

Abstract For a large class of second order Lagrangian dynamics, one may reformulate the problem of finding periodic solutions as a problem in solving second-order recurrence relations satisfying a twist condition. We project periodic solutions of such discretized Lagrangian systems onto the space of closed braids and apply topological techniques. Under this reformulation, one obtains a gradient flow on the space of braided piecewise linear immersions of circles. We derive existence results for closed braided solutions using Morse–Conley theory on the space of singular braid diagrams.


Foundations of Computational Mathematics | 2016

Lattice Structures for Attractors II

William D. Kalies; Konstantin Mischaikow; Robert C. Vandervorst

The algebraic structure of the attractors in a dynamical system determines much of its global dynamics. The collection of all attractors has a natural lattice structure, and this structure can be detected through attracting neighborhoods, which can in principle be computed. Indeed, there has been much recent work on developing and implementing general computational algorithms for global dynamics, which are capable of computing attracting neighborhoods efficiently. Here we address the question of whether all of the algebraic structure of attractors can be captured by these methods.


Journal of Fixed Point Theory and Applications | 2017

Symplectomorphisms and discrete braid invariants

Aleksander Czechowski; Robert C. Vandervorst

Area and orientation preserving diffeomorphisms of the standard 2-disc, referred to as symplectomorphisms of


Siam Journal on Applied Dynamical Systems | 2011

The order of bifurcation points in fourth order conservative systems via braids

Jan Bouwe van den Berg; Miroslav Kramar; Robert C. Vandervorst


Physica D: Nonlinear Phenomena | 2016

The Poincaré–Bendixson Theorem and the non-linear Cauchy–Riemann equations

J. van den Berg; S. Munao; Robert C. Vandervorst

{\mathbb {D}^{2}}


Siam Journal on Applied Dynamical Systems | 2018

An Algorithmic Approach to Lattices and Order in Dynamics

William D. Kalies; Dinesh Kasti; Robert C. Vandervorst

Collaboration


Dive into the Robert C. Vandervorst's collaboration.

Top Co-Authors

Avatar

William D. Kalies

Florida Atlantic University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Robert Ghrist

University of Pennsylvania

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

W. Wójcik

VU University Amsterdam

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge