Fast Iterative Adaptive Multi-quadric Radial Basis Function Method for Edges Detection of Piecewise Functions—I: Uniform Mesh

Abstract

In Jung et al. (Appl Numer Math 61:77–91, 2011), an iterative adaptive multi-quadric radial basis function (IAMQ-RBF) method has been developed for edges detection of the piecewise analytical functions. For a uniformly spaced mesh, the perturbed Toeplitz matrices, which are modified by those columns where the shape parameters are reset to zero due to the appearance of edges at the corresponding locations, are created. Its inverse must be recomputed at each iterative step, which incurs a heavy $$O(n^3)$$ computational cost. To overcome this issue of efficiency, we develop a fast direct solver (IAMQ-RBF-Fast) to reformulate the perturbed Toeplitz system into two Toeplitz systems and a small linear system via the Sherman–Morrison–Woodbury formula. The $$O(n^2)$$ Levinson–Durbin recursive algorithm that employed Yule–Walker algorithm is used to find the inverse of the Toeplitz matrix fast. Several classical benchmark examples show that the IAMQ-RBF-Fast based edges detection method can be at least three times faster than the original IAMQ-RBF based one. And it can capture an edge with fewer grid points than the multi-resolution analysis (Harten in J Comput Phys 49:357–393, 1983) and just as good as if not better than the L1PA method (Denker and Gelb in SIAM J Sci Comput 39(2):A559–A592, 2017). Preliminary results in the density solution of the 1D Mach 3 extended shock–density wave interaction problem solved by the hybrid compact-WENO finite difference scheme with the IAMQ-RBF-Fast based shocks detection method demonstrating an excellent performance in term of speed and accuracy, are also shown.