𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A modified fast Fourier transform for polynomial evaluation and the jenkins-Traub algorithm

✍ Scribed by William W. Hager

Publisher
Springer-Verlag
Year
1986
Tongue
English
Weight
381 KB
Volume
50
Category
Article
ISSN
0029-599X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A high-performance fast Fourier transfor
A high-performance fast Fourier transform algorithm for the Cray-2
✍ David H. Bailey πŸ“‚ Article πŸ“… 1987 πŸ› Springer US 🌐 English βš– 660 KB

Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently d

Adaptation of a fast Fourier transform-b
Adaptation of a fast Fourier transform-based docking algorithm for protein design
✍ Po-Ssu Huang; John J. Love; Stephen L. Mayo πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 333 KB

## Abstract Designing proteins with novel protein/protein binding properties can be achieved by combining the tools that have been developed independently for protein docking and protein design. We describe here the sequence‐independent generation of protein dimer orientations by protein docking fo

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

New fast algorithms for polynomial inter
New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
✍ V.Y. Pan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 250 KB

For a polynomial p(x) of a degree n, we study its interpolation and evaluation on a set of Chebyshev nodes, x k = cos((2k + 1)~r/(2n + 2)), k = 0,1,... ,n. This is easily reduced to applying discrete Fourier transforms (DFTs) to the auxiliary polynomial q(w) = w'~p(x), where 2x = ~w + (aw) -1, a ---