Extension of Chebfun to periodic functions
Grady B. Wright, Mohsin Javed, Hadrien Montanelli, and Lloyd N., Trefethen

TL;DR
This paper extends the Chebfun framework to handle periodic functions using trigonometric polynomial approximations, enabling high-precision numerical solutions to periodic differential equations.
Contribution
It introduces algorithms and mathematical methods for periodic function approximation within Chebfun, highlighting differences from the nonperiodic case.
Findings
Achieves approximations to machine precision for periodic functions.
Provides algorithms for solving linear and nonlinear periodic ODEs.
Highlights key differences from nonperiodic Chebyshev methods.
Abstract
Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary differential equations. Differences from the nonperiodic Chebyshev case are highlighted.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
