Interpolation from spaces spanned by monomials
نویسنده
چکیده
This is an extension and emendation of recent results on the use of Gauss elimination in multivariate polynomial interpolation and, in particular, ideal interpolation. Let Π ⊂ (IF → IF) be the space of all polynomials in d real (IF = IR) or complex (IF = C) variables. Let Q be an n-row map on Π, i.e., a linear map from Π to IF, and consider the task of solving
منابع مشابه
Ideal Interpolation: Mourrain’s Condition Vs D-invariance
Mourrain [Mo] characterizes those linear projectors on a finite-dimensional polynomial space that can be extended to an ideal projector, i.e., a projector on polynomials whose kernel is an ideal. This is important in the construction of normal form algorithms for a polynomial ideal. Mourrain’s characterization requires the polynomial space to be ‘connected to 1’, a condition that is implied by ...
متن کاملINTERPOLATION BY HYPERBOLIC B-SPLINE FUNCTIONS
In this paper we present a new kind of B-splines, called hyperbolic B-splines generated over the space spanned by hyperbolic functions and we use it to interpolate an arbitrary function on a set of points. Numerical tests for illustrating hyperbolic B-spline are presented.
متن کاملRadial Basis Functions: L -approximation orders with scattered centres
In this paper we generalize several results on uniform approximation orders with radial basis functions in (Buhmann, Dyn and Levin, 1993) and (Dyn and Ron, 1993) to L-approximation orders. These results apply, in particular, to approximants from spaces spanned by translates of radial basis functions by scattered centres. Examples to which our results apply include quasi-interpolation and least-...
متن کاملNumerical Simulation of 1D Linear Telegraph Equation With Variable Coefficients Using Meshless Local Radial Point Interpolation (MLRPI)
In the current work, we implement the meshless local radial point interpolation (MLRPI) method to find numerical solution of one-dimensional linear telegraph equations with variable coefficients. The MLRPI method, as a meshless technique, does not require any background integration cells and all integrations are carried out locally over small quadrature domains of regular shapes, such as lines ...
متن کاملBoolean Functions with Large Distance to All Bijective Monomials: N Odd Case
Cryptographic Boolean functions should have large distance to functions with simple algebraic description to avoid cryptanalytic attacks based on successive approximation of the round function such as the interpolation attack. Hyper-bent functions achieve the maximal minimum distance to all the coordinate functions of all bijective monomials. However, this class of functions exists only for fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Comput. Math.
دوره 26 شماره
صفحات -
تاریخ انتشار 2007