.png){kind=icon}
.png){kind=icon}
Return
The dimension weighted fast multipole method for scattered data approximation
.png){kind=icon}
OA
AI
DOI：10.1016/j.jcp.2025.113956.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article is concerned with scattered data approximation for higher dimensional data sets which exhibit an anisotropic behavior with respect to their different dimensions. Tailoring sparse polynomial interpolation to this specific situation, we derive degenerate kernel approximations which are integrated into a dimension weighted fast multipole method. This dimension weighted fast multipole method enables to deal with considerably more dimensions than the standard black box fast multipole method based on tensor product or total degree interpolation. A thorough analysis of the method is provided including rigorous error estimates. The accuracy and the cost of the approach are validated by numerical studies. As a relevant application, we apply the approach to the interpolation of an output functional of a shape uncertainty quantification problem.
Keywords:
Scattered data interpolation
RKHS
Dimension weights
Fast multipole method
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W