Computational issues by interpolating with inverse multiquadrics: a solution

DOI10.14658/PUPJ-DRNA-2022-5-6MaRDI QIDQ6398608zbMATH OpenFDO

Authors Stefano De Marchi, N. Egidi, Josephin Giacomini, P. Maponi, Alessia Perticarini

Publication date 9 May 2022

Full work available at URL https://doi.org/10.14658/PUPJ-DRNA-2022-5-6

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical linear algebra (65Fxx) Numerical methods for partial differential equations, boundary value problems (65Nxx)

Abstract: We consider the interpolation problem with the inverse multiquadric radial basis function. The problem usually produces a large dense linear system that has to be solved by iterative methods. The efficiency of such methods is strictly related to the computational cost of the multiplication between the coefficient matrix and the vectors computed by the solver at each iteration. We propose an efficient technique for the calculation of the product of the coefficient matrix and a generic vector. This computation is mainly based on the well-known spectral decomposition in spherical coordinates of the Green's function of the Laplacian operator. We also show the efficiency of the proposed method through numerical simulations.

Recommendations

• Rapid evaluation of radial basis functions
• Stable computation of multiquadric interpolants for all values of the shape parameter
• \(\mathcal{H}\)-inverses for RBF interpolation
• scientific article; zbMATH DE number 1487960
• Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration

Cited in

(2)

• \(\mathcal{H}\)-inverses for RBF interpolation
• ATMA2021 -- \textbf{A}pproximation: \textbf{T}heory, \textbf{M}ethods, and \textbf{A}pplications

This page was built for publication: Computational issues by interpolating with inverse multiquadrics: a solution

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