Constructing nested nodal sets for multivariate polynomial interpolation

DOI10.1137/12089613XMaRDI QIDQ2870645zbMATH OpenOpenAlexFDO

Authors Dongbin Xiu, Akil C. Narayan

Publication date 21 January 2014

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/12089613x

zbMATH Keywords

greedy optimizationLebesgue constantmultivariate polynomial interpolationVandermonde condition numberVandermonde determinant

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Multidimensional problems (41A63) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical interpolation (65D05) Numerical computation of determinants (65F40)

Review text

The authors introduce a robust method for choosing multivariate polynomial interpolation nodes. Their method can produce an arbitrary number of nodes and is not constrained by the dimension of a complete polynomial space. They also 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.

Recommendations

• Bivariate polynomial interpolation on the square at new nodal sets
• Approximating optimal point configurations for multivariate polynomial interpolation
• scientific article; zbMATH DE number 4161349
• An explicit construction of interpolation nodes on the simplex
• Polynomial Interpolation on Quasi-Equidistributed Nodes on the Unit Disk

Cited in

(14)

• The numerical approximation of nonlinear functionals and functional differential equations
• Unisolvency for polynomial interpolation in simplices with symmetrical nodal distributions
• A new constructive and elementary proof of a Bernstein-Walsh theorem, improved to infinite order convergence, for functions \(C^\infty\) in an intricate but smooth two-dimensional real domain
• Approximating optimal point configurations for multivariate polynomial interpolation
• Nonadaptive quasi-optimal points selection for least squares linear regression
• A comparison of high order interpolation nodes for the pyramid
• scientific article; zbMATH DE number 4206239 (Why is no real title available?)
• Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
• From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
• Nearly optimal nested sensors location for polynomial regression on complex geometries
• Uncertainty quantification of derivative instruments
• scientific article; zbMATH DE number 6255426 (Why is no real title available?)
• An AI-aided algorithm for multivariate polynomial reconstruction on Cartesian grids and the PLG finite difference method
• Optimal sampling patterns for Zernike polynomials

This page was built for publication: Constructing nested nodal sets for multivariate polynomial interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870645)