Optimal computation of the Bernstein algorithm for the bound of an interval polynomial (Q1159437): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4099123 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5566070 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on a polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for an interval polynomial / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the Bernstein algorithm for bounds for interval polynomials / rank | |||
Normal rank | |||
Revision as of 13:36, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal computation of the Bernstein algorithm for the bound of an interval polynomial |
scientific article |
Statements
Optimal computation of the Bernstein algorithm for the bound of an interval polynomial (English)
0 references
1982
0 references
Bernstein polynomial
0 references
upper and lower bounds
0 references
interval polynomials
0 references
Bernstein coefficients
0 references
