✦ LIBER ✦

Approximating xn efficiently

✍ Scribed by Chandrasekhar Narayanaswami; William Luken

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 514 KB
Volume: 50
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00035-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rational approximation to xn

✍ D.J Newman 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Approximations to xn and ¦x¦—a survey

✍ A.R Reddy 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 454 KB

On approximation of XN by incomplete pol

On approximation of XN by incomplete polynomials

✍ I Borosh; C.K Chui; P.W Smith 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 370 KB

Rational approximations with real poles

Rational approximations with real poles to e−xand xn

✍ Peter B Borwein 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of

Efficient co-monotone approximation

✍ D.J. Newman 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 154 KB