On the number of segments needed in a piecewise linear approximation (Q964964)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of segments needed in a piecewise linear approximation |
scientific article; zbMATH DE number 5696593
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of segments needed in a piecewise linear approximation |
scientific article; zbMATH DE number 5696593 |
Statements
On the number of segments needed in a piecewise linear approximation (English)
0 references
21 April 2010
0 references
This article is about the piecewise uniform approximation of functions on intervals \([a,b]\). If piecewise linear approximations on intervals are required up to a prescribed uniform accuracy, the question arises how many pieces are required in order to obtain that accuracy \(\varepsilon>0\). In this paper, a couple of theorems is provided that answer this question asymptotically for small \(\varepsilon\). The answer depends, among other things, essentially on the second derivative of the approximated function if it is sufficiently smooth.
0 references
piecewise linear approximation
0 references
numeric function generators
0 references
0.8986192
0 references
0.8976565
0 references
0 references
0.88032544
0 references
0.8692971
0 references
0.8663336
0 references
0.8634695
0 references