Algorithms for branch-following and critical point identification in the presence of symmetry
2010-04
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Algorithms for branch-following and critical point identification in the presence of symmetry
Authors
Published Date
2010-04
Publisher
Type
Thesis or Dissertation
Abstract
The objective of this work is to present techniques that can be used to study steady state solutions to systems generically described by the equation F(x; #21;) = dx dt = 0, where x 2 RN is the set of degrees of freedom (DOFs) of the system and #21; 2 R is a loading parameter. In particular, the implications of the presence of discrete and continuous symmetry to systems described by F(x; #21;) = 0 will be explored. Additionally, numerical techniques that can be used to “path-follow” the evolution of the DOFs as the loading parameter #21; is varied will be presented along with schemes to increase the computationally efficiency of the path following algorithms. These techniques can be used to obtain solutions to F(x; #21;) = 0 around regular and singular points. Additionally, methods to detect, and compute singular points of F will be presented. Finally, the benefits of these techniques will be illustrated through the computation of solutions to two typical problems.
Description
University of Minnesota M.S. thesis. April 2010. Major: Aerospace Engineering & Mechanics. Advisor: Ryan Scott Elliott. 1 computer file (PDF); vi, 86 pages, appendices A-C.
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Jusuf, Vincent. (2010). Algorithms for branch-following and critical point identification in the presence of symmetry. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/102668.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.