Paper
Remarks on the complexity of roundoff analysis
Abstract
The day is coming when information about the propagation of roundoff error in certain types of numerical methods can be determined automatically. This paper investigates the possibility of mechanizing simple Wilkinson-type roundoff analyses. Limitations to the scope of this automation are discussed. © 1974 Springer-Verlag.
Related
Conference paper
Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
Conference paper