Scaling Optimized Hermite Approximation Methods
Hao Hu, Haijun Yu

TL;DR
This paper demonstrates that proper scaling of Hermite functions significantly improves approximation performance by balancing errors, with a new error analysis framework explaining convergence behaviors.
Contribution
It introduces a novel error analysis framework for scaled Hermite approximation, clarifying how optimal scaling enhances convergence and performance.
Findings
Proper scaling balances spatial and frequency errors.
Geometric convergence is recovered with correct scaling.
Scaling doubles convergence order for algebraically decaying functions.
Abstract
Hermite polynomials and functions have extensive applications in scientific and engineering problems. Although it is recognized that employing the scaled Hermite functions rather than the standard ones can remarkably enhance the approximation performance, the understanding of the scaling factor remains insufficient. Due to the lack of theoretical analysis, recent publications still cast doubt on whether the Hermite spectral method is inferior to other methods. To dispel this doubt, we show in this article that the inefficiency of the Hermite spectral method comes from the imbalance in the decay speed of the objective function within the spatial and frequency domains. Proper scaling can render the Hermite spectral methods comparable to other methods. To make it solid, we propose a novel error analysis framework for the scaled Hermite approximation. Taking the projection error as an…
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.
