no code implementations • 17 May 2021 • Kazuma Tsuji, Ken'ichiro Tanaka
While the computational efficiency of the algorithm and stability of the output quadrature formulas are advantages of this method, the convergence speed of the integration error for a given number of nodes is slow compared to that of other quadrature methods.
1 code implementation • 19 Oct 2018 • Ken'ichiro Tanaka
We propose algorithms to take point sets for kernel-based interpolation of functions in reproducing kernel Hilbert spaces (RKHSs) by convex optimization.
Numerical Analysis 65D05, 65D15, 41A05, 46E22