On the Perturbation of LU and Cholesky Factors*

dc.contributor.authorStewart, G. W.en_US
dc.date.accessioned2004-05-31T22:34:52Z
dc.date.available2004-05-31T22:34:52Z
dc.date.created1995-10en_US
dc.date.issued1998-10-15en_US
dc.description.abstractIn a recent paper, Chang and Paige have shown that the usual perturbation bounds for Cholesky factors can systematically overestimate the errors. In this note we sharpen their results and extend them to the factors of the LU decomposition. The results are based on a new formula for the first order terms of the error in the factors. (Also cross-referenced as UMIACS-TR-95-93)en_US
dc.format.extent103732 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/761
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3535en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-93en_US
dc.titleOn the Perturbation of LU and Cholesky Factors*en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-3535.ps
Size:
101.3 KB
Format:
Postscript Files
Loading...
Thumbnail Image
Name:
CS-TR-3535.pdf
Size:
116.51 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-3535.ps