𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel transient algorithm for structures with extended independent substructure computation

✍ Scribed by Bennighof, Jeffrey K. ;Wu, Jiann-Yuarn

Publisher
Wiley (John Wiley & Sons)
Year
1991
Tongue
English
Weight
647 KB
Volume
7
Category
Article
ISSN
0748-8025

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A parallel algorithm for linear structure transient response problems is presented in which transient response is computed independently for substructures for extended periods of time, and these substructure responses are then corrected to obtain the response of the overall coupled structure. The correction of the uncoupled substructure responses only requires the interface portions of these responses sampled occasionally in time, and is done independently for different substructures in a streamlined procedure. A numerical example is presented to demonstrate the method and show its accuracy.

πŸ“œ SIMILAR VOLUMES

Towards Structured Parallel Computing on
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
✍ Feng Gao πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 403 KB

This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity witho

A summation algorithm with error correct
A summation algorithm with error correction for parallel computers
✍ Kazufumi Ozawa; Masatoshi Miyazaki πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 413 KB

## Abstract This paper proposes an algorithm to accurately compute the sum of floating‐point numbers on parallel computers. This algorithm is an extension of the well‐known recursive doubling technique which computes the sum of __n__ floating‐point number in log~2~__n__ parallel steps. The time com

Computational Experience with a Parallel
Computational Experience with a Parallel Algorithm for Tetrangle Inequality Bound Smoothing
✍ Kumar Rajan; Narsingh Deo πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 195 KB

Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances can usually be obtained only for a small subset of the n(n-1) 2 atom pairs, using NMR. Given the bounds so obtained on th