✦ LIBER ✦

Two new algorithms for rational approximation

✍ Scribed by E. W. Cheney; H. L. Loeb

Publisher: Springer-Verlag
Year: 1961
Tongue: English
Weight: 177 KB
Volume: 3
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01386002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rational chebyshev approximation by Reme

Rational chebyshev approximation by Remes' algorithms

✍ Anthony Ralston 📂 Article 📅 1965 🏛 Springer-Verlag 🌐 English ⚖ 465 KB

An improved algorithm for rational appro

An improved algorithm for rational approximation of transfer functions

✍ V. Kukk 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB

A parallel algorithm for discrete least

A parallel algorithm for discrete least squares rational approximation

✍ Marc Van Barel; Adhemar Bultheel 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 889 KB

A new algorithm for osculatory rational

A new algorithm for osculatory rational interpolation

✍ G. Claessens 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

Failure of the Wittmeyer algorithm for r

Failure of the Wittmeyer algorithm for rational mean square approximation

✍ Charles B Dunham 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 92 KB

New approximation algorithm for RTILE pr

New approximation algorithm for RTILE problem

✍ Krzysztof Lorys; Katarzyna E. Paluch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 337 KB

For a given two-dimensional array of nonnegative numbers and a positive integer p we want to ÿnd a covering of the array with p tiles so as to minimize the weight of the heaviest tile. We present a 9 4 -approximation linear-time algorithm for this problem, which improves on the previous best result.