A new and efficient form of Featherstone’s multibody Divide and Conquer Algorithm (DCA) is presented. The DCA was the first algorithm to achieve theoretically optimal logarithmic time complexity with a theoretical minimum of parallel computer resources for general problems of multibody dynamics, however the DCA is extremely inefficient in the presence of small to modest parallel computers. This alternative efficient DCA approach (DCAe) demonstrates that large DCA subsystems can be constructed using fast sequential techniques to realize a substantial increase in speed. The usefullness of the DCAe is directly demonstrated in an application to a four processor workstation and compared with results from the original DCA and a fast sequential recursive method. Previously the DCA was a tool intended for a future generation of parallel computers, this enhanced version delivers practical and competitive performance with the parallel computers of today.

This content is only available via PDF.
You do not currently have access to this content.