Exact real arithmetic using centred intervals and bounded error terms
From MaRDI portal
Recommendations
Cites work
- A survey of exact arithmetic implementations
- Abstract versus concrete computation on metric partial algebras
- Arbitrary precision real arithmetic: design and algorithms
- Computability and complexity in analysis. 4th international workshop, CCA 2000. Swansea, GB, September 17--19, 2000. Selected papers
- Computability in analysis and physics
- Computable analysis. An introduction
- Computing with real numbers. I. The LFT approach to real number computation. II. A domain framework for computational geometry.
- Domain representability of metric spaces
- Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
- Efficient exact computation of iterated maps
- Exact real arithmetic systems: Results of competition
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 1196661 (Why is no real title available?)
- scientific article; zbMATH DE number 1231567 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- On a theory of computation and complexity over the real numbers: đđ- completeness, recursive functions and universal machines
- The constructive reals as a Java library
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
Cited in
(5)- Refinement of rational end-points real numbers by means of floating-point numbers
- Exact real arithmetic for interval number systems
- Using Taylor models in exact real arithmetic
- Reducibility of domain representations and CantorâWeihrauch domain representations
- Computational complexity of iterated maps on the interval
This page was built for publication: Exact real arithmetic using centred intervals and bounded error terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2577477)