A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data (Q3006132): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: L2WPMA / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037058319 / rank | |||
Normal rank | |||
Latest revision as of 19:56, 19 March 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
