A new algorithm for a recursive construction of the minimal interpolation space

Authors:
D. Sbibih;A. Serghini;A. Tijini
Affiliations:
University Mohammed I, FSO, MATSI Laboratory, Oujda, Morocco;University Mohammed I, FSO, MATSI Laboratory, Oujda, Morocco;University Mohammed I, FSO, MATSI Laboratory, Oujda, Morocco
Venue:
Mathematics and Computers in Simulation
Year:
2009

Citing 6
Cited 0

On calculating normalized Powell-Sabin B-splines

Computer Aided Geometric Design
Piecewise Quadratic Approximations on Triangles

ACM Transactions on Mathematical Software (TOMS)
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Properly posed set of nodes for bivariate Lagrange interpolation along an algebraic curve

Analysis, combinatorics and computing
The application of Cayley-Bacharach theorem to bivariate Lagrange interpolation

Journal of Computational and Applied Mathematics - Special issue on proceedings of the international symposium on computational mathematics and applications
A recursive method for computing interpolants

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we introduce a new interpolation algorithm, based on a recursive method for computing Lagrange interpolants. This algorithm allows to construct recursively the minimal interpolation space (see [1]) with respect to a finite set of points. We also extend this recursive method to the osculatory interpolation problem.