Zur Division mit Rest auf Gleitkommarechnern. (Division with remainder on floating point computers)

MaRDI QIDQ1823970zbMATH OpenFDO

Authors Detlef Gröger

Publication date 1989

Published in Mathematische Semesterberichte (Search for Journal in Brave)

zbMATH Keywords

divisions with remainderfloating point arithmeticinteger computationsRounding off errors

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Radix representation; digital problems (11A63) Interval and finite arithmetic (65G30)

Review text

Rounding off errors often make computations in integers by floating point arithmetic difficult. In this paper it is shown that for divisions with remainder there exist bounds for input data such that output data are exact.

Recommendations

• Polynomial division with a remainder by means of evaluation and interpolation
• On relative errors of floating-point operations: optimal bounds and applications
• High-precision division and square root
• A p p bit fraction model of binary floating point division and extremal rounding cases.
• scientific article; zbMATH DE number 40800

Cited in

(4)

• A p p bit fraction model of binary floating point division and extremal rounding cases.
• The complete system of residues theory for the remainder operator of C language
• A note on complex division
• Dividing by zero -- how bad is it, really?

This page was built for publication: Zur Division mit Rest auf Gleitkommarechnern. (Division with remainder on floating point computers)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823970)