ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Finding saddle points using stability boundaries
Full text PdfPdf (121 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2005 ACM symposium on Applied computing table of contents
Santa Fe, New Mexico
SESSION: Bioinformatics (BIO): poster papers table of contents
Pages: 212 - 213  
Year of Publication: 2005
ISBN:1-58113-964-0
Authors
Chandan K. Reddy  Cornell University, Ithaca, NY
Hsiao-Dong Chiang  Cornell University, Ithaca, NY
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 51,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066677.1066729
What is a DOI?

ABSTRACT

The task of finding saddle points on potential energy surfaces plays a crucial role in understanding the dynamics of a micro-molecule as well as in studying the folding pathways of macro-molecules like proteins. This paper primarily focusses on computing saddle points on potential energy surfaces. A stability boundary based approach that explores the dynamic and geometric characteristics of stability boundaries of a nonlinear dynamical system has been used to compute saddle points. A novel ray-adjustment procedure is used to trace the stability boundary. A simpler version of the algorithm has also been used to find the saddle points of symmetric systems. Our approach was also successful in finding saddle points on higher dimensional energy surfaces.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. D. Chiang and C. C. Chu. A systematic search method for obtaining multiple local optimal solutions of nonlinear programming problems. IEEE Transactions on Circuits and Systems: I Fundamental Theory and Applications, 43(2):99--109, 1996.
 
2
G. Henkelman, G. Johannesson, and H. Jonsson. Methods for finding saddle points and minimum energy paths. Progress on Theoretical Chemistry and Physics, 111:269--300, 2000.
 
3
J. Lee and H. D. Chiang. A dynamical trajectory-based methodology for systematically computing multiple optimal solutions of general nonlinear programming problems. IEEE Transactions on Automatic Control, 49(6):888--899, 2004.
 
4
K. Muller and L. D. Brown. Location of saddle points and minimum energy paths by a constrained simplex optimization procedure. Theoret. Chim. Acta, 53:75--93, 1979.

Collaborative Colleagues:
Chandan K. Reddy: colleagues
Hsiao-Dong Chiang: colleagues