.png){kind=icon}
返回
A FAST SUMMATION TREE CODE FOR MATERN KERNEL
.png){kind=icon}
OA
AI
DOI：10.1137/120903002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Matern family of functions is a widely used covariance kernel in spatial statistics for Gaussian process modeling, which in many instances requires calculations with a covariance matrix. In this paper, we design a fast summation algorithm for the Matern kernel in order to efficiently perform matrix-vector multiplications. This algorithm is based on the Barnes-Hut tree code framework and addresses several practical issues: the anisotropy of the kernel, the nonuniform distribution of the point set, and a tight error estimate of the approximation. Even though the algorithmic details differ from the standard tree code in several aspects, empirically the computational cost of our algorithm scales as O(n log n) for n points. Comprehensive numerical experiments are shown to demonstrate the practicality of the design.
Keyword:
Matern kernel
Gaussian process
fast summation
tree code
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容