A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions
Zack Morrow, Miroslav Stoyanov

TL;DR
This paper introduces a novel dimensionally adaptive sparse trigonometric interpolation method for periodic functions, effectively handling unknown anisotropy and preserving periodicity, with applications to molecular potential energy surfaces.
Contribution
It presents the first dimensionally adaptive sparse interpolation algorithm using a trigonometric basis, with an anisotropic rate estimation and iterative refinement strategy.
Findings
Successfully recovers theoretical convergence rates in numerical tests.
Effectively approximates periodic potential energy surfaces.
Open-source implementation available in Tasmanian UQ library.
Abstract
We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation…
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.
