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