Chopping a Chebyshev Series

DOI10.1145/2998442MaRDI QIDQ3133584zbMATHOpenAlexWikidataFDO

Authors Jared Lee Aurentz, Lloyd N. Trefethen

Publication date 5 February 2018

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.01803

zbMATH Keywords

Chebyshev seriesfloating point arithmeticChebfun

Mathematics Subject Classification ID

Roundoff error (65G50) Algorithms for approximation of functions (65D15)

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.

Recommendations

• Publication:3472067
• scientific article; zbMATH DE number 4194395
• Publication:3032582
• scientific article; zbMATH DE number 4073673
• Publication:3475808
• A Comparison of Some Taylor and Chebyshev Series
• scientific article; zbMATH DE number 937807
• On some properties of partial sums for Chebyshev series
• Chebyshev-Type Quadrature and Partial Sums of the Exponential Series

Cited in

(22)

• Local transparent boundary conditions for wave propagation in fractal trees. I: Method and numerical implementation
• Fast algorithms using orthogonal polynomials
• Spectral approximation of convolution operators
• Data-driven algorithms for signal processing with trigonometric rational functions
• An Adaptive Partition of Unity Method for Multivariate Chebyshev Polynomial Approximations
• Quantifying the ill-conditioning of analytic continuation
• Computing with functions in the ball
• \texttt{Chebfun}: A new kind of numerical computing
• Functional Tucker approximation using Chebyshev interpolation
• A fast and spectrally convergent algorithm for rational-order fractional integral and differential equations
• Approximation in the extended functional tensor train format
• Path-following methods for calculating linear surface wave dispersion relations on vertical shear flows
• Continuous analogues of Krylov subspace methods for differential operators
• Solving time-dependent PDEs with the ultraspherical spectral method
• A ``fundamental lemma for continuous-time systems, with applications to data-driven simulation
• An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems
• An adaptive partition of unity method for Chebyshev polynomial interpolation
• scientific article; zbMATH DE number 1285977 (Why is no real title available?)
• A new Legendre polynomial-based approach for non-autonomous linear ODEs
• Spectral Galerkin methods for transfer operators in uniformly expanding dynamics
• Chebyshev-Padé approximants for multivalued functions
• A direct method for solving inverse Sturm–Liouville problems*

Describes a project that uses

Uses Software

• Matlab
• Chebfun
• CHEBINT
• PaCAL
• chebop
• Fourfun

This page was built for publication: Chopping a Chebyshev Series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133584)