On the Stability of Sequential Updates and Downdates
| dc.contributor.author | Stewart, G. W. | en_US |
| dc.date.accessioned | 2004-05-31T22:25:31Z | |
| dc.date.available | 2004-05-31T22:25:31Z | |
| dc.date.created | 1994-03 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | The updating and downdating of QR decompositions has important applications in a number of areas. There is essentially one standard updating algorithm, based on plane rotations, which is backwards stable. Three downdating algorithms have been treated in the literature: the LINPACK algorithm, the method of hyperbolic transformations, and Chambers' algorithm. Although none of these algorithms is backwards stable, the first and third satisfy a relational stability condition. In this paper, it is shown that relational stability extends to a sequence of updates and downdates. In consequence, other things being equal, if the final decomposition in the sequence is well conditioned, it will be accurately computed, even though intermediate decompositions may be almost completely inaccurate. These results are also applied to the two-sided orthogonal decompositions, such as the URV decomposition. (Also cross-referenced as UMIACS-TR-94-30) | en_US |
| dc.format.extent | 180256 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/623 | |
| 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-3238 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-94-30 | en_US |
| dc.title | On the Stability of Sequential Updates and Downdates | en_US |
| dc.type | Technical Report | en_US |