Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6452
Title: A Jacobi-like Algorithm for Computing the QR-Decomposition
Authors: Luk, Franklin T.
Keywords: computer science
technical report
Issue Date: May-1984
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-612
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.
URI: http://hdl.handle.net/1813/6452
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
84-612.pdf635.62 kBAdobe PDFView/Open
84-612.ps225.71 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us