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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. A. Barsky, Computer Graphics and Geometric Modelling Using Beta-Splines (Springer, Heidelberg, Germany, 1988).
W. Boehm, G. Farin and J. Kahman, A survey of curve and surface methods in CAGD, Computer Aided Geometric Design 1 (1984) 1–60.
R. Kulkarni and P. J. Laurent, Q-splines, Numerical Algorithms 1 (1991) 45–74.
J. P. Lasalle, The stability and control of discrete processes, Applied Mathematical Sciences 62 (1986) 24–29.
A. Nigro, Algorithmes progressifs stables pour l'approximation de courbes et surfaces, Thèse de l'Université Joseph-Fourier de Grenoble, France (1995).
L. Ramshaw, Blossoming: A connect-the-dots approach to splines, DEC System Research Center, Report 19 (June 1987).
A. Seredinski, Principe de la méthode des A-splines récurrentes pour l'interpolation et la compression des signaux, Traitement du Signal 9(2) (1992) 175–191.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nigro, A., Laurent, P. Progressive stable interpolation. Numerical Algorithms 14, 343–359 (1997). https://doi.org/10.1023/A:1019129400864
Issue Date:
DOI: https://doi.org/10.1023/A:1019129400864