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.
First published in SIAM Journal on Scientific Computing in 2015, volume 37, issue 5, published by the Society of Industrial and Applied Mathematics (SIAM). Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
Wright, Grady B.; Javed, Mohsin; Montanelli, Hadrien; and Trefethen, Lloyd N.. (2015). "Extension of Chebfun to Periodic Functions". SIAM Journal on Scientific Computing, 37(5), C554-C573. http://dx.doi.org/10.1137/141001007