✦ LIBER ✦

Block Householder transformation for parallel QR factorization

✍ Scribed by F. Rotella; I. Zambettakis

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 257 KB
Volume: 12
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(99)00028-2

No coin nor oath required. For personal study only.

✦ Synopsis

A new form of the QR factorization procedure is presented which is based on a generalization of the Householder transformation. This extension is a block matrical form of the usual Householder procedure which leads to a dichotomic algorithm which allows parallel implementation.

📜 SIMILAR VOLUMES

Parallel QR factorization by householder

Parallel QR factorization by householder and modified Gram-Schmidt algorithms

✍ Dianne P. O'Leary; Peter Whitman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

Parallel tiled QR factorization for mult

Parallel tiled QR factorization for multicore architectures

✍ Alfredo Buttari; Julien Langou; Jakub Kurzak; Jack Dongarra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

Implementation of QR factorization on th

Implementation of QR factorization on the DAP using householder transformations

✍ G.S.J. Bowgen; J.J. Modi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 366 KB

The greatest emphasis has hitherto been on parallel application of Givens rotations. In this paper we show that on the Distributed Array Processor (DAP), Householder reflections turn out to be faster than Givens rotations, to perform QR factorization of an m X n matrix, especially for m >> n. Detail

The parallel QR factorization algorithm

The parallel QR factorization algorithm for tridiagonal linear systems

✍ Pierluigi Amodio; Luigi Brugnano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 738 KB

A coarse-grained parallel QR-factorizati

A coarse-grained parallel QR-factorization algorithm for sparse least squares problems

✍ Tz. Ostromsky; P.C. Hansen; Z. Zlatev 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A sparse QR-factorization algorithm SPARQR for coarse-grained parallel computations is described. The coefficient matrix, which is assumed to be general sparse, is reordered in an attempt to bring as many zero elements in the lower left corner as possible. The reordered matrix is then partitioned in

Symplectic Householder transformations f

Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches

✍ A. Salam; A. El Farouk; E. Al-Aidarous 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 273 KB

The aim of this paper is to show how geometric and algebraic approaches lead us to a new symplectic elementary transformations: the 2-D symplectic Householder transformations. Their features are studied in details. Their interesting properties allow us to construct a new algorithm for computing a SR