A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data (Q3006132): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:33, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data |
scientific article |
Statements
A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data (English)
0 references
10 June 2011
0 references
minimax approximation
0 references
piecewise linear representations
0 references
Remez algorithm
0 references
parameter estimation
0 references
numerical examples
0 references
