A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds

From MaRDI portal
Publication:1601548





The author compares in a fairly suggestive way several methods which work when one tries to extend a given nonperiodic function to a periodic one on a larger interval. The best extension requires a singular value decomposition with iterative refinements. This achieves accuracy close to machine precision.



Cites work


Cited in
(87)








This page was built for publication: A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds

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