𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures

✍ Scribed by Henry, Greg; Watkins, David; Dongarra, Jack


Book ID
118188220
Publisher
Society for Industrial and Applied Mathematics
Year
2002
Tongue
English
Weight
241 KB
Volume
24
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A parallel QR algorithm for the nonsymme
✍ Daniel Boley; Robert Maier; Joung Kim πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 973 KB

This paper describes a prototype parallel algorithm for approximating eigenvalues of a dense nonsymmetric matrix on a linear, synchronous processor array. The algorithm is a parallel implementation of the explicitly-shifted QR, employing n distributed-memory processors to deliver all eigenvalues in

Parallel implementation of a ray tracing
✍ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 145 KB πŸ‘ 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr

Parallel Genehunter: implementation of a
✍ Gavin C. Conant; Steven J. Plimpton; William Old; Andreas Wagner; Pamela R. Fain πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 186 KB

We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computation and memory requirements of the analysis. We discuss an implementation of the algorithm in the Genehunter linkage ana

Performance Analysis of the Parallel Kar
✍ GIOVANNI CESARI; ROMAN MAEDER πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 447 KB

We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n log 2 3 processors, but pre