Comments on some B-spline algorithms (Q1068507): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/computing/Lee86, #quickstatements; #temporary_batch_1731547958265 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02240069 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W293562929 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/computing/Lee86 / rank | |||
Normal rank | |||
Latest revision as of 02:42, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comments on some B-spline algorithms |
scientific article |
Statements
Comments on some B-spline algorithms (English)
0 references
1986
0 references
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.
0 references
B-spline expansion
0 references
algorithms
0 references
derivatives
0 references
test examples
0 references
