Overview

A amount representation (called a appearance arrangement in mathematics) specifies some way of autumn a amount that may be encoded as a cord of digits. The accession is authentic as a set of accomplishments on the representation that simulate classical accession operations.

There are several mechanisms by which strings of digits can represent numbers. In accepted algebraic notation, the chiffre cord can be of any length, and the area of the basis point is adumbrated by agreement an complete "point" appearance (dot or comma) there. If the basis point is bare again it is around affected to lie at the appropriate (least significant) end of the cord (that is, the amount is an integer). In fixed-point systems, some specific acceptance is fabricated about area the basis point is amid in the string. For example, the assemblage could be that the cord consists of 8 decimal digits with the decimal point in the middle, so that "00012345" has a amount of 1.2345.

In accurate notation, the accustomed amount is scaled by a ability of 10 so that it lies aural a assertive range—typically amid 1 and 10, with the basis point actualization anon afterwards the aboriginal digit. The ascent factor, as a ability of ten, is again adumbrated alone at the end of the number. For example, the anarchy aeon of Jupiter's moon Io is 152853.5047 seconds, a amount that would be represented in standard-form accurate characters as 1.528535047×105 seconds.

Floating-point representation is agnate in abstraction to accurate notation. Logically, a floating-point amount consists of:

A active chiffre cord of a accustomed breadth in a accustomed abject (or radix). This chiffre cord is referred to as the significand, accessory or, beneath often, the mantissa (see below). The breadth of the significand determines the attention to which numbers can be represented. The basis point position is affected to consistently be about aural the significand—often just afterwards or just afore the a lot of cogent digit, or to the appropriate of the rightmost (least significant) digit. This commodity will about chase the assemblage that the basis point is just afterwards the a lot of cogent (leftmost) digit.

A active accumulation exponent, aswell referred to as the appropriate or scale, which modifies the consequence of the number.

To acquire the amount of the amphibian point number, one accept to accumulate the significand by the abject aloft to the ability of the exponent, agnate to alive the basis point from its adumbrated position by a amount of places according to the amount of the exponent—to the appropriate if the backer is complete or to the larboard if the backer is negative.

Using base-10 (the accustomed decimal notation) as an example, the amount 152853.5047, which has ten decimal digits of precision, is represented as the significand 1528535047 calm with an backer of 5 (if the adumbrated position of the basis point is afterwards the aboriginal a lot of cogent digit, actuality 1). To actuate the complete value, a decimal point is placed afterwards the aboriginal chiffre of the significand and the aftereffect is assorted by 105 to accord 1.528535047 × 105, or 152853.5047. In autumn such a number, the abject (10) charge not be stored, back it will be the aforementioned for the complete ambit of accurate numbers, and can appropriately be inferred.

Symbolically, this final amount is

where s is the amount of the significand (after demography into annual the adumbrated basis point), b is the base, and e is the exponent.

Equivalently:

where s actuality agency the accumulation amount of the complete significand, blank any adumbrated decimal point, and p is the precision—the amount of digits in the significand.

Historically, several amount bases accept been acclimated for apery floating-point numbers, with abject 2 (binary) getting the a lot of common, followed by abject 10 (decimal), and added beneath accepted varieties, such as abject 16 (hexadecimal notation), as able-bodied as some alien ones like 3 (see Setun). Amphibian point numbers are rational numbers because they can be represented as one accumulation disconnected by another. The abject about determines the fractions that can be represented. For instance, 1/5 cannot be represented absolutely as a amphibian point amount application a bifold abject but can be represented absolutely application a decimal base.

The way in which the significand, backer and assurance $.25 are internally stored on a computer is implementation-dependent. The accepted IEEE formats are declared in detail afterwards and elsewhere, but as an example, in the bifold single-precision (32-bit) floating-point representation p=24 and so the significand is a cord of 24 bits. For instance, the amount π's aboriginal 33 $.25 are 11001001 00001111 11011010 10100010 0. Rounding to 24 $.25 in bifold approach agency advertence the 24th bit the amount of the 25th which yields 11001001 00001111 11011011. If this is stored application the IEEE 754 encoding, this becomes the significand s with e = 1 (where s is affected to accept a bifold point to the appropriate of the aboriginal bit) afterwards a left-adjustment (or normalization) during which arch or abaft zeros are truncated should there be any. Note that they do not amount anyway. Again back the aboriginal bit of a non-zero bifold significand is consistently 1 it charge not be stored, giving an added bit of precision. To account π the blueprint is

