A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem (Q5359535)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6779890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem |
scientific article; zbMATH DE number 6779890 |
Statements
A Characterization Theorem for the Best L 1 Piecewise Monotonic Data Approximation Problem (English)
0 references
25 September 2017
0 references
data approximation problem
0 references
univariate data
0 references
random errors
0 references
dynamic programming procedure
0 references
0.8621108531951904
0 references
0.8338746428489685
0 references
0.8337292671203613
0 references
0.8315563797950745
0 references
