Abstract

For the interpolation of continuous functions and the solution of partial differential equation (PDE) by radial basis function (RBF) collocation, it has been observed that solution becomes increasingly more accurate as the shape of the RBF is flattened by the adjustment of a shape parameter. In the case of interpolation of continuous functions, it has been proven that in the limit of increasingly flat RBF, the interpolant reduces to Lagrangian polynomials. Does this limiting behavior implies that RBFs can perform no better than Lagrangian polynomials in the interpolation of a function, as well as in the solution of PDE? In this paper, arbitrary precision computation is used to test these and other conjectures. It is found that RBF in fact performs better than polynomials, as the optimal shape parameter exists not in the limit, but at a finite value.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.