Finding Optimal Orbits of Chaotic Systems

dc.contributor.advisorHunt, Brian Ren_US
dc.contributor.authorGrant, Angela Elyseen_US
dc.contributor.departmentMathematicsen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.date.accessioned2006-02-04T07:42:22Z
dc.date.available2006-02-04T07:42:22Z
dc.date.issued2005-12-05en_US
dc.description.abstractChaotic dynamical systems can exhibit a wide variety of motions, including periodic orbits of arbitrarily large period. We consider the question of which motion is optimal, in the sense that it maximizes the average over time of some given scalar ``performance function." Past work indicates that optimal motions tend to be periodic orbits with low period, but does not describe, beyond a brute force approach, how to determine which orbit is optimal in a particular scenario. For one-dimensional expanding maps and higher dimensional hyperbolic systems, we have found constructive methods for calculating the optimal average and corresponding periodic orbit, and by carrying them out on a computer have found them to work quite well in practice.en_US
dc.format.extent5033038 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/3220
dc.language.isoen_US
dc.subject.pqcontrolledMathematicsen_US
dc.subject.pquncontrolledChaosen_US
dc.subject.pquncontrolledDynamical Systemsen_US
dc.subject.pquncontrolledChaotic Dynamicsen_US
dc.titleFinding Optimal Orbits of Chaotic Systemsen_US
dc.typeDissertationen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
umi-umd-3046.pdf
Size:
4.8 MB
Format:
Adobe Portable Document Format