Results 11 to 20 of about 159,459 (289)
About a non-standard interpolation problem [PDF]
Using algebraic methods, and motivated by the one variable case, we study a multipoint interpolation problem in the setting of several complex variables.
Alpay, Daniel, Yger, Alain
core +4 more sources
Regular polynomial interpolation and approximation of global solutions of linear partial differential equations [PDF]
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations.
Kampen, Joerg
core +4 more sources
Equidistribution of the Fekete points on the sphere [PDF]
The Fekete points are the points that maximize a Vandermonde-type determinant that appears in the polynomial Lagrange interpolation formula. They are well suited points for interpolation formulas and numerical integration.
D.P. Hardin +10 more
core +2 more sources
A Discrete Adapted Hierarchical Basis Solver For Radial Basis Function Interpolation
In this paper we develop a discrete Hierarchical Basis (HB) to efficiently solve the Radial Basis Function (RBF) interpolation problem with variable polynomial order.
Castrillon-Candas, Julio Enrique +2 more
core +1 more source
On Newton's interpolation polynomials
AbstractIn this paper functional analytic methods for nuclear locally convex spaces are applied to problems of analytic functions. The question is discussed whether the so-called Newton interpolation polynomials constitute a Schauder-basis in the space of analytic functions on the open unit circle (see Markuševič [3]).
openaire +3 more sources
On the constrained mock-Chebyshev least-squares
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic.
De Marchi, Stefano +2 more
core +1 more source
General Linearized Polynomial Interpolation and Its Applications
In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes.
Suter, Bruce W. +2 more
core +1 more source
Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation
We apply multivariate Lagrange interpolation to synthesize polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitative loop invariant to solving constraints over program variables and unknown ...
A Chakarov +23 more
core +1 more source
The Leja method revisited: backward error analysis for the matrix exponential [PDF]
The Leja method is a polynomial interpolation procedure that can be used to compute matrix functions. In particular, computing the action of the matrix exponential on a given vector is a typical application.
Caliari, Marco +3 more
core +2 more sources
Domain-of-Attraction Estimation for Uncertain Non-polynomial Systems
In this paper, we consider the problem of computing estimates of the domain-of-attraction for non-polynomial systems. A polynomial approximation technique, based on multivariate polynomial interpolation and error analysis for remaining functions, is ...
Lin, Wang, Wu, Min, Yang, Zhengfeng
core +1 more source

