On the Eigensystems of Graded Matrices
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T23:01:35Z | |
| dc.date.available | 2004-05-31T23:01:35Z | |
| dc.date.created | 2000-01 | en_US |
| dc.date.issued | 2000-01-15 | en_US |
| dc.description.abstract | Informally a graded matrix is one whose elements show a systematic decrease or increase as one passes across the matrix. It is well known that graded matrices often have small eigenvalues that are determined to high relative accuracy. Similarly, the eigenvectors can have small components that are nonetheless well determined. In this paper, we give approximations to the eigenvalues and eigenvectors of a graded matrix in terms of a base matrix that show how these phenomena come about. This approach provides condition numbers for eigenvalues and individual components of the eigenvectors. The results are applied to derive related results for the singular value decomposition. (Also cross-referenced as UMAICS-TR-2000-01) | en_US |
| dc.format.extent | 2040324 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1051 | |
| 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-4099 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2000-01 | en_US |
| dc.title | On the Eigensystems of Graded Matrices | en_US |
| dc.type | Technical Report | en_US |