Computational Graphs and Rounding Error

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1974 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Numerical Analysis, volume 11, pages 87-96 (issn: 0036-1429, eissn: 1095-7170,

Copyright policy )

Authors: Bauer, F. L.;

doi: 10.1137/0711010

Computational Graphs and Rounding Error

- Summary
- Subjects
- Metrics

Abstract

Using graphs for representing computational processes, relative error propagation is described. It is shown how this relates to the condition of a problem and to the property of a process to be benign, i.e., to have only harmless effects of rounding errors. In particular, composition of processes is studied under these aspects. Several examples illustrate the theory.

Keywords

Roundoff error

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	66
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%