𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for computing a Padé approximant with minimal degree denominator

✍ Scribed by O.L. Ibryaeva; V.M. Adukov

Book ID
118241665
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
262 KB
Volume
237
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for minimal degree linear C
An algorithm for minimal degree linear Chebyshev approximation on a discrete set
✍ F. D. K. Roberts 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 779 KB

## Abstract An algorithm for computing a linear Chebyshev approximation to a function defined on a finite set of points is presented. The method requires the accuracy of the approximation to be specified, and determines the least degree approximation which achieves this accuracy. The algorithm is b

An algorithm for constructing a class of
An algorithm for constructing a class of Padé approximants of vector functions
✍ R. Sadaka 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 558 KB

In this paper, in the first part, we present an algorithm for constructing the Pad6 approximant of a vector function defined by Sadaka (1996). In the second part we give two recurrence relations between the elements of adjacent systems.