On Trigonometric Interpolation and Its Applications
Xiaorong Zou

TL;DR
This paper introduces a new trigonometric interpolation algorithm that improves efficiency and accuracy, especially for derivatives and non-periodic functions, with applications to integral estimation and solving ODEs, outperforming traditional methods.
Contribution
It proposes a novel trigonometric interpolation method with enhanced convergence and applicability to non-periodic functions, leveraging FFT for better efficiency and error control.
Findings
Achieves uniform convergence rates for functions and derivatives.
Outperforms Trapezoid/Simpson methods in integral estimation.
Outperforms Runge-Kutta in solving ODEs.
Abstract
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform (FFT) to enhance efficiency. The algorithm can be formulated in a way such that certain cancellation effects can be effectively leveraged for error analysis, which enables us not only to obtain the desired uniform convergent rate of the approximation to a function, but desired uniform convergent rates for its derivatives as well. We further enhance the algorithm so it can be applied to non-periodic functions defined on bounded intervals. Numerical testing results confirm decent accurate performance of the algorithm. For its application, we demonstrate how it can be applied to estimate integrals and solve linear/non-linear ordinary differential…
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.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Geodetic Measurements and Engineering Structures
