𝔖 Bobbio Scriptorium
✦   LIBER   ✦

AN ALGORITHM FOR INTEGRATING THE SPIN ON CONVECTED BASES

✍ Scribed by G. NEFUSSI; N. DAHAN


Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
548 KB
Volume
39
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


A new algorithm is proposed for integrating the spin in the frame of large deformation analysis. The method is based on the integration of a matrix relation, obtained from an adapted decomposition of the deformation gradient, and directly written in convected co-ordinates. The input of this algorithm is either the Gram matrix at any time (if a kinematical method is used, for instance) or more generally, the incremental deformation gradient, and the output is the required rotation matrix on convected bases. The result takes a very simple form in the important case of classical shells.

KEY WORDS: co-rotational frame; convected bases; integration of the spin rotated frame: one is related to the spatial spin n, and may be denoted by Q, and the second R is simply generated from the classical polar decomposition of the total deformation gradient (see Dafalias' and Ladeveze,' for example).

To obtain these rotations, some computational effort is needed, and the Hughes and Winget4 algorithm may be used. Other related algorithms, like that of Flanagan and Taylor6 and more recently R a ~h i d , ~ are also available. The first two papers suppose a linear interpolation of the displacements over each time step, whereas in the last one, the deformation is assumed to vary over the time step in such a way that the stretching occurs along fixed principal directions and without rotation during each time increment. All the rotation is considered to occur at the end of the increment with no additional stretch. It is clear that all of these algorithms are objective. Nevertheless, they do suppose the introduction of orthonormal frames and are performed in Cartesian co-ordinate systems, which are natural for three-dimensional structures but not for shells, for instance. Therefore, for these authors, the required rotation is an orthogonal 3 x 3 matrix Q that satisfies the classical differential equation = SZ. Q. Furthermore, we can


πŸ“œ SIMILAR VOLUMES


An algorithm for the generation of nucle
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 438 KB

## Abstract This article develops a set of algorithms for the computer generation of nuclear spin species and nuclear spin statistical weights potentially useful in molecular spectroscopy. These algorithms generate the nuclear spin species from group structures known as generalized character cycle

An efficient algorithm for multistate pr
✍ Benjamin D. Allen; Stephen L. Mayo πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 326 KB

## Abstract Most of the methods that have been developed for computational protein design involve the selection of side‐chain conformations in the context of a single, fixed main‐chain structure. In contrast, multistate design (MSD) methods allow sequence selection to be driven by the energetic con

An efficient adaptive algorithm for edge
✍ A. De Santis; D. Iacoviello πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 653 KB

## Abstract The edge detection problem in blurred and noisy 2‐D signals is dealt with. An adaptive signal processing algorithm is proposed which marks edge points according to an hypothesis test which compares the likelihoods of two models describing the local signal behaviour in the two cases of a