Systolic givens factorization of dense rectangular matrices

Given an m by n dense matrix A(m≧n) we consider parallel algorithms to compute its orthogonal factorization via Givens rotations. First we describe an algorithm which is executed in m+n- 2 steps on a linear array of [m/2] processors, a step being the time necessary to achieve a Givens rotation. The...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 25; no. 3-4; pp. 287 - 298
Main Authors:	Cosnard, Michel, Robert, Yves
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.1988 Taylor and Francis Taylor & Francis
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences B.7.1 [Integrated circuits] Computer Science Computer science; control theory; systems Distributed, Parallel, and Cluster Computing Exact sciences and technology F.2.1 [Analysis of algorithms and problem complexity] F.l.l [Computation by abstract devices] Givens rotations linear least squares problems Models fo Computation-Systolic array Numerical algorithms and problems-QR decomposition of a dense matrix QR factorization Systolic algorithms Theoretical computing Types and design styles-Algorithms implemented in hardware VLSI VLSI architectures Numerical analysis VLSI circuit Least squares method Parallel processing Systolic network Algorithm Factorization Implementation
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!