Distributive rounding in commercial applications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributive rounding in commercial applications

Full text

Pdf (347 KB)

Source

International Conference on APL archive
Proceedings of the eighth international conference on APL table of contents

Ottawa, Canada

Pages: 74 - 77

Year of Publication: 1976

Author

Paul Berry

Sponsors

MSSNT : Ministry of State for Science and Technology
SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 15, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800114.803662 What is a DOI?

ABSTRACT

The elements of an array may be rounded in such a way that their sums along a particular axis are consistent with their sums before rounding. The needed adjustments can be made “fairly”—that is, taking into account both the relative accuracy and the serial position of the rounded elements. Using such an algorithm, it is possible to assure that percentages, budget categories, or arrays used in other applications where a given initial amount is partitioned among several components, add to the expected totals.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bombaugh, C. C. Oddities and Curiosities of Language and Literature, New York: Dover, 1961.
	2	Halpern, Michael M. Studies in APL: Algebra, Scan, Arithmetic, Permutations, IBM Technical Report 320-3023, 1973.