東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

A parallel logarithmic time complexi...

Critchley, James Hockridge.

Linked to FindBook

Google Book

Amazon

博客來

A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics./
Author:	Critchley, James Hockridge.
Description:	122 p.
Notes:	Adviser: Kurt S. Anderson.
Contained By:	Dissertation Abstracts International64-04B.
Subject:	Applied Mechanics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3088498

A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics.
Critchley, James Hockridge.

A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics. - 122 p.

Adviser: Kurt S. Anderson.

Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2003.

Multibody systems encompass a vast array of machines, vehicles, and mechanisms, including molecular, bio-mechanical, and micro/nano electro-mechanical systems. The ability to rapidly compute the dynamics of multibody systems is of paramount importance to technologies including real-time operator or hardware in the loop simulation, model based control, and comprehensive design optimization. This dissertation surveys the literature as it pertains to increased computational performance of multibody dynamics simulation and analysis, and presents and validates a novel method for achieving new levels of performance with parallel computers.Subjects--Topical Terms:

1018410
Applied Mechanics.

A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics.
LDR:02918nam 2200313 a 45 001 934712
005 20110509
008 110509s2003 eng d
035 $a (UnM)AAI3088498
035 $a AAI3088498
040 $a UnM $c UnM
100 1 $a Critchley, James Hockridge. $3 1258411
245 1 0 $a A parallel logarithmic time complexity algorithm for the simulation of general multibody system dynamics.
300 $a 122 p.
500 $a Adviser: Kurt S. Anderson.
500 $a Source: Dissertation Abstracts International, Volume: 64-04, Section: B, page: 1790.
502 $a Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2003.
520 $a Multibody systems encompass a vast array of machines, vehicles, and mechanisms, including molecular, bio-mechanical, and micro/nano electro-mechanical systems. The ability to rapidly compute the dynamics of multibody systems is of paramount importance to technologies including real-time operator or hardware in the loop simulation, model based control, and comprehensive design optimization. This dissertation surveys the literature as it pertains to increased computational performance of multibody dynamics simulation and analysis, and presents and validates a novel method for achieving new levels of performance with parallel computers.
520 $a Existing parallel multibody simulation methods are shown to exhibit one or more undesirable characteristics when applied to general systems. Commonly, non-optimal growth in complexity (high order) of a solution algorithm occurs. There is one existing optimal order method capable of treating general systems, but this method should only be used in conjunction with very large parallel computers, requiring currently unrealistic interprocessor communications costs to be effective.
520 $a To address a lack of performance with respect to general systems and modest computer resources, a new parallel algorithm of optimal order is introduced which draws exclusively from the latest developments in serial processor low order constrained system solutions. The existing constraint solution termed Recursive Coordinate Reduction (RCR) is shown to be applicable only to a narrow class of kinematic constraints and a completely generalized form is derived and verified.
520 $a The new parallel method of Recursive Coordinate Reduction Parallelism (RCRP) is systematically derived as a special case of the fastest serial processor algorithm and outperforms existing methods both theoretically and in practice. The method is validated in an object oriented multi-threaded implementation which utilizes shared memory in a parallel computer.
590 $a School code: 0185.
650 4 $a Applied Mechanics. $3 1018410
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Mechanical. $3 783786
690 $a 0346
690 $a 0548
690 $a 0984
710 2 0 $a Rensselaer Polytechnic Institute. $3 1019062
773 0 $t Dissertation Abstracts International $g 64-04B.
790 $a 0185
790 1 0 $a Anderson, Kurt S., $e advisor
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3088498