Computer arithmetic is the scientific field that deals with representation of numbers on computers and corresponding implementations of the arithmetic operations.[1] [2]
It includes:
- Fixed-size arithmetic
- "Integer arithmetic", which in practice is modular arithmetic by a power of 2.
- Fixed-point arithmetic
- Modular arithmetic
- Multi-modular arithmetic
- p-adic arithmetic, consisting of computing modulo a single prime number and retrieving the integer or rational result by using Hensel lifting
- Finite field arithmetic
- Floating-point arithmetic
- Arbitrary-precision arithmetic
- Interval arithmetic
- Symmetric level-index arithmetic
- Matrix arithmetic
In the cases where the size of the representation of a number is fixed (fixed-point, floating-point and interval arithmetic), the main concern is to control the computational error, as far as possible; see, for example IEEE 754.
In the other cases, where an exact result should be provided, the main concern is the practical efficiency, which is optimized by combining improvements of computational complexity with hardware specificities.
ARITH Symposium on Computer Arithmetic is an international symposium devoted to computer arithmetic.
References
- ^ Parhami, Behrooz (2003), "Number Representation and Computer Arithmetic" (PDF), Encyclopedia of Information Systems, Elsevier, pp. 217–333
- ^ Grys, Slawomir (2023), "Computer Arithmetic in Practice", Taylor & Francis Group, CRC Press, p. 212, doi:10.1201/9781003363286, ISBN 978-1-003-36328-6
 | This computing article is a stub. You can help Wikipedia by adding missing information. |
