Show simple item record

dc.contributor.authorLuk, Franklin T.en_US
dc.date.accessioned2007-04-23T16:52:28Z
dc.date.available2007-04-23T16:52:28Z
dc.date.issued1984-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-625en_US
dc.identifier.urihttps://hdl.handle.net/1813/6464
dc.description.abstractA triangular processor array for computing a singular value decomposition (SVD) of an $m \times n (m \geq n)$ matrix is proposed. A Jacobi-type algorithm is used to first triangularize the given matrix and then diagonalize the resultant triangular form. The requirements are $O(m)$ time and $1/4 n^{2} + O(n)$ processors.en_US
dc.format.extent710099 bytes
dc.format.extent222692 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Triangular Processor Array for Computing the Singular Value Decompositionen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics