Journal article icon

Journal article

Chopping a Chebyshev series

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 m...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/2998442

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Author
Publisher:
Association for Computing Machinery Publisher's website
Journal:
ACM Transactions on Mathematical Software Journal website
Volume:
43
Issue:
4
Article number:
33
Publication date:
2016-10-01
Acceptance date:
2016-09-01
DOI:
EISSN:
1557-7295
ISSN:
0098-3500
Source identifiers:
579641
Keywords:
Pubs id:
pubs:579641
UUID:
uuid:36b94561-ffd2-42a5-887d-58fe42c64ca5
Local pid:
pubs:579641
Deposit date:
2016-10-25

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP