.png){kind=icon}
.png){kind=icon}
Return
SCALING OPTIMIZED HERMITE APPROXIMATION METHODS
.png){kind=icon}
PRE
AI
DOI：10.1137/25M1737146.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 L2 projection error as an example, our framework illustrates that there are three different components of errors: the spatial truncation error, the frequency truncation error, and the Hermite spectral approximation error. Through this perspective, finding the optimal scaling factor is equivalent to balancing the spatial and frequency truncation errors. As applications, we show that geometric convergence can be recovered by proper scaling for a class of functions. Furthermore, we show that proper scaling can double the convergence order for smooth functions with algebraic decay. The perplexing preasymptotic subgeometric convergence when approximating algebraic decay functions can be perfectly explained by this framework.
Keywords:
Hermite functions
scaling factor
Hermite spectral methods
error analysis
pre asymptotic convergence
Journal
IF:
2.9
Papers:
29
Citations:
1.5W