Arbitrary-precision arithmetic

In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performed on numbers whose digits of precision are limited only by the available memory of the host system. This contrasts with the faster fixed-precision arithmetic found in most arithmetic logic unit (ALU) hardware, which typically offers between 8 and 64 bits of precision. Several modern programming languages have built-in support for bignums, and others have libraries available for arbitrary-precision integer and floating-point math. Rather than storing values as a fixed number of bits related to the size of the processor register, these implementations typically use variable-length arrays of digits. Arbitrary precision is used in applications where the speed of arithmetic is not a limiting factor, or where precise results with very large numbers are required. It should not be confused wit

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Related people

Related units

Related concepts

Related courses

Related lectures

Summary

Official source

About this result

Related publications (22)

Related publications

Related people

Related units

Related concepts (51)

Related concepts

Related courses (12)

Related courses

Related lectures (13)

Related lectures

Generalized Blocks of Unipotent Characters in the Finite General Linear Group

In an article of 2003, Kulshammer, Olsson, and Robinson defined l-blocks for the symmetric groups, where l is an arbitrary integer, and proved that they satisfy an analogue of the Nakayama Conjecture. Inspired by this work and the definitions of generalized blocks and sections given by the authors, we give in this article a definition of d-sections in the finite general linear group, and construct d-blocks of unipotent characters, where d is an arbitrary integer. We prove that they satisfy one direction of an analogue of the Nakayama Conjecture, and, in some cases, prove the other direction. We also prove that they satisfy an analogue of Brauer's Second Main Theorem.

Taylor & Francis2008

On defect groups for generalized blocks of the symmetric group

In a paper of 2003, Kulshammer, Olsson and Robinson defined l-blocks for the symmetric groups, where l > 1 is an arbitrary integer. In this paper, we give a definition for the defect group of the principal l-block. We then check that, in the Abelian case, we have an analogue of one of Broue's conjectures.

2008

Defect of characters of the symmetric group

Following the work of B. Kulshammer, J. B. Olsson and G. R. Robinson on generalized blocks of the symmetric groups, we give a definition for the l-defect of characters of the symmetric group G(n), where l > 1 is an arbitrary integer. We prove that the l-defect is given by an analogue of the hook-length formula, and use it to prove, when n < l(2), an l-version of the McKay conjecture in G(n).

De Gruyter2009

Floating-point arithmetic

In computing, floating-point arithmetic (FP) is arithmetic that represents subsets of real numbers using an integer with a fixed precision, called the significand, scaled by an integer exponent of a

Python (programming language)

Python is a high-level, general-purpose programming language. Its design philosophy emphasizes code readability with the use of significant indentation. Python is dynamic

Integer (computer science)

In computer science, an integer is a datum of integral data type, a data type that represents some range of mathematical integers. Integral data types may be of different sizes and may or may not be

CIVIL-321: Numerical modelling of solids and structures

La modélisation numérique des solides est abordée à travers la méthode des éléments finis. Les aspects purement analytiques sont d'abord présentés, puis les moyens d'interpolation, d'intégration et de résolution de la mécanique sont étudiés.

MATH-251(c): Numerical analysis

Le cours présente des méthodes numériques pour la résolution de problèmes mathématiques comme des systèmes d'équations linéaires ou non linéaires, approximation de fonctions, intégration et dérivation, équations différentielles.

CS-420: Advanced compiler construction

Students learn several implementation techniques for modern functional and object-oriented programming languages. They put some of them into practice by developing key parts of a compiler and run time system for a simple functional programming language.