Show simple item record

dc.contributor.advisorArabyan, Araen_US
dc.contributor.authorWu, Fei
dc.creatorWu, Feien_US
dc.date.accessioned2013-04-18T09:52:12Z
dc.date.available2013-04-18T09:52:12Z
dc.date.issued1997en_US
dc.identifier.urihttp://hdl.handle.net/10150/282561
dc.description.abstractTwo methods suitable for parallel computation in the study of mechanical systems with holonomic and nonholonomic constraints are presented: one is an explicit solution based on generalized inverse algebra; the second solves problems of this class through the direct application of Gauss' principle of least constraint and genetic algorithms. Algorithms for both methods are presented for sequential and parallel implementations. The method using generalized inverses is able to solve problems that involve redundant, degenerate and intermittent constraints, and can identify inconsistent constraint sets. It also allows a single program to perform pure kinematic and dynamic analyses. Its computational cost is among the lowest in comparison with other methods. In addition, constraint violation control methods are investigated to improve integration accuracy and further reduce computational cost. Constrained dynamics problems are also solved using optimization methods by applying Gauss' principle directly. An objective function that incorporates constraints is derived using a symmetric scheme, which is implemented using genetic algorithms in a parallel computing environment. It is shown that this method is capable of solving the same cases of constraints as the former method. Examples and numerical experiments demonstrating the applications of the two methods to constrained multiparticle and multibody systems are presented.
dc.language.isoen_USen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectApplied Mechanics.en_US
dc.subjectEngineering, Mechanical.en_US
dc.subjectComputer Science.en_US
dc.titleParallel computational methods for constrained mechanical systemsen_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.identifier.proquest9817334en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineAerospace and Mechanical Engineeringen_US
thesis.degree.namePh.D.en_US
dc.description.noteThis item was digitized from a paper original and/or a microfilm copy. If you need higher-resolution images for any content in this item, please contact us at repository@u.library.arizona.edu.
dc.identifier.bibrecord.b38268425en_US
dc.description.admin-noteOriginal file replaced with corrected file October 2023.
refterms.dateFOA2018-07-02T17:01:59Z
html.description.abstractTwo methods suitable for parallel computation in the study of mechanical systems with holonomic and nonholonomic constraints are presented: one is an explicit solution based on generalized inverse algebra; the second solves problems of this class through the direct application of Gauss' principle of least constraint and genetic algorithms. Algorithms for both methods are presented for sequential and parallel implementations. The method using generalized inverses is able to solve problems that involve redundant, degenerate and intermittent constraints, and can identify inconsistent constraint sets. It also allows a single program to perform pure kinematic and dynamic analyses. Its computational cost is among the lowest in comparison with other methods. In addition, constraint violation control methods are investigated to improve integration accuracy and further reduce computational cost. Constrained dynamics problems are also solved using optimization methods by applying Gauss' principle directly. An objective function that incorporates constraints is derived using a symmetric scheme, which is implemented using genetic algorithms in a parallel computing environment. It is shown that this method is capable of solving the same cases of constraints as the former method. Examples and numerical experiments demonstrating the applications of the two methods to constrained multiparticle and multibody systems are presented.


Files in this item

Thumbnail
Name:
azu_td_9817334_sip1_c.pdf
Size:
5.940Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record