Progressive stable interpolation

Abstract

In this paper, we study several interpolating and smoothing methods for data which are known “progressively”. The algorithms proposed are governed by recurrence relations and our principal goal is to study their stability. A recurrence relation will be said stable if the spectral radius of the associated matrix is less than one. The iteration matrices depend on shape parameters which come either from the connection at the knots, or from the nature of the interpolant between two knots. We obtain various stability domains. Moving the parameters inside these domains leads to interesting shape effects.