✦ LIBER ✦

An FFT algorithm based fast algorithm for arbitrary polynomial transformation

✍ Scribed by Krishna, H.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple algorithm for arbitrary polynom

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

An efficient algorithm for cyclic convol

✍ Cheng Lizhi; Jiang Zengrong 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 548 KB

Improved FFT-based numerical inversion o

✍ Chyi Hwang; Ming-Jeng Lu; Leang S. Shieh 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Improved fast polynomial transform algor

✍ Albert Ming Loh; Wan-Chi Siu 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 388 KB

Fast parallel algorithms for polynomial

✍ D. Bini; V. Pan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Fast FFT-based algorithm for phase estim

✍ Frost, R. L. ;Rushforth, C. K. ;Baxter, B. S. 📂 Article 📅 1979 🏛 The Optical Society 🌐 English ⚖ 720 KB