Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set (Q2532223): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on Jordan elimination, linear programming and Tchebyscheff approximation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3285992 / rank | |||
Normal rank | |||
Latest revision as of 22:57, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set |
scientific article |
Statements
Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set (English)
0 references
1966
0 references
numerical analysis
0 references
