Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Fast Fourier Transform Algorithms for Parallel Computers, Daisuke Takahashi


Варианты приобретения
Цена: 15372.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Daisuke Takahashi
Название:  Fast Fourier Transform Algorithms for Parallel Computers
ISBN: 9789811399640
Издательство: Springer
Классификация:

ISBN-10: 9811399646
Обложка/Формат: Hardcover
Страницы: 114
Вес: 0.36 кг.
Дата издания: 2019
Серия: High-Performance Computing Series
Язык: English
Издание: 1st ed. 2019
Иллюстрации: 32 illustrations, black and white; ix, 114 p. 32 illus.
Размер: 234 x 156 x 10
Читательская аудитория: Professional & vocational
Основная тема: Computer Science
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems.Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniques relevant to the FFT in state-of-the-art parallel computers. Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers.
Дополнительное описание: Chapter 1: Introduction.- Chapter 2: Fast Fourier Transform.- Chapter 3: Mixed-Radix FFT Algorithms.- Chapter 4: Split-Radix FFT Algorithms.- Chapter 5: Multidimensional FFT Algorithms.- Chapter 6: High-Performance FFT Algorithms.- Chapter 7: Parallel FFT



Handbook of Approximation Algorithms and Metaheuristics

Название: Handbook of Approximation Algorithms and Metaheuristics
ISBN: 1498770150 ISBN-13(EAN): 9781498770156
Издательство: Taylor&Francis
Рейтинг:
Цена: 65076.00 р.
Наличие на складе: Поставка под заказ.

Описание: This handbook reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.

Modern Computer Algebra

Автор: von zur Gathen
Название: Modern Computer Algebra
ISBN: 1107039037 ISBN-13(EAN): 9781107039032
Издательство: Cambridge Academ
Рейтинг:
Цена: 17582.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students, this textbook is widely regarded as the `bible of computer algebra`. Its comprehensiveness and reliability also makes it an essential reference for professionals. This updated edition includes an overview of recent improvements in areas like primality testing.

The Sparse Fourier Transform

Автор: Haitham Hassanieh
Название: The Sparse Fourier Transform
ISBN: 1947487078 ISBN-13(EAN): 9781947487079
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 12860.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.

The Sparse Fourier Transform

Автор: Hassanieh Haitham
Название: The Sparse Fourier Transform
ISBN: 1947487043 ISBN-13(EAN): 9781947487048
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 10352.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.

Introduction to Distributed Self-Stabilizing Algorithms

Автор: Karine Altisen, Stephane Devismes, Swan Dubois, Franck Petit
Название: Introduction to Distributed Self-Stabilizing Algorithms
ISBN: 1681735369 ISBN-13(EAN): 9781681735368
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 10811.00 р.
Наличие на складе: Нет в наличии.

Описание: This book aims at being a comprehensive and pedagogical introduction to the concept of self-stabilization , introduced by Edsger Wybe Dijkstra in 1973. Self-stabilization characterizes the ability of a distributed algorithm to converge within finite time to a configuration from which its behavior is correct (i.e., satisfies a given specification), regardless the arbitrary initial configuration of the system. This arbitrary initial configuration may be the result of the occurrence of a finite number of transient faults. Hence, self-stabilization is actually considered as a versatile non-masking fault tolerance approach, since it recovers from the effect of any finite number of such faults in a unified manner. Another major interest of such an automatic recovery method comes from the difficulty of resetting malfunctioning devices in a large-scale (and so, geographically spread) distributed system (the Internet, Pair-to-Pair networks, and Delay Tolerant Networks are examples of such distributed systems). Furthermore, self-stabilization is usually recognized as a lightweight property to achieve fault tolerance as compared to other classical fault tolerance approaches. Indeed, the overhead, both in terms of time and space, of state-of-the-art self-stabilizing algorithms is commonly small. This makes self-stabilization very attractive for distributed systems equipped of processes with low computational and memory capabilities, such as wireless sensor networks. After more than 40 years of existence, self-stabilization is now sufficiently established as an important field of research in theoretical distributed computing to justify its teaching in advanced research-oriented graduate courses. This book is an initiation course, which consists of the formal definition of self-stabilization and its related concepts, followed by a deep review and study of classical (simple) algorithms, commonly used proof schemes and design patterns, as well as premium results issued from the self-stabilizing community. As often happens in the self-stabilizing area, in this book we focus on the proof of correctness and the analytical complexity of the studied distributed self-stabilizing algorithms. Finally, we underline that most of the algorithms studied in this book are actually dedicated to the high-level atomic-state model , which is the most commonly used computational model in the self-stabilizing area. However, in the last chapter, we present general techniques to achieve self-stabilization in the low-level message passing model, as well as example algorithms.

