The Mathematical Institute, University of Oxford, Eprints Archive

Chopping a Chebyshev series

Aurentz, Jared L and Trefethen, Lloyd N. (2015) Chopping a Chebyshev series. Technical Report. ACM, ACM Trans. Math. Softw.. (Submitted)

[img]
Preview
PDF
1MB

Abstract

Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function f(x) defined on an interval [a, b] is “rounded” to a prescribed precision by constructing a Chebyshev series and chopping it at an appropriate point. Designing a chopping algorithm with the right properties proves to be a surprisingly complex and interesting problem. We describe the chopping algorithm introduced in Chebfun Version 5.3 in 2015 after
many years of discussion and the considerations that led to this design.

Item Type:Technical Report (Technical Report)
Subjects:H - N > Numerical analysis
Research Groups:Numerical Analysis Group
ID Code:1916
Deposited By: Helen Taylor
Deposited On:09 Dec 2015 07:34
Last Modified:09 Dec 2015 07:34

Repository Staff Only: item control page