Computing monomial interpolating basis for multivariate polynomial interpolation

05/23/2020
by   Y. H. Gong, et al.
0

In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design an algorithm for it. Based on the notion, for any monomial ordering we present a new method to read off the <-minimal monomial interpolating basis from monomials appearing in the polynomials representing the interpolation conditions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2020

Groebner basis structure of ideal interpolation

We study the relationship between certain Groebner bases for zero dimens...
research
01/24/2020

Sparse Interpolation in Terms of Multivariate Chebyshev Polynomials

Sparse interpolation refers to the exact recovery of a function as a sho...
research
03/17/2020

An Algorithm for Computing a Minimal Comprehensive Gröbner Basis of a Parametric Polynomial System

An algorithm to generate a minimal comprehensive Gröbner basis of a par...
research
11/19/2019

Adaptive Sparse Polynomial Chaos Expansions via Leja Interpolation

This work suggests an interpolation-based stochastic collocation method ...
research
07/08/2018

RBF-LOI: Augmenting Radial Basis Functions (RBFs) with Least Orthogonal Interpolation (LOI) for Solving PDEs on Surfaces

We present a new method for the solution of PDEs on manifolds M⊂R^d of c...
research
02/15/2022

On Polynomial Ideals And Overconvergence In Tate Algebras

In this paper, we study ideals spanned by polynomials or overconvergent ...
research
09/11/2022

Exact Algorithms for Computing Generalized Eigenspaces of Matrices via Annihilating Polynomials

An effective exact method is proposed for computing generalized eigenspa...

Please sign up or login with your details

Forgot password? Click here to reset