Are the degrees of the best (co)convex and unconstrained polynomial approximations the same? II (Q3076330): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094860359 / rank | |||
Normal rank | |||
Latest revision as of 00:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Are the degrees of the best (co)convex and unconstrained polynomial approximations the same? II |
scientific article |
Statements
Are the degrees of the best (co)convex and unconstrained polynomial approximations the same? II (English)
0 references
22 February 2011
0 references
best (co)convex polynomial approximation
0 references
unconstrained polynomial approximation
0 references
