Name
Abstract | ||
|---|---|---|
We present a robust method for choosing multivariate polynomial interpolation nodes. Our algorithm is an optimization method to greedily minimize a measure of interpolant sensitivity, a variant of a weighted Lebesgue function. Nodes are therefore chosen that tend to control oscillations in the resulting interpolant. This method can produce an arbitrary number of nodes and is not constrained by the dimension of a complete polynomial space. Our method is therefore flexible: nested nodal sets are produced in spaces of arbitrary dimensions, and the number of nodes added at each stage can be arbitrary. The algorithm produces a nodal set given a probability measure on the input space, thus parameterizing interpolants with respect to finite measures. We present examples to show that the method yields nodal sets that behave well with respect to standard interpolation diagnostics: the Lebesgue constant, the Vandermonde determinant, and the Vandermonde condition number. We also show that a nongreedy version of the nodal array has a strong connection with equilibrium measures from weighted pluripotential theory. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1137/12089613X | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
multivariate interpolation,Lebesgue constant,greedy optimization | Discrete mathematics,Nearest-neighbor interpolation,Mathematical optimization,Condition number,Multivariate interpolation,Polynomial interpolation,Mathematical analysis,Probability measure,Interpolation,Vandermonde matrix,Mathematics,Lebesgue integration | Journal |
Volume | Issue | ISSN |
35 | 5 | 1064-8275 |
Citations | PageRank | References |
4 | 0.46 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akil Narayan | 1 | 77 | 12.59 |
| Dongbin Xiu | 2 | 1068 | 115.57 |