Show simple item record

dc.contributor.authorHigham, Nicholas J.en_US
dc.date.accessioned2007-04-23T17:37:36Z
dc.date.available2007-04-23T17:37:36Z
dc.date.issued1989-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1024en_US
dc.identifier.urihttps://hdl.handle.net/1813/6824
dc.description.abstractJ.H. Wilkinson put Gaussian elimination (GE) on a sound numerical footing in the 1960's when he showed that with partial pivoting the method is stable in the sense of yielding a small backward error. He also derived bounds proportional to the condition number $\kappa(A)$ for the forward error $\| x - \hat{x} \|$, where $\hat{x}$ is the computed solution to $Ax = b$. More recent work has furthered our understanding of GE, largely through the use of componentwise rather than normwise analysis. We survey what is known about the accuracy of GE in both the forward and backward error senses. Particular topics include: classes of matrix for which it is advantageous not to pivot; how to estimate or compute the backward error; iterative refinement in single precision; and how to compute efficiently a bound on the forward error. Key Words: Gaussian elimination, partial pivoting, rounding error analysis, backward error, forward error, condition number, iterative refinement in single precision, growth factor, componentwise bounds, condition estimator.en_US
dc.format.extent1948913 bytes
dc.format.extent383710 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleHow Accurate is Gaussian Elimination?en_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics