Monotonicity conjecture for Gaussian and inverse multiquadric RBF condition numbers

About 2 years old · traced to

Let x⊂Ω⊂Rn\boldsymbol{x}\subset\Omega\subset\mathbb{R}^n be any set of distinct points, and let A(x,ε)\boldsymbol{A}(\boldsymbol{x},\varepsilon) be the RBF interpolation matrix. For ε1>ε2\varepsilon_1>\varepsilon_2, set

A1=A(x,ε1),A2=A(x,ε2).A_1=\boldsymbol{A}(\boldsymbol{x},\varepsilon_1),\qquad A_2=\boldsymbol{A}(\boldsymbol{x},\varepsilon_2).

Condition-number monotonicity conjecture. For the Gaussian or inverse multiquadric RBF,

cond⁡(A1)≤cond⁡(A2).\operatorname{cond}(A_1)\leq\operatorname{cond}(A_2).

The claim formalizes the observed decrease of the matrix condition number as the shape parameter increases. It was proved in the source only for the case N=2N=2; a proof for arbitrary sets of distinct points and dimensions remains open.

References

Primary source

Maria Han Veiga, Faezeh Nassajian Mojarrad and Fatemeh Nassajian Mojarrad, “Learning a robust shape parameter for RBF approximation”, arXiv:2408.05081 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.