Computations with effective real numbers

Authors:
Joris van der Hoeven
Affiliations:
Dépt. de Mathématiques, Université Paris-Sud, Orsay Cedex, France
Venue:
Theoretical Computer Science - Real numbers and computers
Year:
2006

Citing 3
Cited 4

Lazy multiplication of formal power series

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
How to recognize zero

Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Relax, but don't be too lazy

Journal of Symbolic Computation

Effective real numbers in Mmxlib

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Around the numeric-symbolic computation of differential Galois groups

Journal of Symbolic Computation
Efficient exact arithmetic over constructive reals

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Numeric-symbolic methods for computing the Liouvillian solutions of differential equations and systems

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

A real number x is said to be effective if there exists an algorithm which, given a required tolerance ε ∈ Z2Z, returns a binary approximation x˜ ∈, Z2Z for x with |x˜-x|