.png){kind=icon}
.png){kind=icon}
Return
Multivariate approximation at fake nodes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2020.125628.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main goal of the present paper is to extend the interpolation via the so-called mapped bases without resampling to any basis and dimension. So far indeed, we investigated the univariate case, its extension to rational polynomial interpolation and its natural applica-tion to numerical integration. The concept of mapped bases has been widely studied, but all the proposed methods show convergence provided that the function is resampled at the mapped nodes. In applications, this is often physically unfeasible. Thus, we propose an effective method for interpolating via mapped bases in the multivariate setting. We might refer to the method as Fake Nodes Approach (FNA). Our theoretical results are confirmed by various numerical experiments devoted to point out the robustness of the proposed scheme. (c) 2020 Elsevier Inc. All rights reserved.
Keywords:
Multivariate polynomial interpolation
Kernel-based interpolation
Gibbs phenomenon
Runge phenomenon
Mapped bases
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W