.png){kind=icon}
返回
Implicit local radial basis function interpolations based on function values
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2015.04.107.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we propose two fast localized radial basis function fitting algorithms for solving large-scale scattered data interpolation problems. For each given point in the given data set, a local influence domain containing a small number of nearest neighboring points is established and a global interpolation is performed within this restricted domain. A sparse matrix is formulated based on the global interpolation in these local influence domains. The proposed methods have achieved both low computational cost and minimal memory storage. In comparison with the compactly supported radial basis functions, the proposed fitting algorithms are highly accurate. The numerical examples have provided strong evidence that the two proposed algorithms are indeed highly efficient and accurate. In the two proposed algorithms, we have successfully solved a large-scale interpolation problem with 225,000 interpolation points in two dimensional space. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
RBFs
Interpolation
Large-scale
Sparse matrix
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
查看更多内容