.png){kind=icon}
.png){kind=icon}
Return
HIERARCHICAL MATRIX APPROXIMATION FOR KERNEL-BASED SCATTERED DATA INTERPOLATION
.png){kind=icon}
PRE
AI
DOI：10.1137/16M1101167.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Scattered data interpolation by radial kernel functions leads to linear equation systems with large, fully populated, ill-conditioned interpolation matrices. A successful iterative solution of such a system requires an efficient matrix-vector multiplication as well as an efficient preconditioner. While multipole approaches provide a fast matrix-vector multiplication, they avoid the explicit setup of the system matrix which hinders the construction of preconditioners, such as approximate inverses or factorizations which typically require the explicit system matrix for their construction. In this paper, we propose an approach that allows both an efficient matrix-vector multiplication as well as an explicit matrix representation which can then be used to construct a preconditioner. In particular, the interpolation matrix will be represented in hierarchical matrix format, and several approaches for the blockwise low-rank approximation are proposed and compared, of both analytical nature (separable expansions) and algebraic nature (adaptive cross approximation). The validity of using an approximate system matrix in the iterative solution of the interpolation equations is demonstrated through a range of numerical experiments.
Keywords:
radial basis function
scattered data interpolation
hierarchical matrices
data sparse approximation
adaptive cross approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W