Lagrange interpolation on subgrids of tensor product grids

Authors:
Thomas Sauer
Affiliations:
Lehrstuhl für Numerische Mathematik, Justus-Liebig-Universität Giessen, Heinrich-Buff-Ring 44, D-35392 Giessen, Germany
Venue:
Mathematics of Computation
Year:
2004

Citing 3
Cited 7

Compositionality in the temporal logic of concurrent systems

Future Generation Computer Systems - Parallel computing
On the history of multivariate polynomial interpolation

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 vol. II: interpolation and extrapolation
The Construction of Multivariate Polynomials with Preassigned Zeros

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra

Multivariate power series multiplication

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Multivariate refinable functions, differences and ideals - a simple tutorial

Journal of Computational and Applied Mathematics
A bivariate preprocessing paradigm for the Buchberger-Möller algorithm

Journal of Computational and Applied Mathematics
Full length article: On the existence of certain error formulas for a special class of ideal projectors

Journal of Approximation Theory
Multiple subdivision schemes

Proceedings of the 7th international conference on Curves and Surfaces
Implicitization of curves and (hyper)surfaces using predicted support

Theoretical Computer Science
Full length article: Multivariate polynomial interpolation on lower sets

Journal of Approximation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note shows that a wide class of algebraically motivated constructions for Lagrange interpolation polynomials always yields a tensor product interpolation space as long as the nodes form a tensor product grid or a lower subset thereof.