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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 25; číslo 3-4; s. 287 - 298
Hlavní autoři: Cosnard, Michel, Robert, Yves
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1988
Taylor and Francis
Taylor & Francis
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 pipelined version of the new algorithm leads to a systolic implementation whose area-time performances overcome those of the arrays of Bojanczyk, Brent and Kung [1] and Gentleman and Kung [5].
ISSN:0020-7160
1029-0265
DOI:10.1080/00207168808803674