YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Computational and Nonlinear Dynamics
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Computational and Nonlinear Dynamics
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    A Logarithmic Complexity Divide-and-Conquer Algorithm for Multi-flexible Articulated Body Dynamics

    Source: Journal of Computational and Nonlinear Dynamics:;2007:;volume( 002 ):;issue: 001::page 10
    Author:
    Rudranarayan M. Mukherjee
    ,
    Kurt S. Anderson
    DOI: 10.1115/1.2389038
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: This paper presents an efficient algorithm for the dynamics simulation and analysis of multi-flexible-body systems. This algorithm formulates and solves the nonlinear equations of motion for mechanical systems with interconnected flexible bodies subject to the limitations of modal superposition, and body substructuring, with arbitrarily large rotations and translations. The large rotations or translations are modelled as rigid body degrees of freedom associated with the interconnecting kinematic joint degrees of freedom. The elastic deformation of the component bodies is modelled through the use of modal coordinates and associated admissible shape functions. Apart from the approximation associated with the elastic deformations, this algorithm is exact, non-iterative, and applicable to generalized multi-flexible chain and tree topologies. In its basic form, the algorithm is both time and processor optimal in its treatment of the nb joint variables, providing O(log(nb)) turnaround time per temporal integration step, achieved with O(nb) processors. The actual cost associated with the parallel treatment of the nf flexible degrees of freedom depends on the specific parallel method chosen for dealing with the individual coefficient matrices which are associated locally with each flexible body.
    keyword(s): Dynamics (Mechanics) , Algorithms , Equations , Motion , Equations of motion , Force , Tree (Data structure) AND Degrees of freedom ,
    • Download: (529.9Kb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      A Logarithmic Complexity Divide-and-Conquer Algorithm for Multi-flexible Articulated Body Dynamics

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/135344
    Collections
    • Journal of Computational and Nonlinear Dynamics

    Show full item record

    contributor authorRudranarayan M. Mukherjee
    contributor authorKurt S. Anderson
    date accessioned2017-05-09T00:22:58Z
    date available2017-05-09T00:22:58Z
    date copyrightJanuary, 2007
    date issued2007
    identifier issn1555-1415
    identifier otherJCNDDM-25600#10_1.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/135344
    description abstractThis paper presents an efficient algorithm for the dynamics simulation and analysis of multi-flexible-body systems. This algorithm formulates and solves the nonlinear equations of motion for mechanical systems with interconnected flexible bodies subject to the limitations of modal superposition, and body substructuring, with arbitrarily large rotations and translations. The large rotations or translations are modelled as rigid body degrees of freedom associated with the interconnecting kinematic joint degrees of freedom. The elastic deformation of the component bodies is modelled through the use of modal coordinates and associated admissible shape functions. Apart from the approximation associated with the elastic deformations, this algorithm is exact, non-iterative, and applicable to generalized multi-flexible chain and tree topologies. In its basic form, the algorithm is both time and processor optimal in its treatment of the nb joint variables, providing O(log(nb)) turnaround time per temporal integration step, achieved with O(nb) processors. The actual cost associated with the parallel treatment of the nf flexible degrees of freedom depends on the specific parallel method chosen for dealing with the individual coefficient matrices which are associated locally with each flexible body.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleA Logarithmic Complexity Divide-and-Conquer Algorithm for Multi-flexible Articulated Body Dynamics
    typeJournal Paper
    journal volume2
    journal issue1
    journal titleJournal of Computational and Nonlinear Dynamics
    identifier doi10.1115/1.2389038
    journal fristpage10
    journal lastpage21
    identifier eissn1555-1423
    keywordsDynamics (Mechanics)
    keywordsAlgorithms
    keywordsEquations
    keywordsMotion
    keywordsEquations of motion
    keywordsForce
    keywordsTree (Data structure) AND Degrees of freedom
    treeJournal of Computational and Nonlinear Dynamics:;2007:;volume( 002 ):;issue: 001
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian