The Analysis of Rigid Body Motion From Measured Data

1995 ◽  
Vol 117 (4) ◽  
pp. 578-584 ◽  
Author(s):  
G. R. Shiflett ◽  
A. J. Laub

In this paper, a new method for analyzing rigid body motion from measured data is presented. The approach is numerically stable, explicitly accounts for the errors inherent in measured data and those introduced by floating point arithmetic, automatically accommodates any number of rigid body particles, and is computationally efficient. The sole restriction on the data is that it represent 3 noncollinear particles of a rigid body.

1998 ◽  
Vol 123 (1) ◽  
pp. 157-160
Author(s):  
Hyoung Jun Kim ◽  
Raj S. Sodhi

The rigid body motion is studied for a combination of finitely and infinitesimally separated positions in planar kinematics. A general new method is developed for determining the locations of points in a rigid body moving through finitely and infinitesimally separated positions. These points would satisfy the constraints of the crank links for planar mechanisms. A new form of the circle-point curve equations is derived for the double-point position problem and also for the finitely separated position problem in planar kinematics.


2010 ◽  
Vol 67 (6) ◽  
pp. 713-732 ◽  
Author(s):  
Jessica Sanders ◽  
John E. Dolbow ◽  
Peter J. Mucha ◽  
Tod A. Laursen

Author(s):  
Jack Dongarra ◽  
Laura Grigori ◽  
Nicholas J. Higham

A number of features of today’s high-performance computers make it challenging to exploit these machines fully for computational science. These include increasing core counts but stagnant clock frequencies; the high cost of data movement; use of accelerators (GPUs, FPGAs, coprocessors), making architectures increasingly heterogeneous; and multi- ple precisions of floating-point arithmetic, including half-precision. Moreover, as well as maximizing speed and accuracy, minimizing energy consumption is an important criterion. New generations of algorithms are needed to tackle these challenges. We discuss some approaches that we can take to develop numerical algorithms for high-performance computational science, with a view to exploiting the next generation of supercomputers. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.


2020 ◽  
Vol 39 (6) ◽  
pp. 1-16
Author(s):  
Gianmarco Cherchi ◽  
Marco Livesu ◽  
Riccardo Scateni ◽  
Marco Attene

1964 ◽  
Vol 7 (1) ◽  
pp. 10-13 ◽  
Author(s):  
Robert T. Gregory ◽  
James L. Raney

Sign in / Sign up

Export Citation Format

Share Document