Dedicated to the late M. R. B. Clarke SUMMARY Efficient algorithms for estimating the coefficient parameters of the ordinary linear model on a massively parallel SIMD computer are presented. The numerical stability of the algorithms is ensured by using orthogonal transformations in the form of House
Contact-impact simulations on massively parallel SIMD supercomputers
โ Scribed by E.J. Plaskacz; T. Belytschko; H.-Y. Chiang
- Publisher
- Elsevier Science
- Year
- 1992
- Weight
- 705 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0956-0521
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays I n this work we introduce and analyse algorithms for fractal image compression on massively parallel SIMD arrays. The dierent algorithms discussed dier signiยฎcantly in terms of their communication and computation structure.
Visual attention is the ability to rapidly detect the visually salient parts of a given scene on which higher level vision tasks, such as object recognition, can focus. Found in biological vision, this mechanism represents a fundamental tool for computer vision. This paper reports the first real-tim
A simulator based on a synchronous parallel simulation scheme is developed on an SIMD computer, a connection machine (CM-2) with \(8 \mathrm{~K}\) processors. Multistage interconnection networks of different sizes ( 2 to 16 stages) are simulated. Two categories of experiments are performed: symmetri