✦ LIBER ✦

An algorithm for computing generalized Euler's transformations of series

✍ Scribed by B. Gabutti

Publisher: Springer Vienna
Year: 1985
Tongue: English
Weight: 397 KB
Volume: 34
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02259839

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numerical application of Euler's series

Numerical application of Euler's series transformation and its generalizations

✍ Wilhelm Niethammer 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 619 KB

An improved parallel algorithm for compu

An improved parallel algorithm for computing the generalized inverse A+

✍ Guorong Wang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 433 KB

A lag-averaged generalization of Euler's

A lag-averaged generalization of Euler's method for accelerating series

✍ John P. Boyd 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A short note on the generalized Euler tr

A short note on the generalized Euler transform for the summation of power series

✍ Paul Sablonnière 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 441 KB

An algorithm for the computation of the

An algorithm for the computation of the Tustin bilinear transformation

✍ Westreich, D. 📂 Article 📅 1989 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 79 KB 👁 2 views

Polynomials arising in factoring general

Polynomials arising in factoring generalized Vandermonde determinants: an algorithm for computing their coefficients

✍ S. De Marchi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 476 KB

We consider generalized Vandermonde determinants of the form vs;.(xl .... ,xs) = Ix~'~l, 1\_< i, k < s, where the x~ are distinct points belonging to an interval [a, b] of the real line, the index s stands for the order, the sequence # consists of ordered integers 0 <\_ #1 < ~2 < • " < Ps. These de