Arbitrary precision real arithmetic: design and proved algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Algebraic Programming Année : 2005

Arbitrary precision real arithmetic: design and proved algorithms

Résumé

We describe here a representation of computable real numbers and a set of algorithms for the elementary functions associated to this representation. A real number is represented as a sequence of finite B-adic numbers and for each classical function (rational, algebraic or transcendental), we describe how to produce a sequence representing the result of the application of this function to its arguments, according to the sequences representing these arguments. For each algorithm we prove that the resulting sequence is a valid representation of the exact real result. This arithmetic is the first real arithmetic with mathematically proved algorithms.

Dates et versions

hal-01148736 , version 1 (05-05-2015)

Identifiants

Citer

Valérie Ménissier-Morain. Arbitrary precision real arithmetic: design and proved algorithms. Journal of Logic and Algebraic Programming, 2005, 64 (1), pp.13-39. ⟨10.1016/j.jlap.2004.07.003⟩. ⟨hal-01148736⟩
44 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More