The graph-theoretical models of this paper can be used to compare the rounding error behavior of numerical programs The models follow the approach, popularized by Wilkinson, of assuming independent rounding errors at each arithmetic operation Models constructed on th~s assumpuon are more tractable than would be the case under more realistic assumptions There are identified two easily tested condmons on programs which guarantee that" error analyses are relatively lnsensmve to the particular graph model employed The development has the addmonal benefit of sometimes providing an elementary proof that one program is comparable in stablhty to another Examples of such results are gwen KEY WORDS AND PHRASES rounding errors, numerical stability, arithmetic graphs CR CATEGORIES 5 11, 5 14
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.