Updating URV Decompositions in Parallel
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:22:22Z | |
| dc.date.available | 2004-05-31T22:22:22Z | |
| dc.date.created | 1992-04 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | A URV decomposition of a matrix is a factorization of the matrix into the product of a unitary matrix (U), an upper triangular matrix (R), and another unitary matrix (V). In an earlier paper [UMIACS-TR-90-86] it was shown how to update a URV decomposition in such a way that it reveals the effective rank of the matrix. It was also argued that the updating procedure could be implemented in parallel on a linear array of processors; however, no specific algorithms were given. This paper gives a detailed implementation of the updating procedure. (Also cross-referenced as UMIACS-TR-92-44) | en_US |
| dc.format.extent | 175709 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/570 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-2880 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-90-86 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-92-44 | en_US |
| dc.title | Updating URV Decompositions in Parallel | en_US |
| dc.type | Technical Report | en_US |