✦ LIBER ✦

Fast algorithms through divide- and combine-and-conquer strategies

✍ Scribed by José M. Pérez-Jordá

Book ID: 104109856
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 83 KB
Volume: 117
Category: Article
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(98)00110-6

No coin nor oath required. For personal study only.

✦ Synopsis

The fast Fourier transform (FFF) algorithm is explained in a simple and rLovel way. It is shown how the two canonic forms of the Fb"I" (decimation in time and decimation in ,frequency) can be respectively arranged as "combine-and-conquer" or "'divide-and-conquer" algorithms. @

📜 SIMILAR VOLUMES

Divide-and-conquer algorithms on the hyp

Divide-and-conquer algorithms on the hypercube

✍ Ernst W Mayr; Ralph Werchner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 946 KB

Applications of a strategy for designing

Applications of a strategy for designing divide-and-conquer algorithms

✍ Douglas R. Smith 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 965 KB

A scalable divide-and-conquer algorithm

A scalable divide-and-conquer algorithm combining coarse and fine-grain parallelization

✍ Sor Koon Goh; Carlos P. Sosa; Alain St-Amant 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 221 KB

Practical improvement of the divide-and-

Practical improvement of the divide-and-conquer eigenvalue algorithms

✍ D. Bini; V. Pan 📂 Article 📅 1992 🏛 Springer Vienna 🌐 English ⚖ 793 KB

Divide-and-Conquer Algorithms for Partit

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

✍ Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 634 KB

Modeling and simulation of parallel adap

Modeling and simulation of parallel adaptive divide-and-conquer algorithms

✍ Fernando J. Barros 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 396 KB