JavaScript is disabled for your browser. Some features of this site may not work without it.
A Jacobi-like Algorithm for Computing the QR-Decomposition

Author
Luk, Franklin T.
Abstract
A parallel Jacobi-like method for computing the QR-decomposition of an $n \times n$ matrix is proposed. It requires $O(n^{2})$ processors and $O(n)$ units of time. The method can be extended to handle an $m \times n$ matrix $(m \geq n)$. The requirements become $O(n^{2})$ processors and $O(m)$ time.
Date Issued
1984-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-612
Type
technical report