✦ LIBER ✦

Optimal computation of the Bernstein algorithm for the bound of an interval polynomial

✍ Scribed by J. Rokne

Publisher: Springer Vienna
Year: 1982
Tongue: English
Weight: 358 KB
Volume: 28
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02241751

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the Bernstein algorithm for bo

A note on the Bernstein algorithm for bounds for interval polynomials

✍ J. Rokne 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 510 KB

An efficient algorithm for range computa

An efficient algorithm for range computation of polynomials using the Bernstein form

✍ Shashwati Ray; P. S. V. Nataraj 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 274 KB

An optimal algorithm for the approximate

An optimal algorithm for the approximate computation of quadratures

✍ S.S. Gaisaryan 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 563 KB

Bernstein's asymptotic best bound for th

Bernstein's asymptotic best bound for the Kth derivative of a polynomial

✍ Robert Whitley 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Constructibility of the Set of Polynomia

Constructibility of the Set of Polynomials with a Fixed Bernstein–Sato Polynomial: an Algorithmic Approach

✍ Anton Leykin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Let n and d be positive integers, let k be a field and let P(n, d; k) be the space of the non-zero polynomials in n variables of degree at most d with coefficients in k. Let B(n, d) be the set of the Bernstein-Sato polynomials of all polynomials in P(n, d; k) as k varies over all fields of character

An interval branch and bound algorithm f

An interval branch and bound algorithm for global optimization of a multiperiod pricing model

✍ M.A. Venkataramanan; A.V. Cabot; W.L. Winston 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 467 KB