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

A family of parallel QR factorization algorithms

โœ Scribed by Meyer, Gerard G.L.; Pascale, Mike

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
624 KB
Volume
8
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

โœฆ Synopsis

Rapid computation of the QR factorization of a matrix is fundamental to many scientific and engineering problems. The paper presents a family of algorithms parameterized by the number of processors available P, arithmetic grain aggregation parameters gl ,@, . . . ,gp, and communication grain aggregation parameter h, which compute the QR factorization of a matrix A E Cmx" with minimal latency. The approach is particularly well suited for dedicated distributed memory architectures such as linear arrays of INMOS Tkansputers, Texas Instruments C40s or Analog Devices 21060s.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel QR Algorithm for the Symmetri
A Parallel QR Algorithm for the Symmetrical Tridiagonal Eigenvalue Problem
โœ L. Kaufman ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 478 KB

The implicit QR algorithm is a serial iterative algorithm for determining all the eigenvalues of an \(n \times n\) symmetric tridiagonal matrix \(A\). About \(3 n\) iterations, each requiring the serial application of about \(n\) similarity planar transformations, are required to reduce \(A\) to dia

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
โœ Zhi-Long Chen; Warren B. Powell ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o