If you need an accessible version of this item please contact JSTOR User Support

Some Results Relevant to Choice of Sum and Sum-of-Product Algorithms

Edward A. Youngs and Elliot M. Cramer
Technometrics
Vol. 13, No. 3 (Aug., 1971), pp. 657-665
DOI: 10.2307/1267176
Stable URL: http://www.jstor.org/stable/1267176
Page Count: 9
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Some Results Relevant to Choice of Sum and Sum-of-Product Algorithms
Preview not available

Abstract

Sum and sum-of-product algorithms, some designed to minimize significance error, are compared and recommendations for usage are offered. A simplified method of rounding is presented and the benefit of using it demonstrated. Results are presented for the IBM 360 as well as the IBM 7040 computers with obvious application to some other machines.

Page Thumbnails

  • Thumbnail: Page 
657
    657
  • Thumbnail: Page 
658
    658
  • Thumbnail: Page 
659
    659
  • Thumbnail: Page 
660
    660
  • Thumbnail: Page 
661
    661
  • Thumbnail: Page 
662
    662
  • Thumbnail: Page 
663
    663
  • Thumbnail: Page 
664
    664
  • Thumbnail: Page 
665
    665