Advances in the Application of the Divide-and-Conquer Algorithm to Multibody System Dynamics

This paper summarizes the various recent advancements achieved by utilizing the divide-and-conquer algorithm (DCA) to reduce the computational burden associated with many aspects of modeling, designing, and simulating articulated multibody systems. This basic algorithm provides a framework to realiz...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational and nonlinear dynamics 2014-10, Vol.9 (4)
Hauptverfasser: Laflin, Jeremy J, Anderson, Kurt S, Khan, Imad M, Poursina, Mohammad
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 4
container_start_page
container_title Journal of computational and nonlinear dynamics
container_volume 9
creator Laflin, Jeremy J
Anderson, Kurt S
Khan, Imad M
Poursina, Mohammad
description This paper summarizes the various recent advancements achieved by utilizing the divide-and-conquer algorithm (DCA) to reduce the computational burden associated with many aspects of modeling, designing, and simulating articulated multibody systems. This basic algorithm provides a framework to realize O(n) computational complexity for serial task scheduling. Furthermore, the framework of this algorithm easily accommodates parallel task scheduling, which results in coarse-grain O(log n) computational complexity. This is a significant increase in efficiency over forming and solving the Newton–Euler equations directly. A survey of the notable previous work accomplished, though not all inclusive, is provided to give a more complete understanding of how this algorithm has been used in this context. These advances include applying the DCA to constrained systems, flexible bodies, sensitivity analysis, contact, and hybridization with other methods. This work reproduces the basic mathematical framework for applying the DCA in each of these applications. The reader is referred to the original work for the details of the discussed methods.
doi_str_mv 10.1115/1.4026072
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1825451816</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1825451816</sourcerecordid><originalsourceid>FETCH-LOGICAL-a282t-c2bfaac3b2d0e8108b6074886403dea691b20f86c99bf4abbfaf90d295a3abcd3</originalsourceid><addsrcrecordid>eNo9kLtPwzAYxC0EEqUwMLN4hCHgZ-qMUctLKmIANiTLr1BXiR3ipFL-ewKtmL7Tp59OdwfAJUa3GGN-h28ZIjlakCMww5zzDDNCj_815qfgLKUtQowVgs_AZ2l3KhiXoA-w3zhYtm3tjep9DDBWf6-V33nrMhVstozhe3AdLOuv2Pl-08A-wpeh7r2OdoRvY-pdA1djUI036RycVKpO7uJw5-Dj4f59-ZStXx-fl-U6U0SQPjNEV0oZqolFTmAk9FSACZEzRK1TeYE1QZXITVHoiik90VWBLCm4okobS-fgeu_bdnGKl3rZ-GRcXavg4pAkFoQzjgXOJ_Rmj5ouptS5Sradb1Q3Sozk74ISy8OCE3u1Z1VqnNzGoQtTC0kXiFBEfwAtSmyJ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1825451816</pqid></control><display><type>article</type><title>Advances in the Application of the Divide-and-Conquer Algorithm to Multibody System Dynamics</title><source>ASME Transactions Journals (Current)</source><source>Alma/SFX Local Collection</source><creator>Laflin, Jeremy J ; Anderson, Kurt S ; Khan, Imad M ; Poursina, Mohammad</creator><creatorcontrib>Laflin, Jeremy J ; Anderson, Kurt S ; Khan, Imad M ; Poursina, Mohammad</creatorcontrib><description>This paper summarizes the various recent advancements achieved by utilizing the divide-and-conquer algorithm (DCA) to reduce the computational burden associated with many aspects of modeling, designing, and simulating articulated multibody systems. This basic algorithm provides a framework to realize O(n) computational complexity for serial task scheduling. Furthermore, the framework of this algorithm easily accommodates parallel task scheduling, which results in coarse-grain O(log n) computational complexity. This is a significant increase in efficiency over forming and solving the Newton–Euler equations directly. A survey of the notable previous work accomplished, though not all inclusive, is provided to give a more complete understanding of how this algorithm has been used in this context. These advances include applying the DCA to constrained systems, flexible bodies, sensitivity analysis, contact, and hybridization with other methods. This work reproduces the basic mathematical framework for applying the DCA in each of these applications. The reader is referred to the original work for the details of the discussed methods.</description><identifier>ISSN: 1555-1415</identifier><identifier>EISSN: 1555-1423</identifier><identifier>DOI: 10.1115/1.4026072</identifier><language>eng</language><publisher>ASME</publisher><subject>Algorithms ; Complexity ; Computation ; Dynamical systems ; Mathematical models ; Multibody systems ; Nonlinear dynamics ; Task scheduling</subject><ispartof>Journal of computational and nonlinear dynamics, 2014-10, Vol.9 (4)</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a282t-c2bfaac3b2d0e8108b6074886403dea691b20f86c99bf4abbfaf90d295a3abcd3</citedby><cites>FETCH-LOGICAL-a282t-c2bfaac3b2d0e8108b6074886403dea691b20f86c99bf4abbfaf90d295a3abcd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904,38499</link.rule.ids></links><search><creatorcontrib>Laflin, Jeremy J</creatorcontrib><creatorcontrib>Anderson, Kurt S</creatorcontrib><creatorcontrib>Khan, Imad M</creatorcontrib><creatorcontrib>Poursina, Mohammad</creatorcontrib><title>Advances in the Application of the Divide-and-Conquer Algorithm to Multibody System Dynamics</title><title>Journal of computational and nonlinear dynamics</title><addtitle>J. Comput. Nonlinear Dynam</addtitle><description>This paper summarizes the various recent advancements achieved by utilizing the divide-and-conquer algorithm (DCA) to reduce the computational burden associated with many aspects of modeling, designing, and simulating articulated multibody systems. This basic algorithm provides a framework to realize O(n) computational complexity for serial task scheduling. Furthermore, the framework of this algorithm easily accommodates parallel task scheduling, which results in coarse-grain O(log n) computational complexity. This is a significant increase in efficiency over forming and solving the Newton–Euler equations directly. A survey of the notable previous work accomplished, though not all inclusive, is provided to give a more complete understanding of how this algorithm has been used in this context. These advances include applying the DCA to constrained systems, flexible bodies, sensitivity analysis, contact, and hybridization with other methods. This work reproduces the basic mathematical framework for applying the DCA in each of these applications. The reader is referred to the original work for the details of the discussed methods.</description><subject>Algorithms</subject><subject>Complexity</subject><subject>Computation</subject><subject>Dynamical systems</subject><subject>Mathematical models</subject><subject>Multibody systems</subject><subject>Nonlinear dynamics</subject><subject>Task scheduling</subject><issn>1555-1415</issn><issn>1555-1423</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo9kLtPwzAYxC0EEqUwMLN4hCHgZ-qMUctLKmIANiTLr1BXiR3ipFL-ewKtmL7Tp59OdwfAJUa3GGN-h28ZIjlakCMww5zzDDNCj_815qfgLKUtQowVgs_AZ2l3KhiXoA-w3zhYtm3tjep9DDBWf6-V33nrMhVstozhe3AdLOuv2Pl-08A-wpeh7r2OdoRvY-pdA1djUI036RycVKpO7uJw5-Dj4f59-ZStXx-fl-U6U0SQPjNEV0oZqolFTmAk9FSACZEzRK1TeYE1QZXITVHoiik90VWBLCm4okobS-fgeu_bdnGKl3rZ-GRcXavg4pAkFoQzjgXOJ_Rmj5ouptS5Sradb1Q3Sozk74ISy8OCE3u1Z1VqnNzGoQtTC0kXiFBEfwAtSmyJ</recordid><startdate>20141001</startdate><enddate>20141001</enddate><creator>Laflin, Jeremy J</creator><creator>Anderson, Kurt S</creator><creator>Khan, Imad M</creator><creator>Poursina, Mohammad</creator><general>ASME</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20141001</creationdate><title>Advances in the Application of the Divide-and-Conquer Algorithm to Multibody System Dynamics</title><author>Laflin, Jeremy J ; Anderson, Kurt S ; Khan, Imad M ; Poursina, Mohammad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a282t-c2bfaac3b2d0e8108b6074886403dea691b20f86c99bf4abbfaf90d295a3abcd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Complexity</topic><topic>Computation</topic><topic>Dynamical systems</topic><topic>Mathematical models</topic><topic>Multibody systems</topic><topic>Nonlinear dynamics</topic><topic>Task scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Laflin, Jeremy J</creatorcontrib><creatorcontrib>Anderson, Kurt S</creatorcontrib><creatorcontrib>Khan, Imad M</creatorcontrib><creatorcontrib>Poursina, Mohammad</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of computational and nonlinear dynamics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Laflin, Jeremy J</au><au>Anderson, Kurt S</au><au>Khan, Imad M</au><au>Poursina, Mohammad</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Advances in the Application of the Divide-and-Conquer Algorithm to Multibody System Dynamics</atitle><jtitle>Journal of computational and nonlinear dynamics</jtitle><stitle>J. Comput. Nonlinear Dynam</stitle><date>2014-10-01</date><risdate>2014</risdate><volume>9</volume><issue>4</issue><issn>1555-1415</issn><eissn>1555-1423</eissn><abstract>This paper summarizes the various recent advancements achieved by utilizing the divide-and-conquer algorithm (DCA) to reduce the computational burden associated with many aspects of modeling, designing, and simulating articulated multibody systems. This basic algorithm provides a framework to realize O(n) computational complexity for serial task scheduling. Furthermore, the framework of this algorithm easily accommodates parallel task scheduling, which results in coarse-grain O(log n) computational complexity. This is a significant increase in efficiency over forming and solving the Newton–Euler equations directly. A survey of the notable previous work accomplished, though not all inclusive, is provided to give a more complete understanding of how this algorithm has been used in this context. These advances include applying the DCA to constrained systems, flexible bodies, sensitivity analysis, contact, and hybridization with other methods. This work reproduces the basic mathematical framework for applying the DCA in each of these applications. The reader is referred to the original work for the details of the discussed methods.</abstract><pub>ASME</pub><doi>10.1115/1.4026072</doi></addata></record>
fulltext fulltext
identifier ISSN: 1555-1415
ispartof Journal of computational and nonlinear dynamics, 2014-10, Vol.9 (4)
issn 1555-1415
1555-1423
language eng
recordid cdi_proquest_miscellaneous_1825451816
source ASME Transactions Journals (Current); Alma/SFX Local Collection
subjects Algorithms
Complexity
Computation
Dynamical systems
Mathematical models
Multibody systems
Nonlinear dynamics
Task scheduling
title Advances in the Application of the Divide-and-Conquer Algorithm to Multibody System Dynamics
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T16%3A13%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Advances%20in%20the%20Application%20of%20the%20Divide-and-Conquer%20Algorithm%20to%20Multibody%20System%20Dynamics&rft.jtitle=Journal%20of%20computational%20and%20nonlinear%20dynamics&rft.au=Laflin,%20Jeremy%20J&rft.date=2014-10-01&rft.volume=9&rft.issue=4&rft.issn=1555-1415&rft.eissn=1555-1423&rft_id=info:doi/10.1115/1.4026072&rft_dat=%3Cproquest_cross%3E1825451816%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1825451816&rft_id=info:pmid/&rfr_iscdi=true