Faster Numerical Algorithms via Exception Handling (1994)
Download From
IEEE
Download Links
- [http.cs.berkeley.edu]
- [crd.lbl.gov]
- [softlib.rice.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Trans. Comput |
| Citations: | 43 - 7 self |
BibTeX
@ARTICLE{Demmel94fasternumerical,
author = {James W. Demmel and Xiaoye Li},
title = {Faster Numerical Algorithms via Exception Handling},
journal = {IEEE Trans. Comput},
year = {1994},
volume = {43},
pages = {983--992}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An attractive paradigm for building fast numerical algorithms is the following: (1) try a fast but occasionally unstable algorithm, (2) test the accuracy of the computed answer, and (3) recompute the answer slowly and accurately in the unlikely event it is necessary. This is especially attractive on parallel machines where the fastest algorithms may be less stable than the best serial algorithms. Since unstable algorithms can overflow or cause other exceptions, exception handling is needed to implement this paradigm safely. To implement it efficiently, exception handling cannot be too slow. We This is an expanded version of a paper published in Proceedings of the 11th Symposium on Computer Arithmetic, Windsor, Ontario, June 29-July 2 1993, pp. 234-241, copyright c fl1993, IEEE. y Computer Science Division and Mathematics Department, University of California, Berkeley CA 94720. Email: demmel@cs.berkeley.edu. The author was supported by NSF grant ASC-9005933, DARPA contract DAAL03-9...
