Adaptive Smolyak Pseudospectral Approximations
Patrick R. Conrad, Youssef M. Marzouk

TL;DR
This paper introduces an adaptive Smolyak pseudospectral approximation method that improves accuracy and efficiency in polynomial approximations of complex models, avoiding internal aliasing and enabling effective adaptive refinement.
Contribution
The paper extends non-adaptive Smolyak pseudospectral methods, analyzes aliasing issues in direct quadrature, and proposes an adaptive refinement heuristic with demonstrated convergence and practical effectiveness.
Findings
The adaptive method avoids internal aliasing errors.
Theoretical analysis confirms improved approximation accuracy.
Numerical experiments show convergence and efficiency in practical problems.
Abstract
Polynomial approximations of computationally intensive models are central to uncertainty quantification. This paper describes an adaptive method for non-intrusive pseudospectral approximation, based on Smolyak's algorithm with generalized sparse grids. We rigorously analyze and extend the non-adaptive method proposed in [6], and compare it to a common alternative approach for using sparse grids to construct polynomial approximations, direct quadrature. Analysis of direct quadrature shows that O(1) errors are an intrinsic property of some configurations of the method, as a consequence of internal aliasing. We provide precise conditions, based on the chosen polynomial basis and quadrature rules, under which this aliasing error occurs. We then establish theoretical results on the accuracy of Smolyak pseudospectral approximation, and show that the Smolyak approximation avoids internal…
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.
