𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A recursive method for computing interpolants

✍ Scribed by D. Barrera; D. Sbibih; A. Serghini; A. Tijini

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
590 KB
Volume
216
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in R d . We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points.

πŸ“œ SIMILAR VOLUMES

A degree by degree recursive constructio
A degree by degree recursive construction of Hermite spline interpolants
✍ Xuli Han πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 853 KB

Based on the classical Hermite spline interpolant H 2n-1 , which is the piecewise interpolation polynomial of class C n-1 and degree 2n -1, a piecewise interpolation polynomial H 2n of degree 2n is given. The formulas for computing H 2n by H 2n-1 and computing H 2n+1 by H 2n are shown. Thus a simple

RComp: A Mathematica Package for Computi
RComp: A Mathematica Package for Computing with Recursive Sequences
✍ IstvΓ‘n Nemes; Marko PetkovΕ‘ek πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 228 KB

The set of sequences that satisfy some linear recurrence relation with constant coefficients is considered. Operations over this set are implemented in the computer algebra system Mathematica. For representing sequences several finite representations are provided together with functions which conver