๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Shifting Strategies for the Parallel $QR$ Algorithm

โœ Scribed by Watkins, David S.

Book ID
118188725
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
917 KB
Volume
15
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A high performance parallelization schem
A high performance parallelization scheme for the Hessenberg double shift QR algorithm
โœ Reiji Suda; Akira Nishida; Yoshio Oyanagi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 924 KB

We propose a new parallelization scheme for the Hessenberg double shift QR algorithm. Our scheme allows software pipelining and communication latency hiding, and gives almost perfect load balance. An asymptotic parallelizing overhead analysis shows that our scheme attains the best possible scalabili

A parallel QR algorithm for the nonsymme
A parallel QR algorithm for the nonsymmetric eigenvalue problem
โœ 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