Exact Real Computer Arithmetic with Continued Fractions
IEEE Transactions on Computers
Exact real arithmetic formulating real numbers as functions
Research topics in functional programming
A first course in the numerical analysis of differential equations
A first course in the numerical analysis of differential equations
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
Exact real arithmetic: a case study in higher order programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Applied Numerical Methods with Software
Applied Numerical Methods with Software
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A computer-verified monadic functional implementation of the integral
Theoretical Computer Science
Domain-Theoretic formulation of linear boundary value problems
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
We show that the classical techniques in numerical integration (namely the Darboux sums method, the compound trapezoidal and Simpson's rules and the Gauss-Legendre formulae) can be implemented in an exact real arithmetic framework in which the numerical value of an integral of an elementary function is obtained up to any desired accuracy without any round-off errors. Any exact framework which provides a library of algorithms for computing elementary functions with an arbitrary accuracy is suitable for such an implementation; we have used an exact real arithmetic framework based on linear fractional transformations and have thereby implemented these numerical integration techniques. We also show that Euler's and Runge-Kutta methods for solving the initial value problem of an ordinary differential equation can be implemented using an exact framework which will guarantee the convergence of the approximation to the actual solution of the differential equation as the step size in the partition of the interval in question tends to zero.