Abstract
In this paper we give results that lead to stable algorithms for computing with trigonometric splines. In particular we show that certain trigonometric B-splines satisfy a recurrence relation similar to the one for polynomial splines. We also show how these trigonometric B-splines can be differentiated, and a trigonometric version of Marsden's identity is given. The results are obtained by studying certain trigonometric divided differences.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
