Electronic Resource
Springer
Numerische Mathematik
48 (1986), S. 463-477
ISSN:
0945-3245
Keywords:
AMS(MOS): 65D15
;
CR: G1.2
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary An algorithm for computing a set of knots which is optimal for the segment approximation problem is developed. The method yields a sequence of real numbers which converges to the minimal deviation and a corresponding sequence of knot sets. This sequence splits into at most two subsequences which converge to leveled sets of knots. Such knot sets are optimal. Numerical results concerning piecewise polynomial approximation are given.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01389652
Permalink
|
Location |
Call Number |
Expected |
Availability |