DOI: 10.1145/355606.361870. Algorithms to reveal properties of floating-point arithmetic

Algorithms to reveal properties of floating-point arithmetic

10.1145/355606.361870

Crossref journal-article

Association for Computing Machinery (ACM)

Communications of the ACM (320)

Abstract

Two algorithms are presented in the form of Fortran subroutines. Each subroutine computes the radix and number of digits of the floating-point numbers and whether rounding or chopping is done by the machine on which it is run. The methods are shown to work on any “reasonable” floating-point computer.

Bibliography

Malcolm, M. A. (1972). Algorithms to reveal properties of floating-point arithmetic. Communications of the ACM, 15(11), 949â951.

Authors 1

Michael A. Malcolm (first)

References 1 Referenced 34

10.1145/1052614.1052615

Dates

Type	When
Created	23 years, 1 month ago (July 27, 2002, 7:32 a.m.)
Deposited	2 months, 1 week ago (June 18, 2025, 7:44 p.m.)
Indexed	12 hours, 30 minutes ago (Aug. 29, 2025, 6:14 a.m.)
Issued	52 years, 9 months ago (Nov. 1, 1972)
Published	52 years, 9 months ago (Nov. 1, 1972)
Published Online	52 years, 9 months ago (Nov. 1, 1972)
Published Print	52 years, 9 months ago (Nov. 1, 1972)

Funders 0

None

BibTeX

@article{Malcolm_1972, title={Algorithms to reveal properties of floating-point arithmetic}, volume={15}, ISSN={1557-7317}, url={http://dx.doi.org/10.1145/355606.361870}, DOI={10.1145/355606.361870}, number={11}, journal={Communications of the ACM}, publisher={Association for Computing Machinery (ACM)}, author={Malcolm, Michael A.}, year={1972}, month=nov, pages={949–951} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        8,
        29
      ]
    ],
    "date-time": "2025-08-29T10:14:14Z",
    "timestamp": 1756462454014,
    "version": "3.41.0"
  },
  "reference-count": 1,
  "publisher": "Association for Computing Machinery (ACM)",
  "issue": "11",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1972,
            11,
            1
          ]
        ],
        "date-time": "1972-11-01T00:00:00Z",
        "timestamp": 89424000000
      },
      "content-version": "vor",
      "delay-in-days": 0,
      "URL": "https://www.acm.org/publications/policies/copyright_policy#Background"
    }
  ],
  "content-domain": {
    "domain": [
      "dl.acm.org"
    ],
    "crossmark-restriction": true
  },
  "published-print": {
    "date-parts": [
      [
        1972,
        11
      ]
    ]
  },
  "abstract": "<jats:p>Two algorithms are presented in the form of Fortran subroutines. Each subroutine computes the radix and number of digits of the floating-point numbers and whether rounding or chopping is done by the machine on which it is run. The methods are shown to work on any \u201creasonable\u201d floating-point computer.</jats:p>",
  "DOI": "10.1145/355606.361870",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2002,
        7,
        27
      ]
    ],
    "date-time": "2002-07-27T11:32:44Z",
    "timestamp": 1027769564000
  },
  "page": "949-951",
  "update-policy": "https://doi.org/10.1145/crossmark-policy",
  "source": "Crossref",
  "is-referenced-by-count": 34,
  "title": "Algorithms to reveal properties of floating-point arithmetic",
  "prefix": "10.1145",
  "volume": "15",
  "author": [
    {
      "given": "Michael A.",
      "family": "Malcolm",
      "sequence": "first",
      "affiliation": [
        {
          "name": "Stanford Univ., Stanford, CA"
        }
      ]
    }
  ],
  "member": "320",
  "published-online": {
    "date-parts": [
      [
        1972,
        11
      ]
    ]
  },
  "reference": [
    {
      "key": "e_1_2_1_1_2",
      "doi-asserted-by": "publisher",
      "DOI": "10.1145/1052614.1052615"
    }
  ],
  "container-title": "Communications of the ACM",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://dl.acm.org/doi/10.1145/355606.361870",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://dl.acm.org/doi/pdf/10.1145/355606.361870",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2025,
        6,
        18
      ]
    ],
    "date-time": "2025-06-18T23:44:03Z",
    "timestamp": 1750290243000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://dl.acm.org/doi/10.1145/355606.361870"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1972,
        11
      ]
    ]
  },
  "references-count": 1,
  "journal-issue": {
    "issue": "11",
    "published-print": {
      "date-parts": [
        [
          1972,
          11
        ]
      ]
    }
  },
  "alternative-id": [
    "10.1145/355606.361870"
  ],
  "URL": "http://dx.doi.org/10.1145/355606.361870",
  "relation": {},
  "ISSN": [
    "0001-0782",
    "1557-7317"
  ],
  "subject": [],
  "container-title-short": "Commun. ACM",
  "published": {
    "date-parts": [
      [
        1972,
        11
      ]
    ]
  },
  "assertion": [
    {
      "value": "1972-11-01",
      "order": 2,
      "name": "published",
      "label": "Published",
      "group": {
        "name": "publication_history",
        "label": "Publication History"
      }
    }
  ]
}