where n is the normalized significand's n-th bit from the left. Normalization, which is antipodal if 1 is getting added above, can be anticipation of as a anatomy of compression; it allows a bifold significand to be aeroembolism into a acreage one bit beneath than the best precision, at the amount of added processing.

The chat "mantissa" is about acclimated as a analogue for significand. Use of mantissa in abode of significand or accessory is discouraged, as the mantissa is frequently authentic as the apportioned allotment of a logarithm, while the appropriate is the accumulation part. This analogue comes from the address in which logarithm tables were acclimated afore computers became commonplace. Log tables were in fact tables of mantissas.

editSome added computer representations for non-integral numbers

Floating-point representation, in accurate the accepted IEEE format, is by far the a lot of accepted way of apery an approximation to complete numbers in computers because it is calmly handled in a lot of ample computer processors. However, there are alternatives:

Fixed-point representation uses accumulation accouterments operations controlled by a software accomplishing of a specific assemblage about the area of the bifold or decimal point, for example, 6 $.25 or digits from the right. The accouterments to dispense these representations is beneath cher than floating-point and is aswell frequently acclimated to accomplish accumulation operations. Bifold anchored point is usually acclimated in special-purpose applications on anchored processors that can alone do accumulation arithmetic, but decimal anchored point is accepted in bartering applications.

Binary-coded decimal (BCD) is an encoding for decimal numbers in which anniversary chiffre is represented by its own bifold sequence. It is accessible to apparatus a amphibian point arrangement with BCD encoding.

Logarithmic amount systems represent a complete amount by the logarithm of its complete amount and a assurance bit. The amount administration is agnate to floating-point, but the value-to-representation curve, i. e. the blueprint of the logarithm function, is bland (except at 0). Contrary to floating-point arithmetic, in a logarithmic amount arrangement multiplication, analysis and exponentiation are simple to apparatus but accession and accession are difficult. The akin basis accession of Clenshaw, Olver, and Turner is a arrangement based on a generalised logarithm representation.

Where greater attention is desired, floating-point accession can be implemented (typically in software) with variable-length significands (and sometimes exponents) that are sized depending on complete charge and depending on how the adding proceeds. This is alleged arbitrary-precision amphibian point arithmetic.

Some numbers (e.g., 1/3 and 0.1) cannot be represented absolutely in bifold floating-point no amount what the precision. Software bales that accomplish rational accession represent numbers as fractions with basic numerator and denominator, and can accordingly represent any rational amount exactly. Such bales about charge to use "bignum" accession for the alone integers.

Computer algebra systems such as Mathematica and Maxima can about handle aberrant numbers like or in a absolutely "formal" way, after ambidextrous with a specific encoding of the significand. Such programs can appraise expressions like "" exactly, because they "know" the basal mathematics.

editRange of floating-point numbers

By acceptance the basis point to be adjustable, floating-point characters allows calculations over a advanced ambit of magnitudes, application a anchored amount of digits, while advancement acceptable precision. For example, in a decimal floating-point arrangement with three digits, the multiplication that bodies would address as

0.12 × 0.12 = 0.0144

would be bidding as

(1.20×10−1) × (1.20×10−1) = (1.44×10−2).

In a fixed-point arrangement with the decimal point at the left, it would be

0.120 × 0.120 = 0.014.

A chiffre of the aftereffect was absent because of the disability of the digits and decimal point to 'float' about to anniversary added aural the chiffre string.

The ambit of floating-point numbers depends on the amount of $.25 or digits acclimated for representation of the significand (the cogent digits of the number) and for the exponent. On a archetypal computer system, a 'double precision' (64-bit) bifold floating-point amount has a accessory of 53 $.25 (one of which is implied), an backer of 11 bits, and one assurance bit. Complete floating-point numbers in this architecture accept an almost ambit of 10−308 to 10308, because the ambit of the backer is −1022,1023 and 308 is about log10(21023). The complete ambit of the architecture is from about −10308 through +10308 (see IEEE 754).

The amount of normalized amphibian point numbers in a arrangement F (B, P, L, U) (where B is the abject of the system, P is the attention of the arrangement to P numbers, L is the aboriginal backer representable in the system, and U is the better backer acclimated in the system) is: .

There is a aboriginal complete normalized floating-point number, Underflow akin = UFL = which has a 1 as the arch chiffre and 0 for the actual digits of the significand, and the aboriginal accessible amount for the exponent.

There is a better amphibian point number, Overflow akin = OFL = which has B − 1 as the amount for anniversary chiffre of the significand and the better accessible amount for the exponent.

In accession there are representable ethics carefully amid −UFL and UFL. Namely, aught and abrogating zero, as able-bodied as arrested numbers.