Abstract
The probabilistic models for roundoff error in floating point and logarithmic arithmetic discussed in Barlow and Bareiss (1985) are applied to the error analysis of Gaussian elimination and some related algorithms. This new method of error analysis is compared to the standard deterministic error analysis given in Wilkinson (1963, 1965).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 349-364 |
| Number of pages | 16 |
| Journal | Computing |
| Volume | 34 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1985 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Numerical Analysis
- Computer Science Applications
- Computational Theory and Mathematics
- Computational Mathematics