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 this page instead for the normal view: A Characterization Theorem for the Best L 1 Piecewise Monotonic Data Approximation Problem |
scientific article; zbMATH DE number 6779890
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
