Abstract

The present study introduces results about unique solvability of Gaussian RBF interpolation with the different data sites and basis centers. For $$ N=2 $$N=2, we show that the interpolation matrix is singular only when the vector of difference between basis centers and the vector of difference between data sites are perpendicular to each other. For $$N>2$$N>2, we show certain states that the interpolation matrix is singular, then we provide several mild conditions which guarantee the interpolation matrix to be non-singular. We propose an algorithm to describe how to choose the basis centers and data sites. The results show that if the basis centers are chosen different from the data sites, the interpolation is uniquely solvable under mild conditions.

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.