✦ LIBER ✦

A new algorithm for arbitrary transformation of polynomial and rational functions

✍ Scribed by Chan, S.C.; Ho, K.L.

Book ID: 119789165
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 503 KB
Volume: 40
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.124959

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple algorithm for arbitrary polynom

A simple algorithm for arbitrary polynomial transformation

✍ Heinen, J.A.; Siddique, B.M.A. 📂 Article 📅 1988 🏛 IEEE ⚖ 364 KB

The general recurrence relation for arbi

The general recurrence relation for arbitrary rational transformation of polynomials

✍ Erfani, S.; Ahmadi, M.; Ramachandran, V. 📂 Article 📅 1989 🏛 IEEE ⚖ 266 KB

Split-Radix Algorithms for Arbitrary Ord

Split-Radix Algorithms for Arbitrary Order of Polynomial Time Frequency Transforms

✍ Bi, G.; Wei, Y. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 514 KB

A New Algorithm for Finding Rational Fir

A New Algorithm for Finding Rational First Integrals of Polynomial Vector Fields

✍ Antoni Ferragut; Héctor Giacomini 📂 Article 📅 2010 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 190 KB

A new computational algorithm for Green'

A new computational algorithm for Green's functions: Fourier transform of the Newton polynomial expansion

✍ Scott M. Auerbach; Claude Leforestier 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

A new iterative method to compute the Green's function for continuum systems is presented. It is based on a Newton polynomial expansion of the corresponding propagator, followed by accurate half-Fourier transformation. The new technique is remarkably stable, accurate and can handle very large system

A lifting and recombination algorithm fo

A lifting and recombination algorithm for rational factorization of sparse polynomials

✍ Martin Weimann 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 350 KB