@article {MATHEDUC.06526676,
author = {Vajda, R\'obert},
title = {Exploring Hermite interpolation polynomials using recursion.},
year = {2015},
journal = {Annales Mathematicae et Informaticae},
volume = {45},
issn = {1787-5021},
pages = {151-160},
publisher = {Eszterh\'azy K\'aroly College, Institute of Mathematics and Computer Science, Eger},
abstract = {Summary: Summary. In this paper we consider the teaching of Hermite interpolation. We propose here two nonstandard approaches for exploring Hermite interpolation polynomials in a computer supported environment. As an extension to the standard construction of the interpolation polynomials based on either on the fundamental polynomials or the triangular shaped divided difference table, we first investigate the generalization of the Neville type recursive scheme which may be familiar to the reader or to the student from the chapter about Lagrangian interpolation. Second, we propose an interactive demo tool where by the step-by-step construction of the interpolation polynomial, the interpolation constraints can be considered in an almost arbitrary order. Thus the same interpolating polynomial can be constructed in several different ways. As a by-product, one can also ask an interesting combinatorial problem from the students about the number of compatible orders of the constraints depending on the cardinality of node system.},
msc2010 = {N55xx (U75xx)},
identifier = {2016a.00948},
}