Comments on some B-spline algorithms
From MaRDI portal
Two algorithms have appeared [the author, ibid. 29, 365-371 (1982; Zbl 0485.65008) and \textit{W. Böhm}, ibid. 33, 171-177 (1984; Zbl 0546.65003)] for the computation of derivatives of a B-spline series that are significantly faster than the repeated applications of \textit{C. de Boor}'s algorithm [J. Approximation Theory 6, 50-62 (1972; Zbl 0239.41006)] to the derived series. This note presents some test examples which show, however, that both these are less stable than the repeated de Boor. Some suggestions are made.
Recommendations
Cites work
Cited in
(12)- Some remarks concerning B-splines
- Computing the derivative of NURBS with respect to a knot
- \(B\)-splines of arbitrary degree
- Efficient algorithms for the implementations of B-splines
- scientific article; zbMATH DE number 1283878 (Why is no real title available?)
- scientific article; zbMATH DE number 4115197 (Why is no real title available?)
- On the numerical computation of the derivatives of a B-spline series
- On calculation of scalar products of B-splines
- Dubins path-based dynamic soaring trajectory planning and tracking control in a gradient wind field
- Computing a chain of blossoms, with application to products of splines
- Computing a chain of blossoms, with application to products of splines
- Efficient evaluation of splines
This page was built for publication: Comments on some B-spline algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068507)