Linear-cost Polyharmonic Spline Interpolation of Arbitrary Degree

DOI10.48550/arXiv.2608.11462MaRDI QIDQ7284759arXivFDO

Authors Christopher J. Geoga, Michael O'Neil

Publication date 11 August 2026

Published in arXiv

Tldr We propose a fast and accurate approach to polyharmonic spline (PHS) interpolation using a combination of the fast multipole method and Vecchia approximation, achieving linear-time computation with no parameter tuning required.

Full work available at URL https://doi.org/10.48550/arXiv.2608.11462

arXiv classification

math.NAstat.CO

Cites work

• 2010 Rietz lecture: When does the screening effect hold?
• A fast algorithm for particle simulations
• A general framework for Vecchia approximations of Gaussian processes
• Approximating Likelihoods for Large Spatial Data Sets
• Efficient Algorithms for Bayesian Nearest Neighbor Gaussian Processes
• Fast estimation of \(\mathrm{tr}(f(A))\) via stochastic Lanczos quadrature
• Fast fitting of radial basis functions: Methods based on preconditioned GMRES iteration
• Iterative Methods for Sparse Linear Systems
• Joint mean-covariance models with applications to longitudinal data: unconstrained parameterisation
• New convergence results and preconditioning strategies for the conjugate gradient method
• On the distribution of points in a cube and the approximate evaluation of integrals
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Sparse Cholesky factorization by Kullback-Leibler minimization
• The intrinsic random functions and their applications

This page was built for publication: Linear-cost Polyharmonic Spline Interpolation of Arbitrary Degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284759)