Go to main content

School of Computer Science Intranet

APT research areas

Discover our main research areas

Computable Function Representation Using Effective Chebyshev Polynomial

Mohammed A. Abutheraa and David Lester


We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions.