High-Accuracy Machine-Efficient Chebyshev Approximation: An Application to Spectral methods for Sobolev spaces

Autori

  • Mohammed Abdulla Abutheraa The University of Manchester
  • David Lester The University of Manchester

DOI:

https://doi.org/10.1685/

Parole chiave:

(Chebyshev Polynomial, Computable Functions, Exact Real Arithmetic, Machine-Efficient Approximation, Partial Differential Equations)

Abstract

Machine-Efficient Chebyshev Approximation is a technique that permits practical evaluation of transcendental functions within a computable arithmetic, such as the computable reals. The approach adopts the usual Chebyshev method so that coefficients are efficiently handled by current computer hardware. The proposed technique has an application to spectral methods for sobolev spaces. A practical demonstration of this work is presented using Müller's iRRAM exact arithmetic package. Experimental evaluation demonstrates that machine efficient approximations do indeed improve the efficiency with which these operations can be performed. [DOI: 10.1685/CSC09225] About DOI

Pubblicato

2009-08-12

Fascicolo

Sezione

Articles