Complexity and Fragility: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
Line 5: | Line 5: | ||
* [http://www.cds.caltech.edu/~doyle/213/Feb16weekSlidesReading/IntroCxtyFrgty.pptx Introduction to Complexity and Fragility: NPP and Mandelbrot set examples ] | * [http://www.cds.caltech.edu/~doyle/213/Feb16weekSlidesReading/IntroCxtyFrgty.pptx Introduction to Complexity and Fragility: NPP and Mandelbrot set examples ] | ||
==Reading== | ==Reading== | ||
*[http://www.cds.caltech.edu/~doyle/213/Feb16weekSlidesReading/logFinalCDC2006_X.pdf Complexity in Automation of SOS Proofs: An Illustrative Example, Gayme et al.] | |||
*[http://www.cds.caltech.edu/~doyle/213/Feb16weekSlidesReading/mandel2.pdf <i>Optimization Based Methods for Determining Basins of Attraction in the Logistic Map and Set Membership in the Mandelbrot Set</i>, Gayme et al. ] | |||
*[http://www.cds.caltech.edu/~doyle/213/Feb16weekSlidesReading/DenniceConnections2006.pdf Studying the Logistic Map and the Mandelbrot Set Using SOS Methods, Gayme, Fazel, Doyle] |
Revision as of 23:15, 17 February 2010
Topics
Slides
Reading
- Complexity in Automation of SOS Proofs: An Illustrative Example, Gayme et al.
- Optimization Based Methods for Determining Basins of Attraction in the Logistic Map and Set Membership in the Mandelbrot Set, Gayme et al.
- Studying the Logistic Map and the Mandelbrot Set Using SOS Methods, Gayme, Fazel, Doyle