Stochastic Perturbation Theory
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:20:40Z | |
| dc.date.available | 2004-05-31T22:20:40Z | |
| dc.date.created | 1988-10 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Appeared in SIAM Review 32 (1990) 576--610. In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a first order perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variation in the perturbed quantity. Up to the higher order terms that are ignored in the expansion, these statistics tend to be more realistic than perturbation bounds obtained in terms of norms. The technique is applied to a number of problems in matrix perturbation theory, including least squares and the eigenvalue problem. Additional files are available via anonymous ftp at: thales.cs.umd.edu in the directory /ftp/pub/reports (Also cross-referenced as UMIACS-TR-88-76) | en_US |
| dc.format.extent | 296182 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/540 | |
| 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-2129 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-88-76 | en_US |
| dc.title | Stochastic Perturbation Theory | en_US |
| dc.type | Technical Report | en_US |