Mathematics of Multidimensional Fourier Transform Algorithms

Автор: Richard Tolimieri; Myoung An; Chao Lu
Название: Mathematics of Multidimensional Fourier Transform Algorithms
ISBN: 1461273528 ISBN-13(EAN): 9781461273523
Издательство: Springer
Рейтинг:
Цена: 13060.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Developing algorithms for multi-dimensional Fourier transforms, this book presents results that yield highly efficient code on a variety of vector and parallel computers.

Collaborative Recommendations: Algorithms, Practical Challenges and Applications

Автор: Berkovsky Shlomo, Cantador Ivan, Tikk Domonkos
Название: Collaborative Recommendations: Algorithms, Practical Challenges and Applications
ISBN: 9813275340 ISBN-13(EAN): 9789813275348
Издательство: World Scientific Publishing
Рейтинг:
Цена: 38808.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

Recommender systems are very popular nowadays, as both an academic research field and services provided by numerous companies for e-commerce, multimedia and Web content. Collaborative-based methods have been the focus of recommender systems research for more than two decades.

The unique feature of the compendium is the technical details of collaborative recommenders. The book chapters include algorithm implementations, elaborate on practical issues faced when deploying these algorithms in large-scale systems, describe various optimizations and decisions made, and list parameters of the algorithms.

This must-have title is a useful reference materials for researchers, IT professionals and those keen to incorporate recommendation technologies into their systems and services.

Geometry and Complexity Theory

Автор: Landsberg JM
Название: Geometry and Complexity Theory
ISBN: 1107199239 ISBN-13(EAN): 9781107199231
Издательство: Cambridge Academ
Рейтинг:
Цена: 9662.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: A comprehensive introduction to algebraic geometry and representation theory written by a leading expert in the field. For graduate students and researchers in computer science and mathematics, the book demonstrates state-of-the-art techniques to solve real world problems, focusing on P vs NP and the complexity of matrix multiplication.

Dynamic Fuzzy Machine Learning

Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao
Название: Dynamic Fuzzy Machine Learning
ISBN: 3110518708 ISBN-13(EAN): 9783110518702
Издательство: Walter de Gruyter
Рейтинг:
Цена: 22439.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.

Sequential and Parallel Algorithms and Data Structures

Название: Sequential and Parallel Algorithms and Data Structures
ISBN: 3030252086 ISBN-13(EAN): 9783030252083
Издательство: Springer
Рейтинг:
Цена: 6288.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This undergraduate textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems.

The Mathematics of Chip-Firing

Автор: Klivans
Название: The Mathematics of Chip-Firing
ISBN: 1138070823 ISBN-13(EAN): 9781138070820
Издательство: Taylor&Francis
Рейтинг:
Цена: 26796.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The Mathematics of Chip-firing is a solid introduction and overview of the growing field of chip-firing. It offers an appreciation for the richness and diversity of the subject. Chip-firing refers to a discrete dynamical system - a commodity is exchanged between sites of a network according to very simple local rules.

Introduction to Recursive Programming

Автор: Rubio-Sanchez
Название: Introduction to Recursive Programming
ISBN: 113810521X ISBN-13(EAN): 9781138105218
Издательство: Taylor&Francis
Рейтинг:
Цена: 22968.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Recursion is an important problem-solving skill that is considered to be one of the most difficult topics to master by CS1/2 students. This book helps students assimilate its fundamental concepts by analyzing a large number of problems of different nature, covering classical problems found in the literature, as well as richer related problems.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия